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/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:52:53,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:52:53,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:52:53,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:52:53,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:52:53,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:52:53,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:52:53,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:52:53,317 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:52:53,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:52:53,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:52:53,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:52:53,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:52:53,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:52:53,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:52:53,323 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:52:53,324 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:52:53,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:52:53,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:52:53,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:52:53,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:52:53,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:52:53,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:52:53,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:52:53,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:52:53,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:52:53,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:52:53,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:52:53,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:52:53,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:52:53,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:52:53,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:52:53,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:52:53,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:52:53,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:52:53,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:52:53,343 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 [2018-12-03 15:52:53,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:52:53,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:52:53,357 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:52:53,357 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:52:53,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:52:53,357 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:52:53,357 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:52:53,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:52:53,358 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:52:53,358 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:52:53,358 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:52:53,358 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:52:53,359 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:52:53,359 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:52:53,359 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:52:53,360 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:52:53,360 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:52:53,360 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:52:53,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:52:53,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:52:53,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:52:53,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:52:53,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:52:53,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:52:53,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:52:53,362 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:52:53,362 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:52:53,362 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:52:53,362 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:52:53,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:52:53,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:52:53,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:52:53,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:52:53,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:52:53,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:52:53,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:52:53,366 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:52:53,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:52:53,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:52:53,366 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:52:53,368 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:52:53,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:52:53,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:52:53,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:52:53,435 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:52:53,436 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:52:53,436 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-12-03 15:52:53,437 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-12-03 15:52:53,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:52:53,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:52:53,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:52:53,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:52:53,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:52:53,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,500 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:52:53,500 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:52:53,501 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:52:53,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:52:53,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:52:53,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:52:53,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:52:53,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... [2018-12-03 15:52:53,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:52:53,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:52:53,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:52:53,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:52:53,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:52:53,599 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:52:53,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:52:53,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:52:53,872 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:52:53,872 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:52:53,873 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:52:53 BoogieIcfgContainer [2018-12-03 15:52:53,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:52:53,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:52:53,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:52:53,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:52:53,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:52:53" (1/2) ... [2018-12-03 15:52:53,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d28589 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:52:53, skipping insertion in model container [2018-12-03 15:52:53,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:52:53" (2/2) ... [2018-12-03 15:52:53,882 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-12-03 15:52:53,893 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:52:53,902 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:52:53,921 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:52:53,964 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:52:53,964 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:52:53,964 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:52:53,965 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:52:53,965 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:52:53,965 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:52:53,965 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:52:53,966 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:52:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:52:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:52:53,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:53,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:52:54,001 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:54,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:54,008 INFO L82 PathProgramCache]: Analyzing trace with hash 30208, now seen corresponding path program 1 times [2018-12-03 15:52:54,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:54,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:54,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:52:54,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:52:54,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:52:54,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:52:54,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:52:54,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:52:54,157 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:52:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:54,235 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 15:52:54,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:52:54,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:52:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:54,268 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:52:54,269 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:52:54,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:52:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:52:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:52:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:52:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-03 15:52:54,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 7 transitions. Word has length 3 [2018-12-03 15:52:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:54,338 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-03 15:52:54,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:52:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 7 transitions. [2018-12-03 15:52:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:52:54,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:54,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:52:54,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:54,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:54,340 INFO L82 PathProgramCache]: Analyzing trace with hash 929704, now seen corresponding path program 1 times [2018-12-03 15:52:54,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:54,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:54,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:54,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:54,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:54,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:54,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:54,432 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:52:54,435 INFO L205 CegarAbsIntRunner]: [0], [6], [13], [14] [2018-12-03 15:52:54,476 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:52:54,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:52:54,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:52:54,614 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:52:54,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:54,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:52:54,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:54,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:54,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:54,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:54,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:54,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:54,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:52:54,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:54,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:52:54,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:52:54,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:52:54,773 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 4 states. [2018-12-03 15:52:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:54,808 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2018-12-03 15:52:54,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:52:54,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:52:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:54,809 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:52:54,809 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:52:54,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:52:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:52:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:52:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:52:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-03 15:52:54,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-03 15:52:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:54,814 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-03 15:52:54,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:52:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-03 15:52:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:52:54,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:54,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:52:54,815 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:54,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:54,815 INFO L82 PathProgramCache]: Analyzing trace with hash 931626, now seen corresponding path program 1 times [2018-12-03 15:52:54,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:54,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:54,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:54,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:54,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:54,880 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:52:54,880 INFO L205 CegarAbsIntRunner]: [0], [8], [13], [14] [2018-12-03 15:52:54,882 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:52:54,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:52:54,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:52:54,920 INFO L272 AbstractInterpreter]: Visited 4 different actions 14 times. Merged at 3 different actions 7 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:52:54,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:54,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:52:54,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:54,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:54,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:54,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:54,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:54,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:55,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:52:55,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:55,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:52:55,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:52:55,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:52:55,022 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-03 15:52:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:55,054 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2018-12-03 15:52:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:52:55,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:52:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:55,055 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:52:55,056 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:52:55,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:52:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:52:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 15:52:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:52:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-03 15:52:55,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-03 15:52:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:55,059 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-03 15:52:55,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:52:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-03 15:52:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:52:55,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:55,060 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:52:55,060 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:55,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash 28814080, now seen corresponding path program 2 times [2018-12-03 15:52:55,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:55,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:55,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:55,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:55,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:55,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:55,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:55,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:55,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:55,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:55,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:52:55,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:55,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:55,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:52:55,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:55,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:52:55,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:52:55,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:52:55,483 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 5 states. [2018-12-03 15:52:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:55,511 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-03 15:52:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:52:55,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:52:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:55,514 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:52:55,514 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:52:55,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:52:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:52:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-03 15:52:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:52:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-12-03 15:52:55,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-12-03 15:52:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:55,519 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2018-12-03 15:52:55,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:52:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2018-12-03 15:52:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:52:55,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:55,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:52:55,520 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:55,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash 28816002, now seen corresponding path program 1 times [2018-12-03 15:52:55,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:55,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:55,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:55,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:55,595 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 15:52:55,596 INFO L205 CegarAbsIntRunner]: [0], [6], [8], [13], [14] [2018-12-03 15:52:55,597 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:52:55,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:52:55,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:52:55,630 INFO L272 AbstractInterpreter]: Visited 5 different actions 15 times. Merged at 3 different actions 4 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:52:55,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:55,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:52:55,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:55,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:55,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:55,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:55,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:52:55,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:55,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:52:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:52:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:52:55,775 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-12-03 15:52:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:55,838 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-03 15:52:55,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:52:55,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:52:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:55,839 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:52:55,839 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:52:55,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:52:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:52:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-03 15:52:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:52:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-12-03 15:52:55,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-12-03 15:52:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:55,844 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2018-12-03 15:52:55,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:52:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2018-12-03 15:52:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:52:55,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:55,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:52:55,845 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:55,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash 28873662, now seen corresponding path program 2 times [2018-12-03 15:52:55,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:55,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:55,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:55,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:55,953 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:55,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:55,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:55,954 INFO L192 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 [2018-12-03 15:52:55,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:55,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:55,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:52:55,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:55,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:55,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:56,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:52:56,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:56,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:52:56,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:52:56,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:52:56,060 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-12-03 15:52:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:56,086 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2018-12-03 15:52:56,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:52:56,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:52:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:56,087 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:52:56,087 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:52:56,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:52:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:52:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-03 15:52:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:52:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-03 15:52:56,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 5 [2018-12-03 15:52:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:56,092 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-03 15:52:56,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:52:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-03 15:52:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:52:56,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:56,093 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:52:56,093 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:56,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash 28875584, now seen corresponding path program 2 times [2018-12-03 15:52:56,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:56,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:56,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:56,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:56,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:56,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:56,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:56,123 INFO L192 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 [2018-12-03 15:52:56,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:56,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:56,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:52:56,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:56,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:56,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:52:56,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:56,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:52:56,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:52:56,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:52:56,216 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 5 states. [2018-12-03 15:52:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:56,244 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 15:52:56,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:52:56,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:52:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:56,246 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:52:56,246 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:52:56,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:52:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:52:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-12-03 15:52:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:52:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-12-03 15:52:56,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-12-03 15:52:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:56,250 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2018-12-03 15:52:56,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:52:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2018-12-03 15:52:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:52:56,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:56,251 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:52:56,252 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:56,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash 893229736, now seen corresponding path program 3 times [2018-12-03 15:52:56,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:56,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:56,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:56,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:56,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:56,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:56,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:56,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:56,402 INFO L192 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 [2018-12-03 15:52:56,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:56,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:56,459 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:56,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:56,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:56,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:52:56,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:56,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:52:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:52:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:56,800 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 6 states. [2018-12-03 15:52:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:56,832 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2018-12-03 15:52:56,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:52:56,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:52:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:56,834 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:52:56,834 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:52:56,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:52:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-03 15:52:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:52:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 15:52:56,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-12-03 15:52:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:56,840 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 15:52:56,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:52:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 15:52:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:52:56,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:56,841 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 15:52:56,841 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:56,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:56,841 INFO L82 PathProgramCache]: Analyzing trace with hash 893231658, now seen corresponding path program 3 times [2018-12-03 15:52:56,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:56,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:56,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:56,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:56,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:56,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:56,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:56,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:56,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:56,912 INFO L192 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 [2018-12-03 15:52:56,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:56,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:56,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:56,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:56,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:57,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:52:57,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:57,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:52:57,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:52:57,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,048 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 6 states. [2018-12-03 15:52:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:57,102 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2018-12-03 15:52:57,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:52:57,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:52:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:57,104 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:52:57,105 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:52:57,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:52:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-03 15:52:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:52:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-03 15:52:57,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 6 [2018-12-03 15:52:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:57,109 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-03 15:52:57,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:52:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-03 15:52:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:52:57,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:57,110 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 15:52:57,110 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:57,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:57,111 INFO L82 PathProgramCache]: Analyzing trace with hash 893289318, now seen corresponding path program 4 times [2018-12-03 15:52:57,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:57,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:57,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:57,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:57,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:57,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:57,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:57,160 INFO L192 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 [2018-12-03 15:52:57,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:57,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:57,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:57,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:52:57,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:57,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:52:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:52:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,262 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 6 states. [2018-12-03 15:52:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:57,299 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2018-12-03 15:52:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:52:57,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:52:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:57,299 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:52:57,300 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:52:57,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:52:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-03 15:52:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:52:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 15:52:57,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-12-03 15:52:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:57,305 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 15:52:57,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:52:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 15:52:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:52:57,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:57,306 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 15:52:57,306 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:57,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash 893291240, now seen corresponding path program 5 times [2018-12-03 15:52:57,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:57,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:57,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:57,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:57,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:57,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:57,349 INFO L192 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 [2018-12-03 15:52:57,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:57,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:57,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:52:57,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:57,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:57,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:52:57,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:57,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:52:57,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:52:57,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,498 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 6 states. [2018-12-03 15:52:57,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:57,550 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2018-12-03 15:52:57,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:52:57,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:52:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:57,551 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:52:57,551 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:52:57,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:52:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-03 15:52:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:52:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-03 15:52:57,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 6 [2018-12-03 15:52:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:57,557 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-03 15:52:57,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:52:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-03 15:52:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:52:57,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:57,558 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 15:52:57,558 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:57,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash 895076778, now seen corresponding path program 6 times [2018-12-03 15:52:57,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:57,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:57,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:57,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:57,634 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:57,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:57,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:57,634 INFO L192 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 [2018-12-03 15:52:57,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:57,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:57,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:57,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:57,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:57,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:52:57,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:57,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:52:57,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:52:57,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,737 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 6 states. [2018-12-03 15:52:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:57,792 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 15:52:57,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:52:57,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:52:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:57,793 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:52:57,793 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:52:57,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:52:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-12-03 15:52:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:52:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 15:52:57,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 6 [2018-12-03 15:52:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:57,799 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 15:52:57,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:52:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 15:52:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:52:57,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:57,800 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 15:52:57,800 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:57,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash 895078700, now seen corresponding path program 7 times [2018-12-03 15:52:57,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:57,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:57,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:57,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:57,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:57,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:57,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:57,873 INFO L192 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 [2018-12-03 15:52:57,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:57,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:57,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:57,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:57,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:52:57,973 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:57,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:52:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:52:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:57,974 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2018-12-03 15:52:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:58,020 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 15:52:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:52:58,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:52:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:58,021 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:52:58,021 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:52:58,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:52:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 15:52:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:52:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 15:52:58,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-12-03 15:52:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:58,026 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 15:52:58,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:52:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 15:52:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:52:58,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:58,027 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 15:52:58,027 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:58,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 895136360, now seen corresponding path program 8 times [2018-12-03 15:52:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:58,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:58,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:58,066 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:58,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:58,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,067 INFO L192 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 [2018-12-03 15:52:58,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:58,078 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:58,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:52:58,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:58,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:58,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:52:58,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:58,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:52:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:52:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:58,376 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 6 states. [2018-12-03 15:52:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:58,436 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-03 15:52:58,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:52:58,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:52:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:58,437 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:52:58,437 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:52:58,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:52:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-12-03 15:52:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:52:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 15:52:58,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 6 [2018-12-03 15:52:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:58,444 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 15:52:58,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:52:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 15:52:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:52:58,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:58,445 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:52:58,445 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:58,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash 895138282, now seen corresponding path program 3 times [2018-12-03 15:52:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:58,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:58,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:58,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:58,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:58,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,491 INFO L192 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 [2018-12-03 15:52:58,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:58,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:58,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:58,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:58,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:58,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:52:58,623 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:58,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:52:58,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:52:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:58,625 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2018-12-03 15:52:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:58,644 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2018-12-03 15:52:58,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:52:58,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:52:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:58,646 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:52:58,646 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:52:58,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:52:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:52:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-12-03 15:52:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:52:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-03 15:52:58,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 6 [2018-12-03 15:52:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:58,651 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-03 15:52:58,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:52:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-03 15:52:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:52:58,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:58,651 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:52:58,652 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:58,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:58,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1920311296, now seen corresponding path program 4 times [2018-12-03 15:52:58,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:58,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:58,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:58,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:58,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:58,712 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:58,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:58,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,712 INFO L192 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 [2018-12-03 15:52:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:58,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:58,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:58,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:52:58,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:58,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:52:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:52:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:52:58,822 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 7 states. [2018-12-03 15:52:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:58,855 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 15:52:58,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:52:58,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:52:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:58,856 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:52:58,856 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:52:58,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:52:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:52:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-12-03 15:52:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:52:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:52:58,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 15:52:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:58,866 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:52:58,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:52:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:52:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:52:58,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:58,867 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 15:52:58,867 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:58,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1920313218, now seen corresponding path program 9 times [2018-12-03 15:52:58,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:58,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:58,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:58,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:58,937 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:58,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:58,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,937 INFO L192 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 [2018-12-03 15:52:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:58,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:58,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:58,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:58,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:59,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:52:59,057 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:59,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:52:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:52:59,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:52:59,058 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 15:52:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:59,102 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 15:52:59,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:52:59,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:52:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:59,104 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:52:59,104 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:52:59,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:52:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:52:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-03 15:52:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:52:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 15:52:59,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-12-03 15:52:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:59,112 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 15:52:59,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:52:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 15:52:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:52:59,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:59,113 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 15:52:59,113 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:59,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1920370878, now seen corresponding path program 10 times [2018-12-03 15:52:59,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:59,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:59,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:59,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:59,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:59,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:59,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:59,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:59,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:59,340 INFO L192 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 [2018-12-03 15:52:59,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:59,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:59,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:59,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:52:59,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:59,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:52:59,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:52:59,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:52:59,492 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 7 states. [2018-12-03 15:52:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:59,612 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 15:52:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:52:59,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:52:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:59,612 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:52:59,612 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:52:59,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:52:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:52:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-03 15:52:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:52:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:52:59,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 15:52:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:59,618 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:52:59,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:52:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:52:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:52:59,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:59,619 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 15:52:59,619 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:59,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:59,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1920372800, now seen corresponding path program 11 times [2018-12-03 15:52:59,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:59,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:59,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:59,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:59,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:59,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:59,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:59,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:59,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:59,663 INFO L192 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 [2018-12-03 15:52:59,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:59,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:59,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:52:59,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:59,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:59,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:52:59,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:59,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:52:59,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:52:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:52:59,777 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 15:52:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:59,881 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-03 15:52:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:52:59,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:52:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:59,882 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:52:59,882 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:52:59,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:52:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:52:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-12-03 15:52:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:52:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 15:52:59,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2018-12-03 15:52:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:59,889 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 15:52:59,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:52:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 15:52:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:52:59,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:59,890 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 15:52:59,890 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:59,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1922158338, now seen corresponding path program 12 times [2018-12-03 15:52:59,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:59,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:59,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:59,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:59,971 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:59,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:59,971 INFO L192 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 [2018-12-03 15:52:59,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:59,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:59,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:59,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:59,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:59,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:00,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:00,078 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:00,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:00,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:00,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:00,079 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 7 states. [2018-12-03 15:53:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:00,198 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 15:53:00,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:00,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:00,201 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:53:00,201 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:53:00,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:53:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-12-03 15:53:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:00,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 15:53:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:00,210 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:00,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:00,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:00,211 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 15:53:00,211 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:00,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1922160260, now seen corresponding path program 13 times [2018-12-03 15:53:00,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:00,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:00,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:00,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:00,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:00,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:00,328 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:00,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:00,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:00,329 INFO L192 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 [2018-12-03 15:53:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:00,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:00,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:00,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:00,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:00,485 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 15:53:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:00,515 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 15:53:00,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:00,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:00,516 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:53:00,516 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:53:00,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:53:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-03 15:53:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:53:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 15:53:00,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-12-03 15:53:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:00,525 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 15:53:00,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 15:53:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:00,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:00,526 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 15:53:00,526 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:00,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1922217920, now seen corresponding path program 14 times [2018-12-03 15:53:00,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:00,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:00,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:00,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:00,577 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:00,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:00,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:00,577 INFO L192 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 [2018-12-03 15:53:00,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:00,586 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:00,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:53:00,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:00,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:00,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:00,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:00,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:00,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:00,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:00,703 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 7 states. [2018-12-03 15:53:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:00,823 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 15:53:00,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:00,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:00,826 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:53:00,827 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:53:00,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:53:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-03 15:53:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:00,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 15:53:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:00,837 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:00,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:00,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:00,837 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 15:53:00,837 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:00,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1922219842, now seen corresponding path program 15 times [2018-12-03 15:53:00,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:00,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:00,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:00,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:00,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:00,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:00,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:00,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:00,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:00,886 INFO L192 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 [2018-12-03 15:53:00,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:00,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:00,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:00,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:00,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:00,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:01,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:01,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:01,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:01,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:01,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:01,044 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 15:53:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:01,115 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-03 15:53:01,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:01,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:01,116 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:53:01,117 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:53:01,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:53:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-12-03 15:53:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:53:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 15:53:01,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2018-12-03 15:53:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:01,125 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 15:53:01,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 15:53:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:01,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:01,125 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 15:53:01,126 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:01,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1977569598, now seen corresponding path program 16 times [2018-12-03 15:53:01,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:01,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:01,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:01,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:01,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:01,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:01,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:01,192 INFO L192 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 [2018-12-03 15:53:01,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:01,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:01,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:01,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:01,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:01,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:01,297 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 7 states. [2018-12-03 15:53:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:01,323 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:01,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:01,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:01,328 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:01,329 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:01,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-03 15:53:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:01,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-12-03 15:53:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:01,342 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:01,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:01,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:01,343 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 15:53:01,343 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:01,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:01,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1977571520, now seen corresponding path program 17 times [2018-12-03 15:53:01,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:01,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:01,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:01,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:01,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:01,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:01,706 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:01,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:01,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:01,706 INFO L192 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 [2018-12-03 15:53:01,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:01,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:01,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:53:01,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:01,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:01,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:01,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:01,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:01,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:01,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:01,858 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 7 states. [2018-12-03 15:53:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:01,945 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:01,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:01,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:01,946 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:01,946 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:01,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-03 15:53:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:01,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 15:53:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:01,957 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:01,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:01,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:01,958 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 15:53:01,958 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:01,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:01,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1977629180, now seen corresponding path program 18 times [2018-12-03 15:53:01,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:01,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:01,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:02,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:02,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:02,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:02,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:02,059 INFO L192 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 [2018-12-03 15:53:02,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:02,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:02,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:02,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:02,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:02,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:02,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:02,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:02,528 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 15:53:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:02,616 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:02,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:02,617 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:02,617 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:02,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-03 15:53:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:02,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-12-03 15:53:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:02,627 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:02,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:02,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:02,628 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 15:53:02,628 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:02,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1977631102, now seen corresponding path program 19 times [2018-12-03 15:53:02,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:02,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:02,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:02,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:02,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:02,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:02,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:02,679 INFO L192 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 [2018-12-03 15:53:02,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:02,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:02,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:02,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:02,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:02,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:02,821 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 7 states. [2018-12-03 15:53:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:02,865 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:02,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:02,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:02,865 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:02,865 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:02,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-12-03 15:53:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:53:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 15:53:02,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-12-03 15:53:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:02,872 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 15:53:02,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 15:53:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:02,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:02,873 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 15:53:02,873 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:02,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1979416640, now seen corresponding path program 20 times [2018-12-03 15:53:02,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:02,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:02,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:02,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:02,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:02,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:02,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:02,910 INFO L192 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 [2018-12-03 15:53:02,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:02,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:02,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:53:02,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:02,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:02,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:02,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:02,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:02,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:02,995 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 7 states. [2018-12-03 15:53:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:03,029 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 15:53:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:03,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:03,029 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:53:03,030 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:53:03,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:53:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 15:53:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:03,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-12-03 15:53:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:03,041 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:03,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:03,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:03,042 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 15:53:03,042 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:03,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1979418562, now seen corresponding path program 21 times [2018-12-03 15:53:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:03,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:03,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:03,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:03,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:03,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:03,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:03,093 INFO L192 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 [2018-12-03 15:53:03,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:03,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:03,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:03,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:03,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:03,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:03,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:03,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:03,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:03,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:03,195 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 7 states. [2018-12-03 15:53:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:03,230 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 15:53:03,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:03,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:03,231 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:53:03,232 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:53:03,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:53:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-12-03 15:53:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:03,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 15:53:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:03,242 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:03,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:03,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:03,243 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 15:53:03,243 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:03,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1979476222, now seen corresponding path program 22 times [2018-12-03 15:53:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:03,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:03,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:03,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:03,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:03,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:03,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:03,279 INFO L192 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 [2018-12-03 15:53:03,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:03,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:03,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:03,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:03,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:03,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:03,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:03,501 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 15:53:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:03,548 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 15:53:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:03,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:03,550 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:53:03,550 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:53:03,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:53:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-12-03 15:53:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:03,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-12-03 15:53:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:03,561 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:03,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:53:03,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:03,562 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:53:03,562 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:03,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1979478144, now seen corresponding path program 4 times [2018-12-03 15:53:03,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:03,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:03,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:03,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:03,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:03,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:03,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:03,640 INFO L192 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 [2018-12-03 15:53:03,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:03,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:03,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:03,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:53:03,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:03,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:53:03,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:53:03,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:03,778 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 7 states. [2018-12-03 15:53:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:03,811 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 15:53:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:53:03,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:53:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:03,812 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:53:03,812 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:53:03,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:53:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:53:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 15:53:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:53:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 15:53:03,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2018-12-03 15:53:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:03,819 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 15:53:03,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:53:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 15:53:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:03,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:03,820 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:53:03,820 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:03,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:03,820 INFO L82 PathProgramCache]: Analyzing trace with hash -599898712, now seen corresponding path program 5 times [2018-12-03 15:53:03,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:03,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:03,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:03,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:03,867 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:03,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:03,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:03,867 INFO L192 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 [2018-12-03 15:53:03,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:03,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:03,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:03,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:03,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:03,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:04,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:04,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:04,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:04,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:04,192 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 8 states. [2018-12-03 15:53:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:04,222 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:04,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:04,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:04,223 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:04,223 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:04,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 15:53:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:04,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:04,243 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:04,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:04,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:04,244 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:04,244 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:04,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:04,245 INFO L82 PathProgramCache]: Analyzing trace with hash -599896790, now seen corresponding path program 23 times [2018-12-03 15:53:04,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:04,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:04,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:04,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:04,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:04,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:04,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:04,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:04,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:04,303 INFO L192 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 [2018-12-03 15:53:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:04,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:04,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:04,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:04,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:04,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:04,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:04,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:04,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:04,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:04,462 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:04,497 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:04,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:04,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:04,501 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:04,501 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:04,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-03 15:53:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:04,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 15:53:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:04,514 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:04,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:04,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:04,515 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:04,515 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:04,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash -599839130, now seen corresponding path program 24 times [2018-12-03 15:53:04,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:04,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:04,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:04,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:04,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:04,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:04,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:04,649 INFO L192 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 [2018-12-03 15:53:04,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:04,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:04,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:04,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:04,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:04,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:04,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:04,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:04,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:04,818 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 15:53:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:04,859 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:04,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:04,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:04,860 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:04,860 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:04,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 15:53:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:04,874 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:04,874 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:04,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:04,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:04,875 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:04,875 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:04,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash -599837208, now seen corresponding path program 25 times [2018-12-03 15:53:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:04,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:04,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:04,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:04,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:04,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:04,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:04,930 INFO L192 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 [2018-12-03 15:53:04,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:04,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:04,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:05,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:05,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:05,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:05,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:05,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:05,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:05,125 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:05,162 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:05,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:05,164 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:05,164 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:05,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-12-03 15:53:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:05,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-12-03 15:53:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:05,176 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:05,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:05,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:05,176 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:05,177 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:05,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -598051670, now seen corresponding path program 26 times [2018-12-03 15:53:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:05,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:05,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:05,254 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:05,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:05,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:05,254 INFO L192 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 [2018-12-03 15:53:05,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:05,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:05,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:05,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:05,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:05,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:05,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:05,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:05,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:05,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:05,375 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 8 states. [2018-12-03 15:53:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:05,408 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:05,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:05,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:05,409 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:05,409 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:05,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-12-03 15:53:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:05,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:05,423 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:05,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:05,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:05,424 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:05,424 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:05,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:05,424 INFO L82 PathProgramCache]: Analyzing trace with hash -598049748, now seen corresponding path program 27 times [2018-12-03 15:53:05,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:05,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:05,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:05,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:05,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:05,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:05,624 INFO L192 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 [2018-12-03 15:53:05,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:05,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:05,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:05,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:05,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:05,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:05,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:05,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:05,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:05,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:05,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:05,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:05,729 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:05,857 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:05,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:05,858 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:05,858 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:05,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 15:53:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:05,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 15:53:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:05,877 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:05,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:05,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:05,883 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:05,883 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:05,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:05,884 INFO L82 PathProgramCache]: Analyzing trace with hash -597992088, now seen corresponding path program 28 times [2018-12-03 15:53:05,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:05,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:05,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:06,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:06,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:06,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:06,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:06,044 INFO L192 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 [2018-12-03 15:53:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:06,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:06,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:06,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:06,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:06,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:06,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:06,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:06,214 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 15:53:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:06,261 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 15:53:06,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:06,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:06,262 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:53:06,262 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:53:06,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:53:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-03 15:53:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:06,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:06,277 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:06,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:06,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:06,278 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:06,278 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:06,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash -597990166, now seen corresponding path program 29 times [2018-12-03 15:53:06,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:06,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:06,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:06,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:06,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:06,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:06,343 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:06,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:06,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:06,344 INFO L192 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 [2018-12-03 15:53:06,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:06,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:06,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:06,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:06,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:06,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:06,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:06,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:06,475 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:06,508 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 15:53:06,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:06,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:06,509 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:53:06,509 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:53:06,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:53:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-03 15:53:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:53:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 15:53:06,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 8 [2018-12-03 15:53:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 15:53:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 15:53:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:06,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:06,522 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:06,522 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:06,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash -542640410, now seen corresponding path program 30 times [2018-12-03 15:53:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:06,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:06,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:06,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:06,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:06,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:06,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:06,595 INFO L192 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 [2018-12-03 15:53:06,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:06,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:06,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:06,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:06,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:06,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:06,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:06,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:06,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:06,741 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 8 states. [2018-12-03 15:53:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:06,800 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:06,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:06,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:06,801 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:06,801 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:06,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 15:53:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:06,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:06,821 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:06,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:06,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:06,822 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:06,822 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:06,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash -542638488, now seen corresponding path program 31 times [2018-12-03 15:53:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:06,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:06,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:06,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:06,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:06,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:06,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:06,895 INFO L192 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 [2018-12-03 15:53:06,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:06,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:06,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:06,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:06,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:06,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:06,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:06,999 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:07,034 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:07,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:07,036 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:07,036 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:07,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-03 15:53:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:07,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 15:53:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:07,051 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:07,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:07,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:07,052 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:07,052 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:07,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:07,052 INFO L82 PathProgramCache]: Analyzing trace with hash -542580828, now seen corresponding path program 32 times [2018-12-03 15:53:07,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:07,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:07,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:07,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:07,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:07,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,100 INFO L192 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 [2018-12-03 15:53:07,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:07,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:07,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:07,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:07,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:07,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:07,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:07,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:07,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:07,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:07,209 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 15:53:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:07,248 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:07,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:07,249 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:07,249 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:07,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 15:53:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:07,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:07,263 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:07,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:07,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:07,264 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:07,264 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:07,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash -542578906, now seen corresponding path program 33 times [2018-12-03 15:53:07,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:07,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:07,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:07,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,339 INFO L192 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 [2018-12-03 15:53:07,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:07,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:07,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:07,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:07,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:07,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:07,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:07,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:07,462 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:07,500 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:07,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:07,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:07,501 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:07,501 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:07,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-12-03 15:53:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:07,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-12-03 15:53:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:07,514 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:07,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:07,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:07,515 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:07,515 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:07,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash -540793368, now seen corresponding path program 34 times [2018-12-03 15:53:07,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:07,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:07,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:07,571 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:07,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:07,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,571 INFO L192 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 [2018-12-03 15:53:07,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:07,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:07,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:07,693 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:07,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:07,694 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 8 states. [2018-12-03 15:53:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:07,865 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:07,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:07,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:07,866 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:07,866 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:07,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-12-03 15:53:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:07,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:07,881 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:07,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:07,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:07,881 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:07,881 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:07,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash -540791446, now seen corresponding path program 35 times [2018-12-03 15:53:07,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:07,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:07,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:07,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:08,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:08,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:08,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:08,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:08,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:08,049 INFO L192 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 [2018-12-03 15:53:08,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:08,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:08,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:08,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:08,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:08,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:08,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:08,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:08,170 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:08,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:08,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:08,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:08,171 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:08,202 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:08,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:08,203 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:08,203 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:08,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 15:53:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:08,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 15:53:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:08,218 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:08,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:08,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:08,219 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:08,219 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:08,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash -540733786, now seen corresponding path program 36 times [2018-12-03 15:53:08,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:08,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:08,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:08,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:08,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:08,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:08,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:08,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:08,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:08,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:08,858 INFO L192 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 [2018-12-03 15:53:08,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:08,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:08,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:08,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:08,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:08,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:09,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:09,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:09,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:09,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:09,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:09,035 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 15:53:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:09,072 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 15:53:09,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:09,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:09,072 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:53:09,072 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:53:09,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:53:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-03 15:53:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:09,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:09,092 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:09,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:09,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:09,093 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:09,093 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:09,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash -540731864, now seen corresponding path program 37 times [2018-12-03 15:53:09,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:09,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:09,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:09,133 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:09,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:09,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,134 INFO L192 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 [2018-12-03 15:53:09,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:09,143 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:09,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:09,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:09,256 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:09,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:09,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:09,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:09,257 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:09,287 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 15:53:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:09,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:09,288 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:53:09,288 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:53:09,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:53:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-03 15:53:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:53:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 15:53:09,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 8 [2018-12-03 15:53:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:09,300 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 15:53:09,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 15:53:09,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:09,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:09,300 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:09,300 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:09,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1175108650, now seen corresponding path program 38 times [2018-12-03 15:53:09,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:09,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:09,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:09,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,344 INFO L192 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 [2018-12-03 15:53:09,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:09,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:09,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:09,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:09,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:09,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:09,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:09,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:09,530 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 8 states. [2018-12-03 15:53:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:09,578 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:09,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:09,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:09,579 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:09,579 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:09,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-12-03 15:53:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:09,598 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 15:53:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:09,598 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:09,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:09,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:09,599 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:09,599 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:09,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1175110572, now seen corresponding path program 39 times [2018-12-03 15:53:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:09,656 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:09,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:09,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,656 INFO L192 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 [2018-12-03 15:53:09,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:09,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:09,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:09,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:09,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:09,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:09,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:09,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:09,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:09,787 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 15:53:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:09,842 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:09,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:09,843 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:09,843 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:09,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-12-03 15:53:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:09,869 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:09,869 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:09,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:09,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:09,870 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:09,870 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:09,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1175168232, now seen corresponding path program 40 times [2018-12-03 15:53:09,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:09,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:09,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:09,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:09,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:09,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:09,959 INFO L192 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 [2018-12-03 15:53:09,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:09,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:09,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:10,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:10,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:10,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:10,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:10,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:10,047 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:10,154 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:10,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:10,155 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:10,155 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:10,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-03 15:53:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:10,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 15:53:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:10,175 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:10,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:10,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:10,176 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:10,176 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:10,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1175170154, now seen corresponding path program 41 times [2018-12-03 15:53:10,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:10,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:10,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:10,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:10,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:10,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:10,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:10,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:10,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:10,223 INFO L192 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 [2018-12-03 15:53:10,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:10,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:10,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:10,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:10,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:10,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:10,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:10,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:10,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:10,367 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 15:53:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:10,408 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:10,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:10,409 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:10,409 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:10,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-12-03 15:53:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:10,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 15:53:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:10,425 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:10,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:10,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:10,426 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:10,426 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:10,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1176955692, now seen corresponding path program 42 times [2018-12-03 15:53:10,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:10,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:10,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:10,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:10,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:10,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:10,473 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:10,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:10,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:10,474 INFO L192 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 [2018-12-03 15:53:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:10,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:10,487 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:10,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:10,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:10,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:10,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:10,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:10,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:10,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:10,577 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 15:53:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:10,639 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:10,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:10,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:10,640 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:10,640 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:10,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-12-03 15:53:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:10,668 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 15:53:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:10,668 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:10,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:10,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:10,668 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:10,669 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:10,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:10,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1176957614, now seen corresponding path program 43 times [2018-12-03 15:53:10,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:10,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:10,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:10,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:10,724 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:10,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:10,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:10,725 INFO L192 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 [2018-12-03 15:53:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:10,735 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:10,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:10,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:10,902 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:10,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:10,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:10,903 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 15:53:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:10,960 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:10,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:10,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:10,961 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:10,961 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:10,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-12-03 15:53:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:10,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:10,980 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:10,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:10,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:10,981 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:10,981 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:10,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1177015274, now seen corresponding path program 44 times [2018-12-03 15:53:10,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:10,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:10,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:11,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:11,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:11,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,033 INFO L192 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 [2018-12-03 15:53:11,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:11,043 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:11,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:11,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:11,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:11,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:11,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:11,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:11,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:11,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:11,154 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:11,210 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:11,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:11,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:11,210 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:11,210 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:11,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-03 15:53:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:11,231 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 15:53:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:11,231 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:11,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:11,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:11,231 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:11,232 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:11,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1177017196, now seen corresponding path program 45 times [2018-12-03 15:53:11,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:11,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:11,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:11,287 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:11,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:11,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,287 INFO L192 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 [2018-12-03 15:53:11,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:11,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:11,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:11,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:11,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:11,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:11,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:11,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:11,385 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 15:53:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:11,441 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:11,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:11,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:11,442 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:11,442 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:11,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 11. [2018-12-03 15:53:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:11,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-12-03 15:53:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:11,458 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:11,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:11,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:11,458 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:11,458 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:11,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1232366952, now seen corresponding path program 46 times [2018-12-03 15:53:11,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:11,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:11,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:11,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:11,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:11,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:11,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,526 INFO L192 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 [2018-12-03 15:53:11,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:11,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:11,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:11,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:11,632 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:11,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:11,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:11,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:11,633 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 8 states. [2018-12-03 15:53:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:11,686 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:11,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:11,687 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:11,687 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:11,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 15:53:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:11,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 15:53:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:11,712 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:11,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:11,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:11,713 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:11,713 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:11,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1232368874, now seen corresponding path program 47 times [2018-12-03 15:53:11,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:11,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:11,779 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:11,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:11,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,779 INFO L192 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 [2018-12-03 15:53:11,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:11,789 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:11,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:11,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:11,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:11,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:11,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:11,871 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 15:53:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:11,949 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:11,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:11,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:11,950 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:11,950 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:11,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:11,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 15:53:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:11,978 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:11,978 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:11,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:11,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:11,979 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:11,979 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:11,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1232426534, now seen corresponding path program 48 times [2018-12-03 15:53:11,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:11,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:11,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:12,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:12,055 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:12,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:12,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:12,055 INFO L192 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 [2018-12-03 15:53:12,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:12,063 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:12,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:12,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:12,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:12,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:12,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:12,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:12,163 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:12,224 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:12,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:12,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:12,225 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:12,225 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:12,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 15:53:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:12,252 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 15:53:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:12,253 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:12,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:12,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:12,253 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:12,253 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:12,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1232428456, now seen corresponding path program 49 times [2018-12-03 15:53:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:12,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:12,301 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:12,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:12,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:12,301 INFO L192 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 [2018-12-03 15:53:12,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:12,318 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:12,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:12,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:12,414 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:12,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:12,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:12,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:12,415 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 15:53:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:12,466 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:12,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:12,467 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:12,467 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:12,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-12-03 15:53:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:12,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 15:53:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:12,488 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:12,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:12,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:12,489 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 15:53:12,489 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:12,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1234213994, now seen corresponding path program 50 times [2018-12-03 15:53:12,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:12,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:12,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:12,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:12,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:12,531 INFO L192 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 [2018-12-03 15:53:12,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:12,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:12,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:12,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:12,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:12,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:12,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:12,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:12,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:12,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:12,646 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 15:53:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:12,695 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:12,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:12,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:12,696 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:12,697 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:12,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-12-03 15:53:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:12,722 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 15:53:12,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:12,722 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:12,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:12,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:12,723 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:12,723 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:12,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1234215916, now seen corresponding path program 51 times [2018-12-03 15:53:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:12,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:12,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:12,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:12,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:12,773 INFO L192 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 [2018-12-03 15:53:12,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:12,782 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:12,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:12,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:12,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:12,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:12,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:12,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:12,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:12,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:12,883 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 15:53:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:12,930 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:12,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:12,931 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:12,931 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:12,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-03 15:53:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:12,954 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 15:53:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:12,955 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:12,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:12,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:12,955 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 15:53:12,955 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:12,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1234273576, now seen corresponding path program 52 times [2018-12-03 15:53:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:12,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:12,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:13,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:13,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:13,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:13,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:13,001 INFO L192 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 [2018-12-03 15:53:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:13,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:13,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:13,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:13,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:13,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:13,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:13,110 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 15:53:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:13,150 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:13,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:13,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:13,151 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:13,151 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:13,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-03 15:53:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:13,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 15:53:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:13,175 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:13,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:53:13,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:13,176 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:53:13,176 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:13,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1234275498, now seen corresponding path program 5 times [2018-12-03 15:53:13,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:13,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:13,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:13,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:13,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:13,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:13,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:13,237 INFO L192 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 [2018-12-03 15:53:13,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:13,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:13,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:13,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:13,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:13,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:53:13,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:13,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:53:13,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:53:13,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:13,351 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 15:53:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:13,389 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 15:53:13,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:53:13,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:53:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:13,390 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:53:13,390 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:53:13,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:53:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:53:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2018-12-03 15:53:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:53:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 15:53:13,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 8 [2018-12-03 15:53:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:13,407 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 15:53:13,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:53:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 15:53:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:13,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:13,408 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:53:13,408 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:13,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1416997632, now seen corresponding path program 6 times [2018-12-03 15:53:13,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:13,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:13,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:13,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:13,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:13,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:13,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:13,484 INFO L192 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 [2018-12-03 15:53:13,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:13,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:13,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:13,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:13,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:13,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:13,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:13,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:13,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:13,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:13,594 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 9 states. [2018-12-03 15:53:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:13,704 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:13,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:13,705 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:13,705 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:13,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 15:53:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:13,751 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:13,751 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:13,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:13,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:13,752 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:13,752 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:13,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1416995710, now seen corresponding path program 53 times [2018-12-03 15:53:13,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:13,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:14,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:14,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:14,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:14,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:14,530 INFO L192 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 [2018-12-03 15:53:14,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:14,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:14,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:14,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:14,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:14,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:14,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:14,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:14,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:14,648 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:14,739 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:14,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:14,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:14,740 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:14,740 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:14,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 15:53:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:14,771 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:14,771 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:14,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:14,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:14,772 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:14,772 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:14,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:14,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1416938050, now seen corresponding path program 54 times [2018-12-03 15:53:14,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:14,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:14,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:14,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:14,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:14,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:14,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:14,827 INFO L192 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 [2018-12-03 15:53:14,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:14,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:14,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:14,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:14,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:14,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:14,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:14,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:14,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:14,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:14,945 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:15,023 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:15,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:15,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:15,024 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:15,024 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:15,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 15:53:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:15,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:15,056 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:15,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:15,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:15,056 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:15,057 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:15,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1416936128, now seen corresponding path program 55 times [2018-12-03 15:53:15,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:15,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:15,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:15,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:15,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:15,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:15,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,108 INFO L192 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 [2018-12-03 15:53:15,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:15,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:15,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:15,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:15,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:15,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:15,221 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:15,297 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:15,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:15,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:15,298 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:15,298 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:15,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-03 15:53:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:15,326 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 15:53:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:15,326 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:15,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:15,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:15,326 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:15,326 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:15,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:15,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1415150590, now seen corresponding path program 56 times [2018-12-03 15:53:15,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:15,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:15,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:15,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:15,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:15,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:15,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:15,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,425 INFO L192 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 [2018-12-03 15:53:15,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:15,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:15,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:15,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:15,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:15,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:15,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:15,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:15,613 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 15:53:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:15,702 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:15,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:15,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:15,703 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:15,703 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:15,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 15:53:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:15,735 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:15,735 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:15,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:15,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:15,735 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:15,735 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:15,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:15,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1415148668, now seen corresponding path program 57 times [2018-12-03 15:53:15,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:15,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:15,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:15,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:15,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:15,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:15,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,802 INFO L192 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 [2018-12-03 15:53:15,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:15,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:15,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:15,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:15,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:15,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:15,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:15,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:15,906 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:15,995 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:15,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:15,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:15,996 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:15,997 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:15,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:15,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 15:53:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:16,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:16,030 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:16,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:16,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:16,030 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:16,030 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:16,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1415091008, now seen corresponding path program 58 times [2018-12-03 15:53:16,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:16,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:16,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:16,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:16,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:16,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:16,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:16,150 INFO L192 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 [2018-12-03 15:53:16,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:16,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:16,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:16,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:16,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:16,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:16,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:16,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:16,248 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:16,334 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:16,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:16,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:16,335 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:16,335 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:16,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 15:53:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:16,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:16,373 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:16,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:16,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:16,373 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:16,373 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:16,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:16,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1415089086, now seen corresponding path program 59 times [2018-12-03 15:53:16,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:16,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:16,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:16,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:16,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:16,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:16,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:16,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:16,427 INFO L192 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 [2018-12-03 15:53:16,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:16,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:16,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:16,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:16,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:16,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:16,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:16,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:16,539 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:16,610 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:16,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:16,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:16,611 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:16,611 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:16,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-12-03 15:53:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:16,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 9 [2018-12-03 15:53:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:16,639 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:16,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:16,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:16,640 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:16,640 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:16,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1359739330, now seen corresponding path program 60 times [2018-12-03 15:53:16,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:16,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:16,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:16,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:16,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:16,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:16,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:16,696 INFO L192 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 [2018-12-03 15:53:16,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:16,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:16,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:16,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:16,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:17,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:17,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:17,433 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:17,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:17,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:17,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:17,434 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 9 states. [2018-12-03 15:53:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:17,721 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:17,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:17,722 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:17,722 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:17,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 15:53:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:17,759 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:17,759 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:17,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:17,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:17,759 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:17,760 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:17,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1359737408, now seen corresponding path program 61 times [2018-12-03 15:53:17,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:17,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:17,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:18,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:18,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:18,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:18,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:18,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:18,381 INFO L192 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 [2018-12-03 15:53:18,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:18,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:18,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:18,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:18,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:18,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:18,475 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:18,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:18,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:18,476 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:18,574 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:18,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:18,575 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:18,575 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:18,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 15:53:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:18,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:18,611 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:18,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:18,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:18,612 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:18,612 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:18,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1359679748, now seen corresponding path program 62 times [2018-12-03 15:53:18,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:18,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:18,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:18,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:18,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:18,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:18,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:18,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:18,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:18,682 INFO L192 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 [2018-12-03 15:53:18,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:18,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:18,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:18,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:18,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:18,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:18,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:18,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:18,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:18,864 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:18,963 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:18,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:18,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:18,964 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:18,964 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:18,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 15:53:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:19,001 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:19,001 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:19,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:19,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:19,002 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:19,002 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:19,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:19,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1359677826, now seen corresponding path program 63 times [2018-12-03 15:53:19,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:19,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:19,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:19,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,048 INFO L192 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 [2018-12-03 15:53:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:19,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:19,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:19,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:19,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:19,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:19,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:19,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:19,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:19,188 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:19,264 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:19,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:19,265 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:19,265 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:19,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-12-03 15:53:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:19,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 15:53:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:19,295 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:19,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:19,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:19,296 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:19,296 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:19,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1357892288, now seen corresponding path program 64 times [2018-12-03 15:53:19,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:19,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:19,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:19,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:19,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:19,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,342 INFO L192 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 [2018-12-03 15:53:19,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:19,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:19,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:19,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:19,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:19,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:19,471 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 15:53:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:19,545 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:19,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:19,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:19,546 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:19,546 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:19,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-12-03 15:53:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:19,583 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:19,583 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:19,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:19,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:19,583 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:19,584 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:19,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:19,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1357890366, now seen corresponding path program 65 times [2018-12-03 15:53:19,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:19,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:19,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:19,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:19,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,631 INFO L192 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 [2018-12-03 15:53:19,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:19,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:19,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:19,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:19,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:19,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:19,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:19,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:19,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:19,760 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:19,835 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:19,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:19,836 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:19,836 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:19,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-12-03 15:53:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:19,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:19,872 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:19,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:19,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:19,872 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:19,873 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:19,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1357832706, now seen corresponding path program 66 times [2018-12-03 15:53:19,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:19,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:19,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:19,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:19,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:19,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:19,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,918 INFO L192 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 [2018-12-03 15:53:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:19,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:19,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:19,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:19,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:20,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:20,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:20,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:20,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:20,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:20,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:20,036 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:20,107 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:20,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:20,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:20,108 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:20,108 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:20,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-12-03 15:53:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:20,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:20,143 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:20,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:20,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:20,144 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:20,144 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:20,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1357830784, now seen corresponding path program 67 times [2018-12-03 15:53:20,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:20,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:20,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:20,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:20,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:20,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:20,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:20,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:20,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:20,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:20,200 INFO L192 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 [2018-12-03 15:53:20,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:20,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:20,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:20,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:20,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:20,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:20,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:20,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:20,320 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:20,391 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:20,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:20,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:20,391 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:20,392 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:20,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-03 15:53:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:20,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 9 [2018-12-03 15:53:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:20,417 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:20,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:20,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:20,417 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:20,417 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:20,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash 358009730, now seen corresponding path program 68 times [2018-12-03 15:53:20,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:20,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:20,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:20,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:20,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:20,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:20,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:20,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:20,717 INFO L192 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 [2018-12-03 15:53:20,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:20,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:20,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:20,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:20,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:20,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:21,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:21,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:21,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:21,330 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 9 states. [2018-12-03 15:53:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:21,425 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:21,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:21,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:21,426 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:21,426 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:21,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 15:53:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:21,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:21,467 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:21,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:21,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:21,468 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:21,468 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:21,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash 358011652, now seen corresponding path program 69 times [2018-12-03 15:53:21,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:21,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:21,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:21,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:21,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:21,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:21,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:21,522 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:21,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:21,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:21,522 INFO L192 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 [2018-12-03 15:53:21,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:21,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:21,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:21,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:21,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:21,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:21,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:21,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:21,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:21,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:21,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:21,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:21,638 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:21,742 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:21,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:21,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:21,743 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:21,743 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:21,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 15:53:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:21,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:21,786 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:21,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:21,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:21,786 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:21,786 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:21,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash 358069312, now seen corresponding path program 70 times [2018-12-03 15:53:21,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:21,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:21,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:21,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:21,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:21,869 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:21,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:21,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:21,869 INFO L192 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 [2018-12-03 15:53:21,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:21,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:21,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:21,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:21,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:21,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:21,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:21,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:21,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:21,974 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:22,078 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:22,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:22,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:22,079 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:22,079 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:22,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 15:53:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:22,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:22,124 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:22,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:22,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:22,125 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:22,125 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:22,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash 358071234, now seen corresponding path program 71 times [2018-12-03 15:53:22,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:22,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:22,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:22,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:22,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:22,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:22,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:22,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:22,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:22,179 INFO L192 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 [2018-12-03 15:53:22,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:22,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:22,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:22,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:22,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:22,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:22,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:22,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:22,302 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:22,397 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:22,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:22,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:22,398 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:22,398 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:22,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-03 15:53:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:22,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 15:53:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:22,436 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:22,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:22,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:22,436 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:22,437 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:22,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash 359856772, now seen corresponding path program 72 times [2018-12-03 15:53:22,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:22,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:22,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:22,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:22,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:22,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:22,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:22,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:22,493 INFO L192 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 [2018-12-03 15:53:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:22,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:22,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:22,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:22,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:22,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:22,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:22,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:22,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:22,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:22,610 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 15:53:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:22,720 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:22,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:22,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:22,721 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:22,721 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:22,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 15:53:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:22,767 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:22,767 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:22,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:22,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:22,768 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:22,768 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:22,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash 359858694, now seen corresponding path program 73 times [2018-12-03 15:53:22,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:22,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:22,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:22,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:22,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:22,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:22,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:22,818 INFO L192 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 [2018-12-03 15:53:22,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:22,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:22,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:22,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:22,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:22,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:22,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:22,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:22,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:22,953 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:23,060 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:23,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:23,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:23,061 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:23,061 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:23,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 15:53:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:23,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:23,109 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:23,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:23,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:23,109 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:23,110 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:23,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 359916354, now seen corresponding path program 74 times [2018-12-03 15:53:23,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:23,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:23,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:23,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:23,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:23,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:23,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:23,176 INFO L192 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 [2018-12-03 15:53:23,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:23,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:23,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:23,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:23,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:23,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:23,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:23,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:23,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:23,333 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:23,451 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:23,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:23,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:23,452 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:23,452 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:23,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 15:53:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:23,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:23,499 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:23,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:23,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:23,500 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:23,500 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:23,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 359918276, now seen corresponding path program 75 times [2018-12-03 15:53:23,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:23,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:23,558 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:23,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:23,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:23,559 INFO L192 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 [2018-12-03 15:53:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:23,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:23,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:23,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:23,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:23,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:23,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:23,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:23,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:23,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:23,706 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:23,822 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:23,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:23,822 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:23,823 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:23,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-12-03 15:53:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:23,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 9 [2018-12-03 15:53:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:23,862 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:23,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:23,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:23,863 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:23,863 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:23,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash 415268032, now seen corresponding path program 76 times [2018-12-03 15:53:23,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:23,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:23,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:23,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:23,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:23,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:23,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:23,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:24,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:24,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:24,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:24,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:24,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:24,245 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 9 states. [2018-12-03 15:53:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:24,354 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:24,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:24,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:24,355 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:24,355 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:24,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 15:53:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:24,408 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:24,408 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:24,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:24,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:24,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:24,409 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:24,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash 415269954, now seen corresponding path program 77 times [2018-12-03 15:53:24,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:24,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:24,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:24,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:24,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:24,470 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:24,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:24,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:24,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:24,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:24,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:24,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:24,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:24,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:24,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:24,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:24,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:24,607 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:24,707 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:24,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:24,709 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:24,709 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:24,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 15:53:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:24,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:24,754 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:24,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:24,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:24,754 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:24,754 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:24,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash 415327614, now seen corresponding path program 78 times [2018-12-03 15:53:24,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:24,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:24,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:24,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:24,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:24,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:24,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:24,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:24,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:24,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:24,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:24,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:24,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:24,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:24,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:24,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:24,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:24,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:24,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:24,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:24,920 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:25,038 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:25,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:25,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:25,038 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:25,038 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:25,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 15:53:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:25,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:25,084 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:25,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:25,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:25,084 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:25,084 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:25,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash 415329536, now seen corresponding path program 79 times [2018-12-03 15:53:25,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:25,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:25,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:25,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:25,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:25,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:25,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:25,381 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:25,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:25,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:25,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:25,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:25,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:25,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:25,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:25,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:25,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:25,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:25,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:25,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:25,491 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:25,584 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:25,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:25,585 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:25,585 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:25,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-12-03 15:53:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:25,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 15:53:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:25,629 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:25,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:25,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:25,629 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:25,629 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:25,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash 417115074, now seen corresponding path program 80 times [2018-12-03 15:53:25,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:25,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:25,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:25,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:25,683 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:25,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:25,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:25,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:25,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:25,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:25,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:25,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:25,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:25,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:25,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:25,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:25,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:25,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:25,820 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 15:53:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:25,912 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:25,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:25,913 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:25,913 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:25,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-12-03 15:53:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:25,957 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:25,957 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:25,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:25,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:25,958 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:25,958 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:25,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash 417116996, now seen corresponding path program 81 times [2018-12-03 15:53:25,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:25,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:25,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:25,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:25,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:26,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:26,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:26,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:26,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:26,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:26,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:26,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:26,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:26,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:26,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:26,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:26,125 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:26,216 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:26,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:26,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:26,216 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:26,217 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:26,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-12-03 15:53:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:26,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:26,258 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:26,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:26,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:26,259 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:26,259 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:26,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:26,260 INFO L82 PathProgramCache]: Analyzing trace with hash 417174656, now seen corresponding path program 82 times [2018-12-03 15:53:26,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:26,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:26,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:26,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:26,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:26,322 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:26,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:26,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:26,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:26,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:26,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:26,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:26,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:26,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:26,464 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:26,547 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:26,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:26,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:26,548 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:26,548 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:26,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-12-03 15:53:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:26,593 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:26,594 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:26,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:26,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:26,594 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:26,594 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:26,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash 417176578, now seen corresponding path program 83 times [2018-12-03 15:53:26,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:26,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:26,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:26,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:26,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:26,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:26,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:26,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:26,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:26,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:26,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:26,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:26,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:26,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:26,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:26,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:26,792 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:26,875 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 15:53:26,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:26,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:26,876 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:53:26,876 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:53:26,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:53:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-03 15:53:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:26,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 9 [2018-12-03 15:53:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:26,908 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:26,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:26,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:26,909 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:26,909 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:26,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2068623038, now seen corresponding path program 84 times [2018-12-03 15:53:26,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:26,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:26,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:26,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:26,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:26,989 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:26,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:26,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:26,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:27,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:27,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:27,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:27,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:27,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:27,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:27,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:27,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:27,106 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 9 states. [2018-12-03 15:53:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:27,262 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:53:27,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:27,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:27,263 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:53:27,263 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:53:27,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:53:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 15:53:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:27,321 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:27,321 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:27,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:27,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:27,322 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:27,322 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:27,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2068624960, now seen corresponding path program 85 times [2018-12-03 15:53:27,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:27,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:27,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:27,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:27,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:27,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:27,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:27,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:27,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:27,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:27,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:27,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:27,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:27,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:27,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:27,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:27,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:27,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:27,508 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:27,654 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:53:27,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:27,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:27,655 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:53:27,655 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:53:27,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:53:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-12-03 15:53:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:27,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:27,710 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:27,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:27,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:27,711 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:27,711 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:27,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2068682620, now seen corresponding path program 86 times [2018-12-03 15:53:27,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:27,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:27,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:27,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:27,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:27,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:27,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:27,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:27,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:27,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:27,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:27,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:27,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:27,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:27,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:27,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:27,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:27,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:27,907 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:28,069 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:53:28,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:28,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:28,070 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:53:28,070 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:53:28,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:53:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 15:53:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:28,126 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:28,127 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:28,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:28,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:28,127 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:28,127 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:28,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2068684542, now seen corresponding path program 87 times [2018-12-03 15:53:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:28,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:28,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:28,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:28,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:28,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:28,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:28,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:28,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:28,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:28,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:28,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:28,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:28,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:28,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:28,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:28,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:28,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:28,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:28,298 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:28,447 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:53:28,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:28,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:28,448 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:53:28,448 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:53:28,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:28,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:53:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 14. [2018-12-03 15:53:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:28,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:28,499 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:28,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:28,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:28,499 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:28,499 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:28,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2070470080, now seen corresponding path program 88 times [2018-12-03 15:53:28,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:28,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:28,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:28,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:28,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:28,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:28,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:28,641 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:28,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:28,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:28,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:28,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:28,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:28,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:28,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:28,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:28,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:28,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:28,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:28,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:28,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:28,737 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:28,904 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:28,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:28,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:28,905 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:28,905 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:28,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 15:53:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:28,969 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:28,969 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:28,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:28,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:28,969 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:28,969 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:28,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:28,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2070472002, now seen corresponding path program 89 times [2018-12-03 15:53:28,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:28,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:28,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:29,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:29,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:29,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:29,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:29,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:29,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:29,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:29,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:29,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:29,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:29,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:29,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:29,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:29,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:29,233 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:29,372 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:29,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:29,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:29,373 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:29,373 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:29,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-12-03 15:53:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:29,432 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:29,432 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:29,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:29,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:29,433 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:29,433 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:29,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2070529662, now seen corresponding path program 90 times [2018-12-03 15:53:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:29,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:29,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:29,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:29,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:29,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:29,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:29,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:29,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:29,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:29,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:29,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:29,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:29,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:29,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:29,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:29,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:29,669 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:29,810 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:29,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:29,811 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:29,811 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:29,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 15:53:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:29,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:29,881 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:29,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:29,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:29,881 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:29,882 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:29,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:29,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2070531584, now seen corresponding path program 91 times [2018-12-03 15:53:29,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:29,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:29,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:29,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:29,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:29,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:29,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:29,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:29,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:29,944 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:29,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:29,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:29,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:29,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:30,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:30,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:30,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:30,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:30,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:30,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:30,099 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:30,246 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:30,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:30,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:30,247 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:30,247 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:30,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2018-12-03 15:53:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:30,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 15:53:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:30,302 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:30,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:30,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:30,303 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:30,303 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:30,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2125881340, now seen corresponding path program 92 times [2018-12-03 15:53:30,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:30,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:30,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:30,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:30,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:30,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:30,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:30,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:30,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:30,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:30,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:30,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:30,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:30,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:30,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:30,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:30,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:30,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:30,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:30,499 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 15:53:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:30,662 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:53:30,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:30,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:30,663 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:53:30,663 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:53:30,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:53:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 15:53:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:30,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:30,729 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:30,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:30,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:30,729 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:30,730 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:30,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2125883262, now seen corresponding path program 93 times [2018-12-03 15:53:30,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:30,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:30,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:30,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:30,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:30,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:30,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:30,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:30,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:30,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:30,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:30,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:30,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:30,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:30,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:30,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:30,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:30,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:30,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:30,909 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:31,071 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:53:31,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:31,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:31,072 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:53:31,072 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:53:31,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:53:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-12-03 15:53:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:31,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:31,130 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:31,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:31,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:31,131 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:31,131 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:31,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:31,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2125940922, now seen corresponding path program 94 times [2018-12-03 15:53:31,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:31,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:31,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:31,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:31,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:31,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:31,194 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:31,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:31,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:31,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:31,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:31,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:31,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:31,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:31,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:31,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:31,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:31,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:31,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:31,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:31,333 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:31,492 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:53:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:31,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:31,492 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:53:31,493 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:53:31,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:53:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 15:53:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:31,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:31,551 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:31,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:31,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:31,552 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:31,552 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:31,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2125942844, now seen corresponding path program 95 times [2018-12-03 15:53:31,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:31,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:31,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:31,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:31,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:31,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:31,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:31,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:31,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:31,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:31,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:31,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:31,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:31,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:31,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:31,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:31,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:31,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:31,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:31,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:31,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:31,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:31,819 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:31,978 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:53:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:31,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:31,978 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:53:31,979 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:53:31,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:53:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 14. [2018-12-03 15:53:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:32,034 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:32,034 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:32,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:32,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:32,034 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:32,034 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:32,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:32,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2127728382, now seen corresponding path program 96 times [2018-12-03 15:53:32,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:32,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:32,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:32,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:32,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:32,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:32,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:32,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:32,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:32,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:32,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:32,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:32,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:32,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:32,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:32,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:32,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:32,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:32,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:32,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:32,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:32,198 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:32,350 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:32,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:32,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:32,351 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:32,351 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:32,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 15:53:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:32,415 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:32,415 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:32,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:32,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:32,416 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:32,416 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:32,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:32,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2127730304, now seen corresponding path program 97 times [2018-12-03 15:53:32,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:32,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:32,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:32,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:32,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:32,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:32,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:32,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:32,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:32,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:32,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:32,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:32,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:32,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:32,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:32,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:32,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:32,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:32,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:32,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:32,682 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:32,832 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:32,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:32,833 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:32,833 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:32,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-12-03 15:53:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:32,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:32,898 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:32,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:32,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:32,898 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:32,898 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:32,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2127787964, now seen corresponding path program 98 times [2018-12-03 15:53:32,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:32,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:32,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:32,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:32,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:32,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:32,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:32,952 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:32,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:32,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:32,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:32,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:32,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:32,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:32,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:32,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:32,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:33,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:33,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:33,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:33,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:33,086 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:33,221 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:33,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:33,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:33,222 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:33,222 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:33,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 15:53:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:33,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:33,290 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:33,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:33,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:33,291 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:33,291 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:33,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2127789886, now seen corresponding path program 99 times [2018-12-03 15:53:33,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:33,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:33,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:33,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:33,508 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:33,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:33,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:33,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:33,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:33,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:33,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:33,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:33,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:33,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:33,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:33,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:33,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:33,605 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:33,741 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:33,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:33,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:33,742 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:33,742 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:33,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 12. [2018-12-03 15:53:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:53:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:53:33,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 9 [2018-12-03 15:53:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:33,789 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:53:33,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:53:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:33,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:33,789 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:33,789 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:33,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash -451336896, now seen corresponding path program 100 times [2018-12-03 15:53:33,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:33,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:33,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:33,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:33,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:33,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:33,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:33,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:33,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:33,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:33,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:33,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:33,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:33,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:33,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:33,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:33,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:33,994 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 9 states. [2018-12-03 15:53:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:34,140 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:34,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:34,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:34,140 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:34,141 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:34,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 15:53:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:34,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:34,214 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:34,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:34,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:34,215 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:34,215 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:34,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash -451334974, now seen corresponding path program 101 times [2018-12-03 15:53:34,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:34,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:34,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:34,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:34,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:34,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:34,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:34,313 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:34,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:34,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:34,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:34,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:34,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:34,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:34,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:34,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:34,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:34,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:34,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:34,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:34,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:34,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:34,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:34,481 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:34,636 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:34,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:34,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:34,637 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:34,637 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:34,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-12-03 15:53:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:34,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:34,709 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:34,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:34,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:34,709 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:34,709 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:34,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash -451277314, now seen corresponding path program 102 times [2018-12-03 15:53:34,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:34,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:34,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:34,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:34,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:34,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:34,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:34,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:34,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:34,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:34,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:34,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:34,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:34,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:34,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:34,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:34,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:34,876 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:35,044 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:35,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:35,044 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:35,044 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:35,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-12-03 15:53:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:35,118 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:35,118 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:35,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:35,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:35,119 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:35,119 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:35,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash -451275392, now seen corresponding path program 103 times [2018-12-03 15:53:35,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:35,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:35,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:35,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:35,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:35,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:35,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:35,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:35,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:35,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:35,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:35,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:35,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:35,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:35,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:35,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:35,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:35,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:35,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:35,322 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:35,486 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:35,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:35,487 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:35,487 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:35,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-12-03 15:53:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:35,560 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:35,560 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:35,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:35,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:35,561 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:35,561 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:35,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash -449489854, now seen corresponding path program 104 times [2018-12-03 15:53:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:35,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:35,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:35,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:35,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:35,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:35,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:35,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:35,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:35,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:35,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:35,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:35,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:35,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:35,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:35,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:35,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:35,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:35,776 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:35,949 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:35,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:35,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:35,950 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:35,950 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:35,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 15:53:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:36,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:36,036 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:36,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:36,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:36,036 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:36,037 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:36,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash -449487932, now seen corresponding path program 105 times [2018-12-03 15:53:36,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:36,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:36,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:36,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:36,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:36,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:36,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:36,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:36,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:36,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:36,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:36,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:36,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:36,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:36,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:36,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:36,232 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:36,412 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:36,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:36,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:36,413 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:36,413 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:36,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-12-03 15:53:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:36,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:36,495 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:36,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:36,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:36,496 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:36,496 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:36,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -449430272, now seen corresponding path program 106 times [2018-12-03 15:53:36,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:36,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:36,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:36,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:36,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:36,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:36,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:36,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:36,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:36,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:36,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:36,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:36,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:36,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:36,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:36,714 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:36,865 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:36,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:36,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:36,866 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:36,866 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:36,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-12-03 15:53:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:36,934 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:36,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:36,934 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:36,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:36,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:36,934 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:36,934 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:36,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -449428350, now seen corresponding path program 107 times [2018-12-03 15:53:36,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:36,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:36,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:36,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:36,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:36,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:36,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:36,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:37,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:37,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:37,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:37,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:37,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:37,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:37,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:37,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:37,108 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:37,238 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:37,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:37,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:37,238 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:37,238 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:37,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-12-03 15:53:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:37,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 15:53:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:37,296 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:37,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:37,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:37,296 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 15:53:37,296 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:37,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash -394078594, now seen corresponding path program 108 times [2018-12-03 15:53:37,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:37,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:37,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:37,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:37,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:37,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:37,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:37,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:37,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:37,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:37,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:37,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:37,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:37,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:37,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:37,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:37,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:37,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:37,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:37,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:37,491 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 15:53:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:37,636 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:37,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:37,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:37,636 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:37,637 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:37,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-12-03 15:53:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:37,706 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:37,706 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:37,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:37,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:37,707 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:37,707 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:37,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -394076672, now seen corresponding path program 109 times [2018-12-03 15:53:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:37,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:37,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:37,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:37,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:37,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:37,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:37,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:37,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:37,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:37,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:37,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:37,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:37,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:37,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:37,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:37,884 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:38,039 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:38,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:38,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:38,040 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:38,040 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:38,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 15:53:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:38,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:38,118 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:38,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:38,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:38,119 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:38,119 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:38,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:38,119 INFO L82 PathProgramCache]: Analyzing trace with hash -394019012, now seen corresponding path program 110 times [2018-12-03 15:53:38,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:38,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:38,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:38,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:38,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:38,186 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:38,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:38,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:38,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:38,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:38,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:38,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:38,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:38,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:38,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:38,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:38,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:38,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:38,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:38,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:38,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:38,313 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:38,513 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:38,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:38,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:38,513 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:38,514 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:38,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-12-03 15:53:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:38,585 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:38,586 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:38,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:38,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:38,586 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:38,586 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:38,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash -394017090, now seen corresponding path program 111 times [2018-12-03 15:53:38,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:38,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:38,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:38,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:38,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:38,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:38,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:38,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:38,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:38,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:38,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:38,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:38,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:38,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:38,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:38,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:38,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:38,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:38,746 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:38,885 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:38,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:38,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:38,886 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:38,886 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:38,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-03 15:53:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:38,949 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 15:53:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:38,949 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:38,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:38,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:38,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:38,950 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 15:53:38,950 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:38,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:38,950 INFO L82 PathProgramCache]: Analyzing trace with hash -392231552, now seen corresponding path program 112 times [2018-12-03 15:53:38,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:38,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:39,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:39,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:39,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:39,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:39,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:39,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:39,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:39,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:39,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:39,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:39,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:39,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:39,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:39,121 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 15:53:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:39,254 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:39,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:39,255 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:39,255 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:39,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-12-03 15:53:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:39,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:39,328 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:39,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:39,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:39,328 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:39,329 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:39,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash -392229630, now seen corresponding path program 113 times [2018-12-03 15:53:39,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:39,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:39,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:39,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:39,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:39,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:39,382 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:39,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:39,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:39,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:39,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:39,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:39,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:53:39,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:39,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:39,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:39,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:39,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:39,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:39,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:39,710 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:39,842 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:53:39,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:39,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:39,842 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:53:39,842 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:53:39,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:53:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 15:53:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:39,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 15:53:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:39,918 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:39,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:39,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:39,918 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 15:53:39,919 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:39,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash -392171970, now seen corresponding path program 114 times [2018-12-03 15:53:39,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:39,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:39,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:39,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:39,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:39,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:39,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:39,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:39,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:39,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:39,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:39,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:39,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:40,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:40,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:40,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:40,087 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 15:53:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:40,214 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:53:40,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:40,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:40,214 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:53:40,214 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:53:40,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:53:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-12-03 15:53:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:40,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 15:53:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:40,294 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:40,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:53:40,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:40,294 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:53:40,294 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:40,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:40,295 INFO L82 PathProgramCache]: Analyzing trace with hash -392170048, now seen corresponding path program 6 times [2018-12-03 15:53:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:40,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:40,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:40,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:40,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:40,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:40,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:40,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:40,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:40,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:40,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:40,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:40,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:40,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:40,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:40,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:53:40,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:40,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:53:40,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:53:40,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:40,471 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 15:53:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:40,600 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 15:53:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:53:40,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:53:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:40,601 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:53:40,601 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:53:40,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:53:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:53:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-12-03 15:53:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:53:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 15:53:40,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 9 [2018-12-03 15:53:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:40,648 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 15:53:40,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:53:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 15:53:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:40,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:40,648 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:53:40,649 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:40,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash -977260376, now seen corresponding path program 7 times [2018-12-03 15:53:40,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:40,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:40,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:40,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:40,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:40,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:40,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:40,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:40,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:40,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:40,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:40,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:40,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:40,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:40,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:40,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:40,880 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 10 states. [2018-12-03 15:53:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:41,284 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:53:41,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:41,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:41,285 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:53:41,285 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:53:41,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:53:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:53:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:41,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:41,455 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:41,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:41,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:41,456 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:53:41,457 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:41,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:41,457 INFO L82 PathProgramCache]: Analyzing trace with hash -977258454, now seen corresponding path program 115 times [2018-12-03 15:53:41,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:41,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:41,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:41,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:41,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:42,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:42,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:42,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:42,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:42,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:42,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:42,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:42,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:42,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:42,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:42,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:42,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:42,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:42,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:42,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:42,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:42,356 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:42,608 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:53:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:42,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:42,609 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:53:42,609 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:53:42,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:53:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 15:53:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:42,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:53:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:42,701 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:42,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:42,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:42,702 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:53:42,702 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:42,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash -977200794, now seen corresponding path program 116 times [2018-12-03 15:53:42,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:42,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:42,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:42,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:42,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:42,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:42,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:42,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:42,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:42,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:42,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:42,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:42,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:42,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:42,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:43,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:43,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:43,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:43,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:43,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:43,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:43,042 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:53:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:43,288 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:53:43,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:43,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:43,289 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:53:43,289 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:53:43,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:53:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:53:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:43,389 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:43,389 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:43,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:43,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:43,389 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:43,389 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:43,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash -977198872, now seen corresponding path program 117 times [2018-12-03 15:53:43,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:43,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:43,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:43,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:43,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:43,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:43,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:43,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:43,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:43,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:43,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:43,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:43,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:43,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:43,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:43,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:43,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:43,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:43,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:43,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:43,606 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:43,832 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:53:43,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:43,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:43,833 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:53:43,833 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:53:43,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:53:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 15:53:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:43,916 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:53:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:43,916 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:43,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:43,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:43,917 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:53:43,917 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:43,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash -975413334, now seen corresponding path program 118 times [2018-12-03 15:53:43,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:43,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:43,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:43,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:43,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:44,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:44,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:44,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:44,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:44,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:44,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:44,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:44,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:44,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:44,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:44,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:44,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:44,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:44,179 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:53:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:44,378 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:53:44,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:44,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:44,379 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:53:44,379 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:53:44,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:53:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 15:53:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:44,477 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:44,478 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:44,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:44,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:44,478 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:44,478 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:44,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:44,478 INFO L82 PathProgramCache]: Analyzing trace with hash -975411412, now seen corresponding path program 119 times [2018-12-03 15:53:44,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:44,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:44,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:44,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:44,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:44,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:44,577 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:44,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:44,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:44,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:44,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:44,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:44,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:44,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:44,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:44,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:44,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:44,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:44,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:44,790 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:44,990 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:53:44,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:44,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:44,990 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:53:44,991 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:53:44,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:53:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 15:53:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:45,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:53:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:45,084 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:45,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:45,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:45,084 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:45,084 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:45,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:45,084 INFO L82 PathProgramCache]: Analyzing trace with hash -975353752, now seen corresponding path program 120 times [2018-12-03 15:53:45,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:45,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:45,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:45,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:45,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:45,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:45,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:45,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:45,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:45,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:45,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:45,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:45,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:45,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:45,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:45,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:45,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:45,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:45,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:45,274 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:53:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:45,472 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:45,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:45,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:45,473 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:45,473 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:45,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:53:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:45,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:45,569 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:45,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:45,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:45,569 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:45,570 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:45,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash -975351830, now seen corresponding path program 121 times [2018-12-03 15:53:45,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:45,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:45,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:45,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:45,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:46,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:46,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:46,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:46,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:46,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:46,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:46,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:46,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:46,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:46,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:46,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:46,295 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:46,468 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:46,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:46,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:46,469 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:46,469 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:46,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-12-03 15:53:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:46,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 15:53:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:46,544 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:46,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:46,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:46,545 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:53:46,545 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:46,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash -920002074, now seen corresponding path program 122 times [2018-12-03 15:53:46,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:46,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:46,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:46,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:46,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:46,625 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:46,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:46,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:46,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:46,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:46,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:46,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:46,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:46,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:46,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:46,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:46,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:46,878 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 15:53:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:47,099 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:53:47,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:47,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:47,100 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:53:47,100 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:53:47,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:53:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:53:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:47,195 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:47,195 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:47,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:47,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:47,195 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:47,195 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:47,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash -920000152, now seen corresponding path program 123 times [2018-12-03 15:53:47,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:47,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:47,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:47,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:47,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:47,258 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:47,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:47,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:47,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:47,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:47,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:47,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:47,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:47,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:47,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:47,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:47,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:47,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:47,394 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:47,631 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:53:47,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:47,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:47,633 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:53:47,633 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:53:47,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:53:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 15:53:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:47,727 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:53:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:47,728 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:47,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:47,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:47,728 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:47,728 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:47,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash -919942492, now seen corresponding path program 124 times [2018-12-03 15:53:47,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:47,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:47,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:47,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:47,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:47,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:47,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:47,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:47,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:47,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:47,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:47,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:47,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:47,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:47,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:47,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:47,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:47,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:47,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:47,947 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:53:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:48,181 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:53:48,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:48,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:48,181 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:53:48,182 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:53:48,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:53:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:53:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:48,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:48,285 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:48,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:48,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:48,286 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:48,286 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:48,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash -919940570, now seen corresponding path program 125 times [2018-12-03 15:53:48,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:48,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:48,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:48,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:48,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:48,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:48,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:48,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:48,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:48,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:48,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:48,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:48,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:48,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:48,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:48,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:48,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:48,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:48,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:48,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:48,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:48,581 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:48,796 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:53:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:48,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:48,797 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:53:48,797 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:53:48,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:53:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 15:53:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:48,885 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:53:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:48,885 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:48,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:48,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:48,886 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:48,886 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:48,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash -918155032, now seen corresponding path program 126 times [2018-12-03 15:53:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:48,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:48,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:48,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:48,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:48,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:48,952 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:48,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:48,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:48,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:48,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:48,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:48,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:48,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:48,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:48,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:49,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:49,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:49,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:49,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:49,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:49,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:49,101 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:53:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:49,306 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:53:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:49,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:49,306 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:53:49,307 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:53:49,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:53:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 15:53:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:49,416 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:49,416 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:49,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:49,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:49,416 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:49,416 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:49,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash -918153110, now seen corresponding path program 127 times [2018-12-03 15:53:49,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:49,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:49,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:49,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:49,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:49,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:49,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:49,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:49,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:49,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:49,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:49,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:49,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:49,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:49,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:49,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:49,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:49,790 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:50,001 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:53:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:50,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:50,003 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:53:50,003 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:53:50,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:53:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 15:53:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:50,096 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:53:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:50,096 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:50,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:50,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:50,097 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:50,097 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:50,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash -918095450, now seen corresponding path program 128 times [2018-12-03 15:53:50,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:50,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:50,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:50,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:50,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:50,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:50,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:50,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:50,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:50,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:50,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:50,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:50,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:50,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:50,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:50,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:50,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:50,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:50,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:50,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:50,368 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:53:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:50,602 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:50,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:50,603 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:50,603 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:50,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:53:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:50,726 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:50,727 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:50,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:50,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:50,727 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:50,727 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:50,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash -918093528, now seen corresponding path program 129 times [2018-12-03 15:53:50,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:50,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:50,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:50,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:50,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:50,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:50,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:50,926 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:50,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:50,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:50,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:50,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:50,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:50,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:50,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:50,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:50,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:51,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:51,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:51,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:51,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:51,062 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:51,258 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:51,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:51,259 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:51,259 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:51,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-12-03 15:53:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:53:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:53:51,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 10 [2018-12-03 15:53:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:51,336 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:53:51,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:53:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:51,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:51,336 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:53:51,337 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:51,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 797746986, now seen corresponding path program 130 times [2018-12-03 15:53:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:51,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:51,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:51,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:51,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:51,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:51,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:51,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:51,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:51,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:51,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:51,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:51,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:51,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:51,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:51,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:51,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:51,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:51,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:51,640 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 10 states. [2018-12-03 15:53:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:51,875 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:51,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:51,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:51,876 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:51,876 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:51,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:53:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:52,004 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:52,004 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:52,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:52,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:52,004 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:52,004 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:52,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:52,005 INFO L82 PathProgramCache]: Analyzing trace with hash 797748908, now seen corresponding path program 131 times [2018-12-03 15:53:52,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:52,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:52,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:52,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:52,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:52,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:52,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:52,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:52,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:52,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:52,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:52,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:52,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:52,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:52,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:52,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:52,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:52,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:52,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:52,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:52,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:52,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:52,202 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:52,409 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:52,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:52,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:52,410 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:52,410 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:52,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 15:53:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:52,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:53:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:52,517 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:52,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:52,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:52,517 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:52,517 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:52,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash 797806568, now seen corresponding path program 132 times [2018-12-03 15:53:52,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:52,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:52,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:52,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:52,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:52,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:52,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:52,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:52,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:52,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:52,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:52,600 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:52,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:52,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:52,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:52,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:52,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:52,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:52,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:52,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:52,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:52,712 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:53:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:52,905 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:52,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:52,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:52,906 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:52,906 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:52,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 15:53:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:53,009 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:53,009 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:53,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:53,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:53,010 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:53,010 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:53,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash 797808490, now seen corresponding path program 133 times [2018-12-03 15:53:53,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:53,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:53,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:53,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:53,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:53,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:53,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:53,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:53,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:53,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:53,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:53,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:53,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:53,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:53,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:53,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:53,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:53,232 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:53,408 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:53,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:53,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:53,409 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:53,409 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:53,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 15:53:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:53,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:53:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:53,507 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:53,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:53,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:53,508 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:53,508 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:53,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash 799594028, now seen corresponding path program 134 times [2018-12-03 15:53:53,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:53,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:53,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:53,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:53,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:53,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:53,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:53,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:53,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:53,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:53,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:53,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:53,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:53,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:53,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:53,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:53,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:53,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:53,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:53,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:53,704 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:53:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:53,915 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:53,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:53,915 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:53,916 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:53,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:53:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:54,029 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:54,030 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:54,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:54,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:54,030 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:54,030 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:54,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 799595950, now seen corresponding path program 135 times [2018-12-03 15:53:54,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:54,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:54,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:54,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:54,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:54,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:54,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:54,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:54,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:54,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:54,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:54,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:54,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:54,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:54,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:54,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:54,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:54,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:54,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:54,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:54,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:54,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:54,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:54,268 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:54,483 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:53:54,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:54,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:54,484 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:53:54,484 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:53:54,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:53:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 15:53:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:54,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:53:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:54,598 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:54,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:54,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:54,598 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:54,598 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:54,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:54,598 INFO L82 PathProgramCache]: Analyzing trace with hash 799653610, now seen corresponding path program 136 times [2018-12-03 15:53:54,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:54,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:54,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:54,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:54,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:54,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:54,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:54,741 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:54,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:54,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:54,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:54,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:54,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:54,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:54,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:54,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:54,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:54,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:54,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:54,973 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:53:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:55,238 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:53:55,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:55,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:55,239 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:53:55,239 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:53:55,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:53:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 15:53:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:55,347 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:55,347 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:55,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:55,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:55,348 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:55,348 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:55,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:55,348 INFO L82 PathProgramCache]: Analyzing trace with hash 799655532, now seen corresponding path program 137 times [2018-12-03 15:53:55,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:55,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:55,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:55,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:55,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:56,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:56,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:56,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:56,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:56,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:56,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:56,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:56,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:56,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:56,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:56,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:56,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:56,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:56,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:56,530 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:56,727 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:56,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:56,727 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:56,727 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:56,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 15:53:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:53:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:53:56,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 15:53:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:56,813 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:53:56,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:53:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:56,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:56,813 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:53:56,813 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:56,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash 855005288, now seen corresponding path program 138 times [2018-12-03 15:53:56,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:56,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:56,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:56,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:56,873 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:56,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:56,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:56,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:56,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:56,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:56,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:56,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:56,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:56,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:56,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:56,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:56,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:56,996 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 15:53:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:57,207 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:57,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:57,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:57,207 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:57,207 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:57,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 15:53:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:57,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:57,318 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:57,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:57,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:57,318 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:57,319 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:57,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 855007210, now seen corresponding path program 139 times [2018-12-03 15:53:57,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:57,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:57,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:57,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:57,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:57,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:57,491 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:57,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:57,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:57,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:57,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:57,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:57,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:57,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:57,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:57,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:57,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:57,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:57,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:57,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:57,630 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:57,826 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:57,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:57,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:57,827 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:57,827 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:57,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-12-03 15:53:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:53:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:53:57,934 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:53:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:57,934 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:53:57,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:53:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:57,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:57,934 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:57,935 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:57,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:57,935 INFO L82 PathProgramCache]: Analyzing trace with hash 855064870, now seen corresponding path program 140 times [2018-12-03 15:53:57,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:57,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:57,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:57,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:57,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:58,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:58,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:58,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:58,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:58,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:58,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:58,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:58,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:58,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:58,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:58,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:58,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:58,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:58,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:58,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:58,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:58,160 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:53:58,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:58,377 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:53:58,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:58,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:58,377 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:53:58,378 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:53:58,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:53:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 15:53:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:58,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:58,493 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:58,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:58,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:58,494 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:58,494 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:58,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash 855066792, now seen corresponding path program 141 times [2018-12-03 15:53:58,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:58,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:58,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:58,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:58,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:58,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:58,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:58,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:58,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:58,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:58,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:58,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:58,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:58,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:58,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:58,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:58,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:58,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:58,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:58,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:58,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:58,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:58,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:58,713 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:53:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:58,915 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:53:58,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:58,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:58,916 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:53:58,916 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:53:58,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:53:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 15:53:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:53:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:53:59,017 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:53:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:59,017 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:53:59,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:53:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:59,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:59,017 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:59,018 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:59,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash 856852330, now seen corresponding path program 142 times [2018-12-03 15:53:59,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:59,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:59,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:59,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:59,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:59,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:59,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:59,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:59,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:59,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:59,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:59,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:59,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:59,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:59,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:53:59,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:59,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:53:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:53:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:59,343 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:53:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:59,544 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:53:59,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:53:59,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:53:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:59,544 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:53:59,544 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:53:59,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:53:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:53:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-12-03 15:53:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:53:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:53:59,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:53:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:59,670 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:53:59,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:53:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:53:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:53:59,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:59,670 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:53:59,670 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:59,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:59,670 INFO L82 PathProgramCache]: Analyzing trace with hash 856854252, now seen corresponding path program 143 times [2018-12-03 15:53:59,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:59,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:59,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:59,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:59,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:59,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:59,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:59,838 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:59,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:59,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:59,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:59,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:59,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:59,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:53:59,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:59,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:59,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:00,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:00,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:00,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:00,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:00,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:00,112 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:00,292 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:54:00,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:00,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:00,293 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:54:00,293 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:54:00,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:54:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-12-03 15:54:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:00,401 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:00,401 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:00,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:00,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:00,402 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:00,402 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:00,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash 856911912, now seen corresponding path program 144 times [2018-12-03 15:54:00,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:00,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:00,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:00,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:00,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:00,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:00,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:00,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:00,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:00,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:00,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:00,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:00,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:00,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:00,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:00,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:00,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:00,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:00,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:00,634 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:00,809 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:54:00,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:00,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:00,809 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:54:00,809 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:54:00,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:54:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-03 15:54:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:00,916 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:00,917 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:00,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:00,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:00,917 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:00,917 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:00,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 856913834, now seen corresponding path program 145 times [2018-12-03 15:54:00,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:00,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:00,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:00,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:00,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:00,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:00,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:00,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:00,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:00,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:00,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:00,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:00,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:01,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:01,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:01,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:01,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:01,116 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:01,275 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:54:01,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:01,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:01,276 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:54:01,276 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:54:01,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:54:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-12-03 15:54:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:54:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:54:01,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 10 [2018-12-03 15:54:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:01,353 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:54:01,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:54:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:01,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:01,354 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:54:01,354 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:01,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1786607002, now seen corresponding path program 146 times [2018-12-03 15:54:01,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:01,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:01,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:01,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:01,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:01,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:01,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:01,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:01,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:01,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:01,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:01,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:01,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:01,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:01,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:01,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:01,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:01,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:01,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:01,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:01,558 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 10 states. [2018-12-03 15:54:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:01,814 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:01,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:01,815 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:01,815 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:01,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:54:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:01,951 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:01,951 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:01,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:01,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:01,952 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:01,952 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:01,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1786605080, now seen corresponding path program 147 times [2018-12-03 15:54:01,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:01,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:01,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:01,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:01,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:02,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:02,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:02,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:02,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:02,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:02,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:02,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:02,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:02,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:02,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:02,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:02,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:02,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:02,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:02,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:02,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:02,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:02,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:02,170 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:02,488 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:02,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:02,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:02,489 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:02,489 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:02,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 15:54:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:02,667 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:02,667 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:02,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:02,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:02,667 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:02,667 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:02,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1786547420, now seen corresponding path program 148 times [2018-12-03 15:54:02,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:02,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:02,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:02,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:02,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:02,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:02,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:02,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:02,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:02,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:02,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:02,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:02,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:02,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:02,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:02,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:02,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:02,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:02,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:02,864 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:03,142 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:03,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:03,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:03,143 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:03,143 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:03,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:54:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:03,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:03,266 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:03,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:03,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:03,266 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:03,266 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:03,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:03,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1786545498, now seen corresponding path program 149 times [2018-12-03 15:54:03,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:03,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:03,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:03,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:03,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:03,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:03,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:03,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:03,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:03,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:03,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:03,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:03,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:03,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:03,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:03,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:03,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:03,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:03,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:03,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:03,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:03,453 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:03,725 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:03,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:03,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:03,726 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:03,726 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:03,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 15:54:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:54:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:54:03,840 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:54:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:03,840 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:54:03,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:54:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:03,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:03,840 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:03,840 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:03,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1784759960, now seen corresponding path program 150 times [2018-12-03 15:54:03,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:03,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:03,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:03,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:03,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:03,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:03,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:03,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:03,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:03,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:03,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:03,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:03,913 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:03,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:03,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:03,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:04,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:04,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:04,038 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:04,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:04,038 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:54:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:04,291 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:54:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:04,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:04,292 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:54:04,292 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:54:04,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:54:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 15:54:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:04,431 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:04,431 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:04,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:04,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:04,432 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:04,432 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:04,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1784758038, now seen corresponding path program 151 times [2018-12-03 15:54:04,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:04,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:04,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:04,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:04,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:04,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:04,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:04,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:04,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:04,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:04,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:04,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:04,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:04,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:04,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:04,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:04,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:04,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:04,669 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:04,940 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:54:04,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:04,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:04,940 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:54:04,941 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:54:04,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:54:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 15:54:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:05,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:05,070 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:05,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:05,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:05,071 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:05,071 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:05,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1784700378, now seen corresponding path program 152 times [2018-12-03 15:54:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:05,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:05,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:05,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:05,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:05,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:05,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:05,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:05,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:05,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:05,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:05,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:05,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:05,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:05,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:05,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:05,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:05,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:05,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:05,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:05,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:05,364 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:05,614 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:54:05,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:05,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:05,615 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:54:05,615 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:54:05,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:54:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:54:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:05,749 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:05,749 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:05,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:05,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:05,749 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:05,749 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:05,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1784698456, now seen corresponding path program 153 times [2018-12-03 15:54:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:05,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:05,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:05,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:05,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:05,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:05,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:05,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:05,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:05,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:05,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:05,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:05,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:05,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:05,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:05,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:05,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:05,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:05,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:05,946 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:05,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:05,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:05,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:05,946 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:06,190 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:54:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:06,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:06,191 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:54:06,191 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:54:06,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:54:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-12-03 15:54:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:54:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:54:06,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 15:54:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:06,291 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:54:06,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:54:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:06,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:06,291 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:06,291 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:06,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1729348700, now seen corresponding path program 154 times [2018-12-03 15:54:06,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:06,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:06,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:06,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:06,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:06,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:06,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:06,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:06,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:06,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:06,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:06,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:06,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:06,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:06,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:06,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:06,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:06,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:06,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:06,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:06,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:06,487 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 15:54:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:06,761 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:06,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:06,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:06,762 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:06,762 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:06,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:54:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:06,898 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:06,898 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:06,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:06,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:06,898 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:06,898 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:06,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1729346778, now seen corresponding path program 155 times [2018-12-03 15:54:06,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:06,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:06,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:06,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:06,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:06,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:06,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:06,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:06,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:06,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:06,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:06,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:06,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:06,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:06,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:07,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:07,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:07,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:07,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:07,091 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:07,365 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:07,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:07,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:07,366 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:07,366 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:07,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 15:54:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:07,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:07,492 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:07,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:07,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:07,492 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:07,493 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:07,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1729289118, now seen corresponding path program 156 times [2018-12-03 15:54:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:07,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:07,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:07,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:07,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:07,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:07,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:07,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:07,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:07,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:07,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:07,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:07,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:07,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:07,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:07,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:07,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:07,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:07,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:07,690 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:07,975 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:07,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:07,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:07,976 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:07,976 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:07,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:08,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:54:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:08,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:08,114 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:08,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:08,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:08,114 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:08,114 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:08,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1729287196, now seen corresponding path program 157 times [2018-12-03 15:54:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:08,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:08,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:08,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:08,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:08,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:08,173 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:08,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:08,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:08,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:08,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:08,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:08,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:08,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:08,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:08,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:08,307 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:08,580 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:08,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:08,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:08,581 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:08,581 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:08,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 15:54:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:54:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:54:08,735 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:54:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:08,735 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:54:08,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:54:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:08,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:08,735 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:08,736 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:08,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1727501658, now seen corresponding path program 158 times [2018-12-03 15:54:08,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:08,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:08,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:08,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:08,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:08,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:08,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:08,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:08,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:08,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:08,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:08,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:08,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:08,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:08,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:08,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:08,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:08,920 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:54:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:09,194 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:54:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:09,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:09,195 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:54:09,195 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:54:09,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:54:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 15:54:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:09,330 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:09,330 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:09,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:09,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:09,330 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:09,330 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:09,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1727499736, now seen corresponding path program 159 times [2018-12-03 15:54:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:09,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:09,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:09,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:09,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:09,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:09,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:09,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:09,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:09,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:09,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:09,409 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:09,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:09,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:09,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:09,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:09,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:09,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:09,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:09,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:09,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:09,532 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:09,795 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:54:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:09,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:09,796 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:54:09,796 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:54:09,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:54:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 15:54:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:09,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:09,928 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:09,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:09,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:09,928 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:09,928 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:09,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1727442076, now seen corresponding path program 160 times [2018-12-03 15:54:09,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:09,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:09,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:10,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:10,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:10,036 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:10,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:10,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:10,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:10,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:10,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:10,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:10,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:10,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:10,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:10,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:10,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:10,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:10,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:10,316 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:10,572 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:54:10,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:10,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:10,573 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:54:10,573 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:54:10,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:54:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:54:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:10,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:10,705 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:10,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:10,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:10,705 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:10,706 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:10,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1727440154, now seen corresponding path program 161 times [2018-12-03 15:54:10,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:10,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:10,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:10,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:10,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:10,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:10,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:10,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:10,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:10,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:10,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:10,782 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:10,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:10,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:10,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:10,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:10,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:10,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:10,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:10,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:10,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:10,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:10,964 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:11,248 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:54:11,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:11,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:11,249 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:54:11,249 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:54:11,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:54:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-12-03 15:54:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:54:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:54:11,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 10 [2018-12-03 15:54:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:11,349 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:54:11,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:54:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:11,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:11,349 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:11,349 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:11,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash -11599640, now seen corresponding path program 162 times [2018-12-03 15:54:11,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:11,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:11,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:11,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:11,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:11,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:11,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:11,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:11,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:11,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:11,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:11,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:11,419 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:11,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:11,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:11,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:11,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:11,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:11,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:11,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:11,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:11,536 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 10 states. [2018-12-03 15:54:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:11,791 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:54:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:11,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:11,792 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:54:11,792 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:54:11,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:54:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:54:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:11,927 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:11,928 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:11,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:11,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:11,928 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:11,928 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:11,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -11597718, now seen corresponding path program 163 times [2018-12-03 15:54:11,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:11,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:11,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:11,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:11,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:11,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:11,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:11,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:11,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:11,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:11,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:12,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:12,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:12,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:12,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:12,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:12,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:12,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:12,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:12,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:12,119 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:12,394 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:54:12,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:12,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:12,394 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:54:12,394 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:54:12,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:54:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 15:54:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:12,532 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:12,532 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:12,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:12,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:12,533 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:12,533 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:12,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash -11540058, now seen corresponding path program 164 times [2018-12-03 15:54:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:12,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:12,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:12,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:12,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:12,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:12,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:12,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:12,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:12,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:12,600 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:12,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:12,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:12,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:12,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:12,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:12,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:12,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:12,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:12,748 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:13,002 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:54:13,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:13,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:13,003 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:54:13,003 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:54:13,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:54:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 15:54:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:13,144 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:13,145 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:13,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:13,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:13,145 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:13,145 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:13,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash -11538136, now seen corresponding path program 165 times [2018-12-03 15:54:13,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:13,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:13,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:13,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:13,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:13,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:13,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:13,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:13,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:13,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:13,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:13,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:13,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:13,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:13,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:13,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:13,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:13,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:13,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:13,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:13,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:13,348 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:13,603 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:54:13,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:13,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:13,603 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:54:13,603 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:54:13,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:54:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 15:54:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:54:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:54:13,728 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:54:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:13,728 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:54:13,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:54:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:13,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:13,728 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:13,729 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:13,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash -9752598, now seen corresponding path program 166 times [2018-12-03 15:54:13,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:13,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:13,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:13,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:13,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:13,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:13,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:13,866 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:13,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:13,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:13,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:13,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:13,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:13,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:13,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:14,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:14,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:14,033 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:14,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:14,034 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:54:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:14,311 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:54:14,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:14,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:14,312 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:54:14,312 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:54:14,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:54:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:54:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:14,449 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:14,449 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:14,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:14,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:14,449 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:14,449 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:14,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:14,450 INFO L82 PathProgramCache]: Analyzing trace with hash -9750676, now seen corresponding path program 167 times [2018-12-03 15:54:14,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:14,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:14,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:14,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:14,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:14,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:14,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:14,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:14,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:14,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:14,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:14,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:14,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:14,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:14,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:14,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:14,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:14,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:14,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:14,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:14,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:14,650 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:14,926 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:54:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:14,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:14,927 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:54:14,927 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:54:14,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:54:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 15:54:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:15,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:15,068 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:15,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:15,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:15,068 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:15,068 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:15,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash -9693016, now seen corresponding path program 168 times [2018-12-03 15:54:15,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:15,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:15,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:15,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:15,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:15,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:15,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:15,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:15,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:15,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:15,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:15,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:15,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:15,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:15,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:15,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:15,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:15,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:15,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:15,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:15,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:15,477 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:15,743 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:54:15,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:15,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:15,743 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:54:15,743 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:54:15,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:54:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 15:54:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:15,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:15,885 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:15,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:15,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:15,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:15,886 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:15,886 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:15,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:15,887 INFO L82 PathProgramCache]: Analyzing trace with hash -9691094, now seen corresponding path program 169 times [2018-12-03 15:54:15,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:15,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:15,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:15,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:15,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:15,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:15,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:15,962 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:15,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:15,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:15,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:15,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:15,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:15,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:15,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:16,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:16,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:16,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:16,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:16,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:16,094 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:16,345 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:54:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:16,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:16,346 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:54:16,346 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:54:16,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:54:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 15:54:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:54:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:54:16,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 15:54:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:16,474 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:54:16,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:54:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:16,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:16,474 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:16,474 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:16,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash 45658662, now seen corresponding path program 170 times [2018-12-03 15:54:16,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:16,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:16,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:16,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:16,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:16,536 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:16,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:16,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:16,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:16,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:16,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:16,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:16,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:16,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:16,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:16,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:16,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:16,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:16,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:16,662 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 15:54:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:16,896 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:54:16,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:16,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:16,896 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:54:16,897 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:54:16,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:54:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 15:54:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:17,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:17,054 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:17,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:17,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:17,054 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:17,054 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:17,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash 45660584, now seen corresponding path program 171 times [2018-12-03 15:54:17,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:17,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:17,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:17,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:17,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:17,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:17,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:17,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:17,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:17,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:17,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:17,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:17,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:17,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:17,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:17,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:17,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:17,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:17,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:17,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:17,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:17,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:17,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:17,302 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:17,533 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:54:17,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:17,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:17,534 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:54:17,534 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:54:17,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:54:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-12-03 15:54:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:17,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:17,670 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:17,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:17,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:17,671 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:17,671 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:17,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash 45718244, now seen corresponding path program 172 times [2018-12-03 15:54:17,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:17,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:17,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:17,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:17,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:17,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:17,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:17,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:17,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:17,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:17,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:17,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:17,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:17,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:17,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:17,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:17,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:17,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:17,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:17,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:17,865 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:18,159 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:54:18,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:18,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:18,160 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:54:18,160 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:54:18,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:54:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 15:54:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:18,300 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:18,300 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:18,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:18,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:18,301 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:18,301 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:18,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 45720166, now seen corresponding path program 173 times [2018-12-03 15:54:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:18,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:18,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:18,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:18,362 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:18,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:18,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:18,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:18,370 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:18,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:18,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:18,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:18,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:18,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:18,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:18,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:18,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:18,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:18,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:18,478 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:18,716 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:54:18,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:18,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:18,717 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:54:18,717 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:54:18,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:54:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 15:54:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:54:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:54:18,843 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:54:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:18,843 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:54:18,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:54:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:18,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:18,843 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:18,844 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:18,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash 47505704, now seen corresponding path program 174 times [2018-12-03 15:54:18,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:18,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:18,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:18,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:18,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:18,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:18,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:18,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:18,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:18,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:18,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:18,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:18,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:18,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:18,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:18,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:19,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:19,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:19,088 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:19,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:19,088 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:54:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:19,308 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:54:19,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:19,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:19,309 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:54:19,309 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:54:19,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:54:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-12-03 15:54:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:19,466 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:19,466 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:19,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:19,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:19,467 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:19,467 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:19,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash 47507626, now seen corresponding path program 175 times [2018-12-03 15:54:19,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:19,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:19,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:19,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:19,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:19,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:19,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:19,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:19,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:19,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:19,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:19,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:19,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:19,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:19,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:19,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:19,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:19,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:19,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:19,668 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:19,893 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:54:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:19,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:19,894 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:54:19,894 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:54:19,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:54:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-12-03 15:54:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:20,039 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:20,039 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:20,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:20,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:20,040 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:20,040 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:20,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash 47565286, now seen corresponding path program 176 times [2018-12-03 15:54:20,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:20,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:20,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:20,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:20,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:20,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:20,101 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:20,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:20,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:20,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:20,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:20,110 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:20,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:20,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:20,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:20,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:20,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:20,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:20,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:20,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:20,407 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:20,609 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:54:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:20,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:20,609 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:54:20,609 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:54:20,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:54:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-03 15:54:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:20,766 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:20,766 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:20,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:20,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:20,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:20,766 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:54:20,766 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:20,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash 47567208, now seen corresponding path program 177 times [2018-12-03 15:54:20,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:20,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:20,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:20,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:20,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:20,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:20,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:20,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:20,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:20,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:20,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:20,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:20,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:20,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:20,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:20,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:20,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:20,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:20,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:20,969 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:21,170 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 15:54:21,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:21,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:21,171 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:54:21,171 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:54:21,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:54:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-12-03 15:54:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:54:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:54:21,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 10 [2018-12-03 15:54:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:21,261 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:54:21,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:54:21,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:21,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:21,261 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:54:21,261 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:21,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash -297202006, now seen corresponding path program 178 times [2018-12-03 15:54:21,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:21,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:21,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:21,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:21,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:21,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:21,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:21,324 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:21,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:21,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:21,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:21,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:21,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:21,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:21,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:21,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:21,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:21,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:21,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:21,472 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 10 states. [2018-12-03 15:54:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:21,877 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:54:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:21,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:21,878 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:54:21,878 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:54:21,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:54:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 15:54:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:22,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:22,050 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:22,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:22,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:22,051 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:22,051 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:22,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:22,051 INFO L82 PathProgramCache]: Analyzing trace with hash -297200084, now seen corresponding path program 179 times [2018-12-03 15:54:22,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:22,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:22,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:22,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:22,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:22,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:22,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:22,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:22,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:22,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:22,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:22,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:22,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:22,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:22,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:22,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:22,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:22,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:22,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:22,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:22,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:22,269 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:22,678 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:54:22,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:22,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:22,679 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:54:22,679 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:54:22,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:54:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 15:54:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:22,847 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:22,847 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:22,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:22,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:22,847 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:22,848 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:22,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash -297142424, now seen corresponding path program 180 times [2018-12-03 15:54:22,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:22,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:22,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:22,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:22,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:22,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:22,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:22,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:22,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:22,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:22,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:22,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:22,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:22,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:22,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:22,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:22,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:23,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:23,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:23,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:23,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:23,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:23,033 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:23,406 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:54:23,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:23,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:23,407 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:54:23,407 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:54:23,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:54:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 15:54:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:23,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:23,581 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:23,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:23,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:23,582 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:23,582 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:23,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:23,582 INFO L82 PathProgramCache]: Analyzing trace with hash -297140502, now seen corresponding path program 181 times [2018-12-03 15:54:23,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:23,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:23,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:23,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:23,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:23,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:23,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:23,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:23,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:23,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:23,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:23,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:23,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:23,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:23,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:23,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:23,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:23,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:23,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:23,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:23,811 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:24,187 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:54:24,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:24,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:24,188 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:54:24,188 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:54:24,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:54:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 16. [2018-12-03 15:54:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:24,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:24,349 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:24,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:24,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:24,349 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:24,349 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:24,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash -295354964, now seen corresponding path program 182 times [2018-12-03 15:54:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:24,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:24,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:24,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:24,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:24,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:24,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:24,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:24,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:24,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:24,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:24,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:24,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:24,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:24,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:24,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:24,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:24,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:24,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:24,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:24,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:24,824 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:25,221 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:54:25,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:25,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:25,221 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:54:25,222 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:54:25,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:54:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 15:54:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:25,407 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:25,407 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:25,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:25,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:25,407 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:25,407 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:25,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash -295353042, now seen corresponding path program 183 times [2018-12-03 15:54:25,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:25,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:25,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:25,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:25,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:25,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:25,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:25,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:25,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:25,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:25,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:25,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:25,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:25,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:25,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:25,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:25,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:25,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:25,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:25,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:25,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:25,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:25,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:25,762 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:26,159 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:54:26,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:26,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:26,160 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:54:26,160 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:54:26,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:54:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 15:54:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:26,457 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:26,457 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:26,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:26,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:26,457 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:26,458 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:26,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash -295295382, now seen corresponding path program 184 times [2018-12-03 15:54:26,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:26,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:26,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:26,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:26,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:26,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:26,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:26,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:26,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:26,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:26,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:26,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:26,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:26,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:26,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:26,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:26,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:26,782 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:26,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:26,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:26,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:26,783 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:27,151 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:54:27,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:27,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:27,157 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:54:27,157 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:54:27,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:54:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 15:54:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:27,332 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:27,332 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:27,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:27,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:27,333 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:27,333 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:27,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:27,333 INFO L82 PathProgramCache]: Analyzing trace with hash -295293460, now seen corresponding path program 185 times [2018-12-03 15:54:27,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:27,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:27,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:27,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:27,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:27,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:27,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:27,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:27,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:27,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:27,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:27,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:27,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:27,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:27,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:27,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:27,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:27,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:27,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:27,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:27,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:27,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:27,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:27,624 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:27,999 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:54:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:28,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:28,000 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:54:28,000 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:54:28,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:54:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. [2018-12-03 15:54:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:54:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:54:28,153 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:54:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:28,154 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:54:28,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:54:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:28,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:28,154 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:28,154 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:28,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:28,154 INFO L82 PathProgramCache]: Analyzing trace with hash -239943704, now seen corresponding path program 186 times [2018-12-03 15:54:28,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:28,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:28,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:28,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:28,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:28,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:28,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:28,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:28,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:28,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:28,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:28,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:28,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:28,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:28,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:28,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:28,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:28,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:28,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:28,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:28,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:28,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:28,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:28,590 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:54:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:28,974 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:54:28,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:28,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:28,975 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:54:28,975 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:54:28,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:54:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 15:54:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:29,151 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:29,151 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:29,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:29,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:29,151 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:29,151 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:29,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash -239941782, now seen corresponding path program 187 times [2018-12-03 15:54:29,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:29,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:29,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:29,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:29,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:29,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:29,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:29,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:29,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:29,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:29,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:29,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:29,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:29,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:29,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:29,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:29,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:29,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:29,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:29,344 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:29,711 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:54:29,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:29,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:29,712 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:54:29,712 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:54:29,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:54:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 15:54:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:29,905 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:29,905 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:29,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:29,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:29,906 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:29,906 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:29,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash -239884122, now seen corresponding path program 188 times [2018-12-03 15:54:29,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:29,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:29,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:29,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:29,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:29,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:29,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:29,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:29,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:29,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:29,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:29,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:29,974 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:29,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:29,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:29,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:29,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:30,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:30,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:30,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:30,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:30,097 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:30,485 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:54:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:30,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:30,485 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:54:30,486 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:54:30,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:54:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 15:54:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:30,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:30,662 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:30,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:30,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:30,663 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:30,663 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:30,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -239882200, now seen corresponding path program 189 times [2018-12-03 15:54:30,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:30,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:30,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:30,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:30,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:30,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:30,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:30,799 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:30,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:30,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:30,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:30,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:30,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:30,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:30,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:30,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:30,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:30,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:30,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:30,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:30,911 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:31,298 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:54:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:31,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:31,299 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:54:31,299 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:54:31,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:54:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-03 15:54:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:31,459 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:31,459 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:31,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:31,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:31,459 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:31,459 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:31,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:31,460 INFO L82 PathProgramCache]: Analyzing trace with hash -238096662, now seen corresponding path program 190 times [2018-12-03 15:54:31,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:31,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:31,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:31,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:31,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:31,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:31,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:31,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:31,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:31,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:31,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:31,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:31,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:31,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:31,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:31,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:31,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:31,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:31,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:31,647 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:32,023 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:32,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:32,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:32,024 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:32,024 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:32,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 15:54:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:32,244 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:32,245 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:32,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:32,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:32,245 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:32,245 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:32,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -238094740, now seen corresponding path program 191 times [2018-12-03 15:54:32,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:32,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:32,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:32,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:32,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:32,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:32,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:32,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:32,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:32,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:32,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:32,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:32,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:32,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:32,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:32,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:32,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:32,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:32,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:32,463 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:32,809 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:32,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:32,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:32,810 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:32,810 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:32,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:54:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:32,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:32,987 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:32,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:32,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:32,987 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:32,988 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:32,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash -238037080, now seen corresponding path program 192 times [2018-12-03 15:54:32,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:32,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:32,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:32,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:32,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:33,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:33,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:33,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:33,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:33,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:33,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:33,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:33,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:33,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:33,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:33,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:33,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:33,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:33,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:33,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:33,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:33,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:33,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:33,193 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:33,530 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:33,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:33,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:33,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:33,531 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:33,531 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:33,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 15:54:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:33,731 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:33,731 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:33,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:33,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:33,731 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:33,731 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:33,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:33,732 INFO L82 PathProgramCache]: Analyzing trace with hash -238035158, now seen corresponding path program 193 times [2018-12-03 15:54:33,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:33,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:33,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:33,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:33,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:33,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:33,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:33,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:33,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:33,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:33,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:33,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:33,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:33,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:33,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:33,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:33,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:33,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:33,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:33,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:33,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:33,941 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:34,250 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:54:34,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:34,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:34,251 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:54:34,251 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:54:34,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:54:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 14. [2018-12-03 15:54:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:54:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:54:34,384 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 15:54:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:34,384 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:54:34,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:54:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:34,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:34,384 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:34,384 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:34,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1477805356, now seen corresponding path program 194 times [2018-12-03 15:54:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:34,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:34,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:34,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:34,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:34,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:34,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:34,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:34,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:34,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:34,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:34,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:34,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:34,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:34,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:34,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:34,591 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 15:54:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:35,026 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:54:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:35,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:35,026 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:54:35,027 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:54:35,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:54:35,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 15:54:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:35,220 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:35,220 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:35,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:35,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:35,220 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:35,221 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:35,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1477807278, now seen corresponding path program 195 times [2018-12-03 15:54:35,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:35,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:35,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:35,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:35,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:35,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:35,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:35,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:35,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:35,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:35,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:35,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:35,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:35,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:35,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:35,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:35,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:35,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:35,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:35,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:35,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:35,422 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:35,825 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:54:35,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:35,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:35,825 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:54:35,826 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:54:35,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:54:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 15:54:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:36,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:36,006 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:36,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:36,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:36,007 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:36,007 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:36,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:36,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1477864938, now seen corresponding path program 196 times [2018-12-03 15:54:36,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:36,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:36,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:36,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:36,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:36,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:36,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:36,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:36,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:36,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:36,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:36,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:36,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:36,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:36,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:36,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:36,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:36,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:36,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:36,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:36,206 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:36,621 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:54:36,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:36,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:36,622 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:54:36,622 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:54:36,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:54:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 15:54:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:36,814 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:36,814 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:36,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:36,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:36,814 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:36,814 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:36,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1477866860, now seen corresponding path program 197 times [2018-12-03 15:54:36,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:36,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:36,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:36,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:36,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:36,893 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:36,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:36,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:36,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:36,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:36,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:36,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:36,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:36,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:36,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:37,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:37,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:37,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:37,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:37,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:37,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:37,042 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:37,431 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:54:37,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:37,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:37,432 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:54:37,432 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:54:37,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:54:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 16. [2018-12-03 15:54:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:37,603 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:37,603 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:37,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:37,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:37,604 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:37,604 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:37,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:37,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1479652398, now seen corresponding path program 198 times [2018-12-03 15:54:37,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:37,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:37,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:37,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:37,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:37,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:37,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:37,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:37,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:37,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:37,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:37,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:37,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:37,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:37,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:37,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:37,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:37,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:37,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:37,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:37,805 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:38,248 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:54:38,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:38,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:38,249 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:54:38,249 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:54:38,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:54:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 15:54:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:38,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:38,437 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:38,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:38,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:38,438 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:38,438 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:38,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1479654320, now seen corresponding path program 199 times [2018-12-03 15:54:38,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:38,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:38,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:38,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:38,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:38,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:38,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:38,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:38,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:38,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:38,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:38,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:38,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:38,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:38,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:38,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:38,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:38,637 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:38,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:38,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:38,637 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:39,074 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:54:39,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:39,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:39,075 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:54:39,075 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:54:39,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:54:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 15:54:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:39,257 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:39,258 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:39,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:39,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:39,258 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:39,258 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:39,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1479711980, now seen corresponding path program 200 times [2018-12-03 15:54:39,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:39,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:39,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:39,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:39,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:39,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:39,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:39,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:39,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:39,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:39,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:39,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:39,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:39,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:39,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:39,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:39,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:39,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:39,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:39,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:39,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:39,455 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:39,864 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:54:39,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:39,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:39,865 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:54:39,865 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:54:39,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:54:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 15:54:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:40,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:40,056 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:40,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:40,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:40,057 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:40,057 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:40,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1479713902, now seen corresponding path program 201 times [2018-12-03 15:54:40,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:40,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:40,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:40,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:40,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:40,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:40,120 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:40,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:40,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:40,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:40,131 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:40,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:40,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:40,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:40,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:40,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:40,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:40,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:40,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:40,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:40,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:40,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:40,248 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:40,650 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:54:40,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:40,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:40,651 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:54:40,651 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:54:40,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:54:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. [2018-12-03 15:54:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:54:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:54:40,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:54:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:40,820 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:54:40,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:54:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:40,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:40,820 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:40,821 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:40,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:40,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1535063658, now seen corresponding path program 202 times [2018-12-03 15:54:40,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:40,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:40,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:40,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:40,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:40,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:40,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:40,871 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:40,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:40,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:40,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:40,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:40,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:40,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:40,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:41,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:41,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:41,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:41,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:41,081 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:54:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:41,495 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:54:41,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:41,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:41,496 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:54:41,496 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:54:41,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:54:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 15:54:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:41,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:41,705 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:41,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:41,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:41,705 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:41,706 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:41,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1535065580, now seen corresponding path program 203 times [2018-12-03 15:54:41,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:41,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:41,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:41,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:41,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:41,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:41,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:41,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:41,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:41,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:41,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:41,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:41,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:41,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:41,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:41,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:41,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:41,905 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:41,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:41,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:41,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:41,905 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:42,298 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:54:42,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:42,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:42,299 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:54:42,299 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:54:42,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:54:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 15:54:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:42,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:42,502 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:42,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:42,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:42,503 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:42,503 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:42,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:42,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1535123240, now seen corresponding path program 204 times [2018-12-03 15:54:42,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:42,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:42,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:42,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:42,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:42,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:42,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:42,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:42,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:42,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:42,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:42,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:42,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:42,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:42,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:42,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:42,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:42,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:42,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:42,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:42,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:42,723 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:43,124 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:54:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:43,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:43,125 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:54:43,125 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:54:43,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:54:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 15:54:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:43,335 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:43,335 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:43,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:43,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:43,336 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:43,336 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:43,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1535125162, now seen corresponding path program 205 times [2018-12-03 15:54:43,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:43,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:43,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:43,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:43,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:43,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:43,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:43,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:43,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:43,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:43,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:43,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:43,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:43,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:43,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:43,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:43,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:43,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:43,520 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:43,921 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:54:43,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:43,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:43,922 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:54:43,922 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:54:43,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:54:44,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-03 15:54:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:44,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:44,097 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:44,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:44,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:44,098 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:44,098 INFO L423 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:44,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1536910700, now seen corresponding path program 206 times [2018-12-03 15:54:44,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:44,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:44,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:44,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:44,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:44,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:44,159 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:44,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:44,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:44,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:44,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:44,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:44,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:44,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:44,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:44,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:44,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:44,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:44,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:44,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:44,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:44,312 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:44,691 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:44,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:44,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:44,692 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:44,692 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:44,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 15:54:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:44,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:44,908 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:44,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:44,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:44,909 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:44,909 INFO L423 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:44,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1536912622, now seen corresponding path program 207 times [2018-12-03 15:54:44,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:44,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:44,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:44,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:44,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:44,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:44,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:44,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:44,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:44,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:44,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:44,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:44,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:44,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:44,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:44,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:44,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:45,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:45,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:45,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:45,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:45,095 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:45,471 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:45,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:45,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:45,472 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:45,472 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:45,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:54:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:45,662 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:45,662 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:45,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:45,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:45,663 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:45,663 INFO L423 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:45,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1536970282, now seen corresponding path program 208 times [2018-12-03 15:54:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:45,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:45,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:45,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:45,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:45,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:45,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:45,727 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:45,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:45,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:45,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:45,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:45,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:45,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:45,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:46,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:46,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:46,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:46,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:46,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:46,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:46,019 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:46,404 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:46,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:46,405 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:46,405 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:46,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 15:54:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:46,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:46,600 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:46,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:46,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:46,601 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:54:46,601 INFO L423 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:46,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1536972204, now seen corresponding path program 209 times [2018-12-03 15:54:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:46,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:46,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:46,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:46,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:46,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:46,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:46,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:46,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:46,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:46,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:46,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:46,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:46,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:46,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:46,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:46,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:46,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:46,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:46,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:46,803 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:47,159 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:54:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:47,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:47,160 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:54:47,160 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:54:47,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:54:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 13. [2018-12-03 15:54:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:54:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:54:47,286 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 10 [2018-12-03 15:54:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:47,287 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:54:47,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:54:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:47,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:47,287 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:47,287 INFO L423 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:47,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1106548632, now seen corresponding path program 210 times [2018-12-03 15:54:47,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:47,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:47,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:47,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:47,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:47,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:47,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:47,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:47,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:47,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:47,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:47,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:47,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:47,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:47,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:47,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:47,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:47,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:47,481 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 10 states. [2018-12-03 15:54:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:47,910 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:54:47,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:47,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:47,911 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:54:47,911 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:54:47,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:54:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:54:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:48,129 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:48,129 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:48,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:48,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:48,129 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:48,129 INFO L423 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:48,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1106546710, now seen corresponding path program 211 times [2018-12-03 15:54:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:48,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:48,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:48,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:48,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:48,272 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:48,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:48,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:48,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:48,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:48,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:48,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:48,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:48,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:48,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:48,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:48,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:48,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:48,388 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:48,796 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:48,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:48,797 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:48,797 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:48,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:54:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:49,002 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:49,002 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:49,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:49,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:49,003 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:49,003 INFO L423 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:49,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:49,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1106489050, now seen corresponding path program 212 times [2018-12-03 15:54:49,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:49,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:49,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:49,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:49,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:49,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:49,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:49,089 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:49,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:49,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:49,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:49,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:49,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:49,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:49,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:49,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:49,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:49,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:49,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:49,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:49,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:49,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:49,218 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:49,637 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:54:49,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:49,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:49,638 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:54:49,638 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:54:49,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:54:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:54:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:49,854 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:49,854 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:49,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:49,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:49,854 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:49,854 INFO L423 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:49,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1106487128, now seen corresponding path program 213 times [2018-12-03 15:54:49,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:49,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:49,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:49,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:49,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:49,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:49,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:49,914 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:49,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:49,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:49,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:49,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:49,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:49,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:49,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:49,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:49,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:50,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:50,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:50,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:50,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:50,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:50,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:50,153 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:50,567 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:50,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:50,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:50,568 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:50,568 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:50,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-12-03 15:54:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:50,783 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:50,783 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:50,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:50,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:50,783 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:50,783 INFO L423 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:50,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1104701590, now seen corresponding path program 214 times [2018-12-03 15:54:50,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:50,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:50,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:50,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:50,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:50,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:50,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:50,845 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:50,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:50,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:50,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:50,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:50,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:50,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:50,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:51,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:51,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:51,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:51,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:51,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:51,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:51,144 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:51,541 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:51,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:51,542 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:51,542 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:51,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 15:54:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:51,760 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:51,760 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:51,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:51,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:51,760 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:51,760 INFO L423 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:51,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1104699668, now seen corresponding path program 215 times [2018-12-03 15:54:51,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:51,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:51,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:51,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:51,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:51,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:51,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:51,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:51,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:51,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:51,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:51,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:51,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:51,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:51,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:51,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:51,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:51,959 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:51,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:51,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:51,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:51,960 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:52,363 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:52,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:52,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:52,364 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:52,364 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:52,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2018-12-03 15:54:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:52,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:52,575 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:52,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:52,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:52,576 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:52,576 INFO L423 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:52,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:52,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1104642008, now seen corresponding path program 216 times [2018-12-03 15:54:52,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:52,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:52,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:52,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:52,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:52,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:52,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:52,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:52,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:52,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:52,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:52,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:52,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:52,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:52,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:52,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:52,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:52,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:52,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:52,777 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:53,164 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:54:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:53,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:53,165 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:54:53,165 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:54:53,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:54:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 15:54:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:53,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:53,391 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:53,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:53,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:53,391 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:53,391 INFO L423 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:53,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1104640086, now seen corresponding path program 217 times [2018-12-03 15:54:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:53,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:53,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:53,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:53,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:53,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:53,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:53,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:53,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:53,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:53,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:53,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:53,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:53,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:53,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:53,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:53,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:53,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:53,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:53,577 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:53,935 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:54:53,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:53,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:53,936 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:54:53,936 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:54:53,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:54:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-12-03 15:54:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:54:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:54:54,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:54:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:54,111 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:54:54,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:54:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:54,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:54,112 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:54,112 INFO L423 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:54,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1049290330, now seen corresponding path program 218 times [2018-12-03 15:54:54,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:54,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:54,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:54,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:54,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:54,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:54,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:54,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:54,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:54,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:54,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:54,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:54,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:54,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:54,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:54,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:54,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:54,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:54,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:54,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:54,390 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:54:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:54,879 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:54:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:54,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:54,880 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:54:54,880 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:54:54,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:54:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:54:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:55,116 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:55,117 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:55,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:55,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:55,117 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:55,117 INFO L423 AbstractCegarLoop]: === Iteration 233 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:55,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1049288408, now seen corresponding path program 219 times [2018-12-03 15:54:55,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:55,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:55,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:55,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:55,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:55,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:55,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:55,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:55,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:55,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:55,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:55,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:55,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:55,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:55,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:55,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:55,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:55,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:55,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:55,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:55,302 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:55,779 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:55,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:55,779 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:55,779 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:55,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 15:54:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:56,009 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:56,009 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:56,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:56,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:56,010 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:56,010 INFO L423 AbstractCegarLoop]: === Iteration 234 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:56,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:56,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1049230748, now seen corresponding path program 220 times [2018-12-03 15:54:56,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:56,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:56,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:56,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:56,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:56,120 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:56,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:56,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:56,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:56,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:56,130 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:56,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:56,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:56,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:56,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:56,436 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:56,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:56,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:56,436 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:54:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:56,870 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:54:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:56,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:56,871 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:54:56,871 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:54:56,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:54:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:54:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:57,089 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:57,089 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:57,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:57,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:57,090 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:57,090 INFO L423 AbstractCegarLoop]: === Iteration 235 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:57,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:57,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1049228826, now seen corresponding path program 221 times [2018-12-03 15:54:57,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:57,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:57,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:57,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:57,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:57,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:57,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:57,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:57,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:57,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:57,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:57,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:57,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:57,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:57,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:57,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:57,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:57,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:57,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:57,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:57,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:57,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:57,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:57,281 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:57,686 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:54:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:57,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:57,687 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:54:57,687 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:54:57,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:54:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-12-03 15:54:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:54:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:54:57,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:54:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:57,887 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:54:57,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:54:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:57,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:57,887 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:54:57,887 INFO L423 AbstractCegarLoop]: === Iteration 236 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:57,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1047443288, now seen corresponding path program 222 times [2018-12-03 15:54:57,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:57,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:57,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:57,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:57,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:57,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:57,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:57,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:57,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:57,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:57,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:57,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:57,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:57,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:58,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:58,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:58,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:58,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:58,117 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:54:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:58,531 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:58,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:58,532 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:58,532 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:58,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 15:54:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:54:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:54:58,749 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:54:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:58,750 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:54:58,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:54:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:58,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:58,750 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:58,750 INFO L423 AbstractCegarLoop]: === Iteration 237 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:58,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1047441366, now seen corresponding path program 223 times [2018-12-03 15:54:58,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:58,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:58,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:58,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:58,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:58,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:58,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:58,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:58,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:58,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:58,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:58,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:58,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:58,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:58,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:58,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:58,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:58,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:58,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:58,933 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:54:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:59,311 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:54:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:54:59,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:54:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:59,312 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:54:59,312 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:54:59,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:54:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2018-12-03 15:54:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:54:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:54:59,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:54:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:59,524 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:54:59,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:54:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:54:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:54:59,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:59,524 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:54:59,524 INFO L423 AbstractCegarLoop]: === Iteration 238 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:59,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1047383706, now seen corresponding path program 224 times [2018-12-03 15:54:59,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:59,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:59,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:59,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:59,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:59,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:59,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:59,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:59,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:59,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:59,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:59,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:59,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:59,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:54:59,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:59,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:59,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:59,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:59,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:54:59,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:59,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:54:59,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:54:59,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:54:59,720 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:55:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:00,108 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:55:00,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:00,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:00,109 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:55:00,109 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:55:00,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:55:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 15:55:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:00,336 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:00,337 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:00,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:00,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:00,337 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:55:00,337 INFO L423 AbstractCegarLoop]: === Iteration 239 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:00,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1047381784, now seen corresponding path program 225 times [2018-12-03 15:55:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:00,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:00,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:00,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:00,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:00,415 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:00,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:00,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:00,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:00,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:00,423 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:00,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:00,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:00,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:00,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:00,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:00,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:00,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:00,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:00,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:00,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:00,527 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:00,894 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:55:00,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:00,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:00,895 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:55:00,895 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:55:00,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:55:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2018-12-03 15:55:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:55:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:55:01,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 15:55:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:01,053 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:55:01,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:55:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:01,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:01,053 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:55:01,053 INFO L423 AbstractCegarLoop]: === Iteration 240 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:01,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash 668458730, now seen corresponding path program 226 times [2018-12-03 15:55:01,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:01,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:01,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:01,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:01,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:01,224 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:01,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:01,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:01,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:01,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:01,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:01,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:01,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:01,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:01,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:01,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:01,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:01,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:01,520 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 15:55:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:01,899 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:55:01,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:01,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:01,900 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:55:01,900 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:55:01,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:55:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 15:55:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:02,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:02,126 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:02,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:02,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:02,127 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:55:02,127 INFO L423 AbstractCegarLoop]: === Iteration 241 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:02,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash 668460652, now seen corresponding path program 227 times [2018-12-03 15:55:02,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:02,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:02,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:02,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:02,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:02,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:02,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:02,187 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:02,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:02,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:02,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:02,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:02,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:02,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:02,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:02,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:02,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:02,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:02,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:02,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:02,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:02,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:02,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:02,337 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:02,713 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:55:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:02,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:02,714 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:55:02,714 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:55:02,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:55:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 15:55:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:02,958 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:55:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:02,958 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:02,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:02,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:02,959 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:55:02,959 INFO L423 AbstractCegarLoop]: === Iteration 242 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:02,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 668518312, now seen corresponding path program 228 times [2018-12-03 15:55:02,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:02,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:02,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:02,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:02,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:03,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:03,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:03,017 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:03,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:03,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:03,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:03,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:03,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:03,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:03,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:03,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:03,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:03,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:03,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:03,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:03,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:03,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:03,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:03,144 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:55:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:03,540 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:55:03,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:03,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:03,541 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:55:03,541 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:55:03,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:55:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-12-03 15:55:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:03,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:03,786 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:03,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:03,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:03,787 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:55:03,787 INFO L423 AbstractCegarLoop]: === Iteration 243 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:03,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash 668520234, now seen corresponding path program 229 times [2018-12-03 15:55:03,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:03,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:03,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:03,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:03,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:03,851 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:03,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:03,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:03,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:03,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:03,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:03,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:03,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:03,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:03,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:03,991 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:03,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:03,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:03,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:03,992 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:04,389 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:55:04,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:04,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:04,389 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:55:04,389 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:55:04,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:55:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 15:55:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:55:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:55:04,603 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:55:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:04,604 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:55:04,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:55:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:04,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:04,604 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:55:04,604 INFO L423 AbstractCegarLoop]: === Iteration 244 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:04,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:04,604 INFO L82 PathProgramCache]: Analyzing trace with hash 670305772, now seen corresponding path program 230 times [2018-12-03 15:55:04,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:04,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:04,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:04,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:04,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:04,668 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:04,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:04,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:04,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:04,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:04,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:04,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:04,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:04,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:04,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:04,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:04,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:04,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:04,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:04,809 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:55:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:05,216 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:55:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:05,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:05,217 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:55:05,217 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:55:05,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:55:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 15:55:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:05,442 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:05,442 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:05,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:05,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:05,443 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:55:05,443 INFO L423 AbstractCegarLoop]: === Iteration 245 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:05,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:05,443 INFO L82 PathProgramCache]: Analyzing trace with hash 670307694, now seen corresponding path program 231 times [2018-12-03 15:55:05,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:05,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:05,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:05,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:05,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:05,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:05,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:05,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:05,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:05,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:05,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:05,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:05,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:05,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:05,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:05,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:05,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:05,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:05,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:05,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:05,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:05,626 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:06,010 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:55:06,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:06,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:06,011 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:55:06,011 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:55:06,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:55:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 15:55:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:06,248 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:55:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:06,248 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:06,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:06,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:06,249 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:55:06,249 INFO L423 AbstractCegarLoop]: === Iteration 246 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:06,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:06,249 INFO L82 PathProgramCache]: Analyzing trace with hash 670365354, now seen corresponding path program 232 times [2018-12-03 15:55:06,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:06,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:06,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:06,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:06,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:06,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:06,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:06,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:06,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:06,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:06,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:06,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:06,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:06,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:06,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:06,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:06,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:06,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:06,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:06,701 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:55:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:07,081 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:55:07,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:07,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:07,082 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:55:07,082 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:55:07,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:55:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-12-03 15:55:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:07,310 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:07,310 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:07,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:07,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:07,310 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:55:07,310 INFO L423 AbstractCegarLoop]: === Iteration 247 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:07,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash 670367276, now seen corresponding path program 233 times [2018-12-03 15:55:07,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:07,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:07,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:07,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:07,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:07,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:07,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:07,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:07,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:07,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:07,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:07,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:07,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:07,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:07,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:07,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:07,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:07,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:07,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:07,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:07,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:07,509 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:07,863 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:55:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:07,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:07,864 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:55:07,864 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:55:07,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:55:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-12-03 15:55:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:55:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:55:08,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 15:55:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:08,056 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:55:08,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:55:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:08,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:08,057 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 15:55:08,057 INFO L423 AbstractCegarLoop]: === Iteration 248 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:08,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 725717032, now seen corresponding path program 234 times [2018-12-03 15:55:08,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:08,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:08,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:08,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:08,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:08,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:08,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:08,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:08,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:08,129 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:08,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:08,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:08,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:08,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:08,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:08,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:08,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:08,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:08,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:08,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:08,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:08,241 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 15:55:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:08,614 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:55:08,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:08,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:08,615 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:55:08,615 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:55:08,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:55:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 15:55:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:08,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:08,852 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:08,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:08,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:08,852 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:55:08,852 INFO L423 AbstractCegarLoop]: === Iteration 249 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:08,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash 725718954, now seen corresponding path program 235 times [2018-12-03 15:55:08,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:08,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:08,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:08,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:08,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:08,915 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:08,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:08,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:08,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:08,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:08,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:08,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:08,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:09,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:09,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:09,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:09,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:09,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:09,059 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:09,399 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:55:09,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:09,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:09,400 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:55:09,400 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:55:09,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:55:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 15:55:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:09,660 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:55:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:09,660 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:09,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:09,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:09,660 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:55:09,660 INFO L423 AbstractCegarLoop]: === Iteration 250 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:09,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:09,661 INFO L82 PathProgramCache]: Analyzing trace with hash 725776614, now seen corresponding path program 236 times [2018-12-03 15:55:09,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:09,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:09,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:09,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:09,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:09,724 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:09,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:09,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:09,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:09,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:09,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:09,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:09,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:09,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:09,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:09,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:09,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:09,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:09,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:09,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:09,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:09,865 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:55:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:10,216 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:55:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:10,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:10,217 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:55:10,217 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:55:10,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:55:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 15:55:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:10,449 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:10,449 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:10,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:10,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:10,450 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:55:10,450 INFO L423 AbstractCegarLoop]: === Iteration 251 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:10,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash 725778536, now seen corresponding path program 237 times [2018-12-03 15:55:10,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:10,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:10,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:10,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:10,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:10,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:10,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:10,556 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:10,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:10,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:10,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:10,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:10,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:10,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:10,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:10,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:10,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:10,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:10,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:10,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:10,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:10,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:10,690 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:11,037 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:55:11,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:11,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:11,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:11,038 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:55:11,038 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:55:11,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:55:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-12-03 15:55:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:55:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:55:11,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 15:55:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:11,246 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:55:11,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:55:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:11,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:11,247 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 15:55:11,247 INFO L423 AbstractCegarLoop]: === Iteration 252 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:11,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 727564074, now seen corresponding path program 238 times [2018-12-03 15:55:11,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:11,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:11,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:11,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:11,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:11,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:11,314 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:11,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:11,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:11,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:11,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:11,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:11,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:11,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:11,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:11,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:11,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:11,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:11,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:11,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:11,665 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 15:55:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:11,986 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:55:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:11,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:11,987 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:55:11,987 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:55:11,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:55:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-12-03 15:55:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:12,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:12,232 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:12,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:12,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:12,233 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:55:12,233 INFO L423 AbstractCegarLoop]: === Iteration 253 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:12,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:12,233 INFO L82 PathProgramCache]: Analyzing trace with hash 727565996, now seen corresponding path program 239 times [2018-12-03 15:55:12,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:12,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:12,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:12,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:12,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:12,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:12,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:12,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:12,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:12,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:12,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:12,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:12,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:12,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:12,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:12,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:12,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:12,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:12,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:12,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:12,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:12,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:12,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:12,431 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:12,755 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:55:12,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:12,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:12,756 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:55:12,756 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:55:12,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:55:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-12-03 15:55:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:12,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 15:55:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:12,995 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:12,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:12,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:12,995 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 15:55:12,995 INFO L423 AbstractCegarLoop]: === Iteration 254 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:12,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 727623656, now seen corresponding path program 240 times [2018-12-03 15:55:12,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:12,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:12,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:12,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:13,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:13,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:13,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:13,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:13,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:13,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:13,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:13,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:13,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:13,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:13,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:13,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:13,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:13,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:13,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:13,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:13,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:13,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:13,184 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 15:55:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:13,510 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:55:13,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:13,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:13,511 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:55:13,511 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:55:13,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:55:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-12-03 15:55:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:13,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 15:55:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:13,747 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:13,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:55:13,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:13,748 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:55:13,748 INFO L423 AbstractCegarLoop]: === Iteration 255 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:13,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash 727625578, now seen corresponding path program 7 times [2018-12-03 15:55:13,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:13,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:13,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:13,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:13,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:13,815 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:13,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:13,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:13,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:13,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:13,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:13,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:13,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:13,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:13,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:55:13,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:13,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:55:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:55:13,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:13,954 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 15:55:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:14,233 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 15:55:14,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:55:14,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:55:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:14,234 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:55:14,234 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:55:14,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:55:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:55:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-12-03 15:55:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:55:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 15:55:14,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 10 [2018-12-03 15:55:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:14,383 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 15:55:14,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:55:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 15:55:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:14,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:14,384 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:55:14,384 INFO L423 AbstractCegarLoop]: === Iteration 256 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:14,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:14,385 INFO L82 PathProgramCache]: Analyzing trace with hash -230307328, now seen corresponding path program 8 times [2018-12-03 15:55:14,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:14,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:14,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:14,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:14,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:14,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:14,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:14,470 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:14,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:14,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:14,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:14,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:14,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:14,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:14,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:14,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:14,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:15,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:15,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:15,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:15,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:15,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:15,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:15,567 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 11 states. [2018-12-03 15:55:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:16,183 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:55:16,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:16,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:16,185 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:55:16,185 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:55:16,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:55:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 15:55:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:16,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:16,478 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:16,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:16,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:16,479 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:55:16,479 INFO L423 AbstractCegarLoop]: === Iteration 257 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:16,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash -230305406, now seen corresponding path program 241 times [2018-12-03 15:55:16,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:16,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:16,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:16,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:16,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:16,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:16,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:16,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:16,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:16,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:16,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:16,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:16,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:16,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:16,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:16,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:16,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:16,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:16,847 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:17,457 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:55:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:17,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:17,458 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:55:17,458 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:55:17,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:55:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:55:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:17,735 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:17,735 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:17,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:17,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:17,736 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:55:17,736 INFO L423 AbstractCegarLoop]: === Iteration 258 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:17,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash -230247746, now seen corresponding path program 242 times [2018-12-03 15:55:17,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:17,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:17,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:17,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:17,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:17,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:17,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:17,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:17,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:17,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:17,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:17,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:17,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:17,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:17,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:18,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:18,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:18,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:18,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:18,102 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:18,704 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:55:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:18,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:18,705 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:55:18,705 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:55:18,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:55:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:55:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:18,999 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:18,999 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:18,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:19,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:19,000 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:19,000 INFO L423 AbstractCegarLoop]: === Iteration 259 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:19,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -230245824, now seen corresponding path program 243 times [2018-12-03 15:55:19,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:19,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:19,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:19,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:19,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:19,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:19,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:19,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:19,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:19,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:19,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:19,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:19,078 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:19,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:19,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:19,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:19,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:19,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:19,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:19,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:19,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:19,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:19,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:19,226 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:19,790 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:55:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:19,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:19,791 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:55:19,791 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:55:19,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:55:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-12-03 15:55:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:20,061 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:55:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:20,061 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:20,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:20,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:20,062 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:55:20,062 INFO L423 AbstractCegarLoop]: === Iteration 260 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:20,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -228460286, now seen corresponding path program 244 times [2018-12-03 15:55:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:20,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:20,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:20,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:20,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:20,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:20,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:20,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:20,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:20,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:20,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:20,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:20,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:20,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:20,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:20,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:20,280 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:55:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:20,885 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:55:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:20,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:20,886 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:55:20,886 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:55:20,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:55:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 15:55:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:21,172 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:21,172 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:21,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:21,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:21,172 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:21,172 INFO L423 AbstractCegarLoop]: === Iteration 261 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:21,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:21,173 INFO L82 PathProgramCache]: Analyzing trace with hash -228458364, now seen corresponding path program 245 times [2018-12-03 15:55:21,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:21,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:21,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:21,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:21,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:21,243 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:21,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:21,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:21,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:21,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:21,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:21,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:21,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:21,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:21,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:21,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:21,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:21,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:21,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:21,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:21,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:21,405 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:22,010 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:55:22,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:22,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:22,011 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:55:22,011 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:55:22,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:55:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:55:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:22,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:22,296 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:22,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:22,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:22,296 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:22,296 INFO L423 AbstractCegarLoop]: === Iteration 262 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:22,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash -228400704, now seen corresponding path program 246 times [2018-12-03 15:55:22,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:22,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:22,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:22,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:22,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:22,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:22,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:22,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:22,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:22,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:22,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:22,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:22,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:22,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:22,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:22,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:22,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:22,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:22,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:22,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:22,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:22,513 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:23,096 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:55:23,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:23,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:23,097 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:55:23,097 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:55:23,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:55:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:55:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:23,397 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:23,397 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:23,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:23,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:23,397 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:23,398 INFO L423 AbstractCegarLoop]: === Iteration 263 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:23,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -228398782, now seen corresponding path program 247 times [2018-12-03 15:55:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:23,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:23,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:23,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:23,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:23,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:23,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:23,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:23,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:23,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:23,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:23,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:23,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:23,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:23,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:23,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:23,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:23,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:23,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:23,713 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:24,289 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:55:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:24,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:24,290 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:55:24,290 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:55:24,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:55:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-12-03 15:55:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:55:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:55:24,534 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:55:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:24,534 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:55:24,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:55:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:24,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:24,534 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:55:24,535 INFO L423 AbstractCegarLoop]: === Iteration 264 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:24,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash -173049026, now seen corresponding path program 248 times [2018-12-03 15:55:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:24,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:24,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:24,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:24,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:24,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:24,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:24,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:24,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:24,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:24,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:24,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:24,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:24,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:24,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:24,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:24,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:24,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:24,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:24,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:24,770 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:55:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:25,337 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:55:25,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:25,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:25,338 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:55:25,338 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:55:25,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:55:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:55:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:25,627 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:25,627 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:25,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:25,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:25,627 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:25,628 INFO L423 AbstractCegarLoop]: === Iteration 265 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:25,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash -173047104, now seen corresponding path program 249 times [2018-12-03 15:55:25,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:25,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:25,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:25,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:25,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:25,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:25,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:25,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:25,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:25,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:25,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:25,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:25,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:25,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:25,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:25,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:25,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:25,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:25,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:25,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:25,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:25,839 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:26,427 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:55:26,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:26,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:26,428 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:55:26,428 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:55:26,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:55:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 15:55:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:26,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:26,724 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:26,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:26,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:26,725 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:26,725 INFO L423 AbstractCegarLoop]: === Iteration 266 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:26,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -172989444, now seen corresponding path program 250 times [2018-12-03 15:55:26,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:26,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:26,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:26,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:26,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:26,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:26,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:26,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:26,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:26,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:26,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:26,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:26,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:26,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:27,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:27,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:27,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:27,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:27,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:27,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:27,145 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:27,735 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:55:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:27,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:27,735 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:55:27,736 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:55:27,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:55:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:55:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:28,039 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:28,039 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:28,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:28,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:28,040 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:28,040 INFO L423 AbstractCegarLoop]: === Iteration 267 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:28,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -172987522, now seen corresponding path program 251 times [2018-12-03 15:55:28,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:28,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:28,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:28,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:28,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:28,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:28,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:28,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:28,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:28,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:28,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:28,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:28,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:28,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:28,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:28,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:28,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:28,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:28,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:28,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:28,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:28,251 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:28,812 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:55:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:28,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:28,813 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:55:28,813 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:55:28,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:55:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-12-03 15:55:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:29,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:55:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:29,088 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:29,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:29,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:29,088 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:29,089 INFO L423 AbstractCegarLoop]: === Iteration 268 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:29,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:29,089 INFO L82 PathProgramCache]: Analyzing trace with hash -171201984, now seen corresponding path program 252 times [2018-12-03 15:55:29,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:29,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:29,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:29,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:29,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:29,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:29,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:29,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:29,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:29,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:29,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:29,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:29,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:29,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:29,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:29,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:29,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:29,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:29,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:29,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:29,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:29,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:29,303 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:55:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:29,837 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:55:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:29,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:29,838 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:55:29,838 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:55:29,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:55:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 15:55:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:30,145 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:30,145 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:30,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:30,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:30,145 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:30,146 INFO L423 AbstractCegarLoop]: === Iteration 269 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:30,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -171200062, now seen corresponding path program 253 times [2018-12-03 15:55:30,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:30,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:30,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:30,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:30,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:30,219 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:30,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:30,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:30,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:30,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:30,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:30,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:30,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:30,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:30,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:30,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:30,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:30,355 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:30,910 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:55:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:30,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:30,910 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:55:30,911 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:55:30,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:55:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:55:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:31,195 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:31,195 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:31,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:31,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:31,195 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:31,195 INFO L423 AbstractCegarLoop]: === Iteration 270 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:31,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash -171142402, now seen corresponding path program 254 times [2018-12-03 15:55:31,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:31,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:31,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:31,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:31,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:31,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:31,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:31,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:31,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:31,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:31,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:31,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:31,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:31,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:31,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:31,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:31,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:31,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:31,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:31,403 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:31,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:31,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:31,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:31,403 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:31,921 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:55:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:31,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:31,921 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:55:31,921 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:55:31,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:55:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:55:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:32,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:32,212 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:32,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:32,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:32,212 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:55:32,212 INFO L423 AbstractCegarLoop]: === Iteration 271 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:32,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:32,212 INFO L82 PathProgramCache]: Analyzing trace with hash -171140480, now seen corresponding path program 255 times [2018-12-03 15:55:32,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:32,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:32,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:32,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:32,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:32,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:32,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:32,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:32,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:32,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:32,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:32,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:32,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:32,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:32,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:32,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:32,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:32,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:32,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:32,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:32,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:32,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:32,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:32,442 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:32,948 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:55:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:32,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:32,948 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:55:32,948 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:55:32,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:55:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 15:55:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:55:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:55:33,165 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 15:55:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:33,165 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:55:33,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:55:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:33,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:33,166 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:55:33,166 INFO L423 AbstractCegarLoop]: === Iteration 272 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:33,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1544700034, now seen corresponding path program 256 times [2018-12-03 15:55:33,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:33,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:33,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:33,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:33,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:33,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:33,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:33,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:33,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:33,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:33,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:33,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:33,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:33,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:33,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:33,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:33,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:33,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:33,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:33,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:33,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:33,407 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 15:55:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:34,078 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:55:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:34,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:34,079 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:55:34,079 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:55:34,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:55:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 15:55:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:34,391 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:34,391 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:34,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:34,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:34,392 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:34,392 INFO L423 AbstractCegarLoop]: === Iteration 273 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:34,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1544701956, now seen corresponding path program 257 times [2018-12-03 15:55:34,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:34,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:34,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:34,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:34,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:34,461 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:34,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:34,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:34,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:34,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:34,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:34,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:34,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:34,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:34,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:34,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:34,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:34,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:34,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:34,604 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:35,259 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:55:35,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:35,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:35,259 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:55:35,260 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:55:35,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:55:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:55:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:35,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:35,572 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:35,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:35,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:35,572 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:35,572 INFO L423 AbstractCegarLoop]: === Iteration 274 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:35,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1544759616, now seen corresponding path program 258 times [2018-12-03 15:55:35,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:35,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:35,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:35,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:35,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:35,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:35,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:35,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:35,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:35,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:35,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:35,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:35,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:35,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:35,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:35,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:35,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:35,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:35,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:35,804 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:36,417 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:55:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:36,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:36,417 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:55:36,418 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:55:36,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:55:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:55:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:36,719 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:36,719 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:36,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:36,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:36,720 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:36,720 INFO L423 AbstractCegarLoop]: === Iteration 275 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:36,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1544761538, now seen corresponding path program 259 times [2018-12-03 15:55:36,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:36,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:36,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:36,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:36,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:36,789 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:36,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:36,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:36,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:36,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:36,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:36,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:36,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:36,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:36,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:36,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:36,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:36,927 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:37,535 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:55:37,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:37,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:37,536 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:55:37,536 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:55:37,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:55:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-12-03 15:55:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:37,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:55:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:37,809 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:37,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:37,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:37,809 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:37,810 INFO L423 AbstractCegarLoop]: === Iteration 276 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:37,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1546547076, now seen corresponding path program 260 times [2018-12-03 15:55:37,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:37,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:37,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:37,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:37,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:37,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:37,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:37,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:37,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:37,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:37,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:37,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:37,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:37,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:37,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:38,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:38,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:38,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:38,074 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:55:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:38,739 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:55:38,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:38,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:38,740 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:55:38,740 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:55:38,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:55:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 15:55:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:39,038 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:39,038 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:39,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:39,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:39,038 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:39,038 INFO L423 AbstractCegarLoop]: === Iteration 277 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:39,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1546548998, now seen corresponding path program 261 times [2018-12-03 15:55:39,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:39,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:39,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:39,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:39,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:39,106 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:39,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:39,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:39,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:39,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:39,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:39,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:39,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:39,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:39,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:39,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:39,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:39,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:39,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:39,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:39,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:39,266 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:39,925 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:55:39,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:39,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:39,926 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:55:39,926 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:55:39,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:55:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:55:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:40,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:40,221 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:40,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:40,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:40,221 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:40,221 INFO L423 AbstractCegarLoop]: === Iteration 278 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:40,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1546606658, now seen corresponding path program 262 times [2018-12-03 15:55:40,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:40,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:40,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:40,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:40,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:40,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:40,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:40,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:40,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:40,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:40,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:40,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:40,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:40,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:40,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:40,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:40,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:40,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:40,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:40,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:40,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:40,525 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:41,170 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:55:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:41,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:41,171 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:55:41,171 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:55:41,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:55:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:55:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:41,479 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:41,479 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:41,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:41,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:41,479 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:55:41,479 INFO L423 AbstractCegarLoop]: === Iteration 279 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:41,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1546608580, now seen corresponding path program 263 times [2018-12-03 15:55:41,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:41,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:41,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:41,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:41,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:41,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:41,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:41,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:41,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:41,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:41,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:41,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:41,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:41,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:41,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:41,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:41,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:41,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:41,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:41,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:41,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:41,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:41,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:41,708 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:42,302 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:55:42,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:42,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:42,303 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:55:42,303 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:55:42,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:55:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-12-03 15:55:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:55:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:55:42,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:55:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:42,560 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:55:42,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:55:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:42,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:42,560 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:42,560 INFO L423 AbstractCegarLoop]: === Iteration 280 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:42,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1601958336, now seen corresponding path program 264 times [2018-12-03 15:55:42,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:42,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:42,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:42,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:42,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:42,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:42,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:42,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:42,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:42,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:42,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:42,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:42,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:42,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:42,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:42,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:42,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:42,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:42,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:42,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:42,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:42,793 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:55:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:43,396 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:55:43,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:43,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:43,397 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:55:43,397 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:55:43,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:55:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:55:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:43,736 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:43,736 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:43,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:43,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:43,737 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:43,737 INFO L423 AbstractCegarLoop]: === Iteration 281 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:43,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:43,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1601960258, now seen corresponding path program 265 times [2018-12-03 15:55:43,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:43,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:43,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:43,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:43,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:43,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:43,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:43,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:43,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:43,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:43,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:43,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:43,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:43,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:43,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:43,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:43,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:43,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:43,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:43,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:43,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:43,967 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:44,549 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:55:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:44,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:44,549 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:55:44,550 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:55:44,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:55:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 15:55:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:44,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:44,878 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:44,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:44,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:44,879 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:44,879 INFO L423 AbstractCegarLoop]: === Iteration 282 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:44,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:44,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1602017918, now seen corresponding path program 266 times [2018-12-03 15:55:44,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:44,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:44,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:44,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:44,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:44,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:44,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:44,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:44,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:44,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:44,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:44,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:44,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:44,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:44,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:44,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:44,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:45,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:45,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:45,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:45,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:45,092 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:45,718 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:55:45,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:45,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:45,719 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:55:45,719 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:55:45,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:55:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:55:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:46,024 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:46,024 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:46,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:46,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:46,024 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:55:46,025 INFO L423 AbstractCegarLoop]: === Iteration 283 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:46,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:46,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1602019840, now seen corresponding path program 267 times [2018-12-03 15:55:46,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:46,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:46,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:46,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:46,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:46,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:46,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:46,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:46,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:46,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:46,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:46,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:46,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:46,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:46,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:46,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:46,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:46,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:46,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:46,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:46,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:46,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:46,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:46,261 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:46,867 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:55:46,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:46,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:46,868 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:55:46,868 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:55:46,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:55:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-12-03 15:55:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:47,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:55:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:47,150 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:47,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:47,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:47,150 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:47,150 INFO L423 AbstractCegarLoop]: === Iteration 284 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:47,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1603805378, now seen corresponding path program 268 times [2018-12-03 15:55:47,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:47,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:47,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:47,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:47,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:47,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:47,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:47,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:47,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:47,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:47,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:47,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:47,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:47,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:47,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:47,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:47,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:47,643 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:55:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:48,201 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:55:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:48,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:48,202 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:55:48,202 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:55:48,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:55:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 15:55:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:48,507 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:48,508 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:48,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:48,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:48,508 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:55:48,508 INFO L423 AbstractCegarLoop]: === Iteration 285 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:48,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:48,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1603807300, now seen corresponding path program 269 times [2018-12-03 15:55:48,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:48,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:48,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:48,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:48,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:48,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:48,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:48,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:48,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:48,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:48,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:49,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:49,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:49,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:49,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:49,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:49,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:49,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:49,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:49,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:49,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:49,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:49,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:49,139 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:49,697 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:55:49,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:49,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:49,698 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:55:49,698 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:55:49,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:55:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:55:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:50,046 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:50,046 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:50,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:50,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:50,047 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:55:50,047 INFO L423 AbstractCegarLoop]: === Iteration 286 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:50,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1603864960, now seen corresponding path program 270 times [2018-12-03 15:55:50,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:50,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:50,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:50,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:50,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:50,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:50,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:50,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:50,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:50,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:50,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:50,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:50,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:50,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:50,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:50,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:50,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:50,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:50,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:50,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:50,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:50,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:50,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:50,255 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:50,787 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:55:50,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:50,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:50,788 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:55:50,788 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:55:50,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:55:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:55:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:51,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:51,088 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:51,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:51,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:51,089 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:51,089 INFO L423 AbstractCegarLoop]: === Iteration 287 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:51,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:51,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1603866882, now seen corresponding path program 271 times [2018-12-03 15:55:51,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:51,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:51,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:51,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:51,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:51,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:51,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:51,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:51,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:51,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:51,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:51,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:51,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:51,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:51,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:51,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:51,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:51,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:51,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:51,305 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:51,822 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:55:51,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:51,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:51,823 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:55:51,823 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:55:51,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:55:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2018-12-03 15:55:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:55:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:55:52,025 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 11 [2018-12-03 15:55:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:52,025 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:55:52,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:55:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:52,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:52,025 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:55:52,025 INFO L423 AbstractCegarLoop]: === Iteration 288 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:52,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1039653954, now seen corresponding path program 272 times [2018-12-03 15:55:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:52,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:52,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:52,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:52,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:52,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:52,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:52,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:52,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:52,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:52,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:52,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:52,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:52,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:52,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:52,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:52,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:52,245 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:52,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:52,245 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 11 states. [2018-12-03 15:55:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:52,846 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:55:52,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:52,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:52,847 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:55:52,847 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:55:52,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:55:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 15:55:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:53,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:53,171 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:53,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:53,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:53,172 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:53,172 INFO L423 AbstractCegarLoop]: === Iteration 289 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:53,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1039652032, now seen corresponding path program 273 times [2018-12-03 15:55:53,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:53,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:53,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:53,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:53,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:53,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:53,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:53,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:53,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:53,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:53,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:53,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:53,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:53,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:53,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:53,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:53,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:53,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:53,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:53,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:53,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:53,388 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:53,973 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:55:53,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:53,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:53,974 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:55:53,974 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:55:53,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:55:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:55:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:54,299 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:54,299 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:54,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:54,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:54,300 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:54,300 INFO L423 AbstractCegarLoop]: === Iteration 290 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:54,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1039594372, now seen corresponding path program 274 times [2018-12-03 15:55:54,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:54,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:54,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:54,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:54,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:54,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:54,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:54,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:54,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:54,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:54,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:54,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:54,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:54,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:54,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:54,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:54,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:54,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:54,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:54,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:54,529 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:55,148 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:55:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:55,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:55,149 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:55:55,149 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:55:55,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:55:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 15:55:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:55,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:55,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:55,470 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:55,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:55,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:55,471 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:55,471 INFO L423 AbstractCegarLoop]: === Iteration 291 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:55,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1039592450, now seen corresponding path program 275 times [2018-12-03 15:55:55,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:55,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:55,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:55,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:55,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:55,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:55,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:55,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:55,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:55,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:55,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:55,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:55,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:55,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:55,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:55,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:55,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:55,696 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:55,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:55,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:55,697 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:56,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:56,304 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:55:56,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:56,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:56,305 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:55:56,305 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:55:56,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:55:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 15:55:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:55:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:55:56,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:55:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:56,610 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:55:56,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:55:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:56,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:56,610 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:55:56,610 INFO L423 AbstractCegarLoop]: === Iteration 292 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:56,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1037806912, now seen corresponding path program 276 times [2018-12-03 15:55:56,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:56,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:56,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:56,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:56,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:56,676 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:56,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:56,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:56,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:56,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:56,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:56,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:56,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:56,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:56,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:56,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:56,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:56,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:56,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:56,848 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:55:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:57,418 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:55:57,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:57,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:57,419 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:55:57,419 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:55:57,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:55:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:55:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:55:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:55:57,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:55:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:57,759 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:55:57,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:55:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:57,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:57,759 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:57,759 INFO L423 AbstractCegarLoop]: === Iteration 293 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:57,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1037804990, now seen corresponding path program 277 times [2018-12-03 15:55:57,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:57,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:57,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:57,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:57,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:57,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:57,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:57,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:57,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:57,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:57,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:57,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:58,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:58,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:58,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:58,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:58,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:58,085 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:55:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:58,660 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:55:58,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:58,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:58,661 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:55:58,661 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:55:58,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:55:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 15:55:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:55:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:55:58,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:55:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:58,996 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:55:58,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:55:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:55:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:55:58,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:58,996 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:55:58,997 INFO L423 AbstractCegarLoop]: === Iteration 294 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:58,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:58,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1037747330, now seen corresponding path program 278 times [2018-12-03 15:55:58,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:58,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:58,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:58,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:58,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:59,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:59,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:59,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:59,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:59,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:59,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:59,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:59,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:55:59,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:59,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:59,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:55:59,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:59,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:55:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:55:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:59,223 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:55:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:59,775 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:55:59,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:55:59,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:55:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:59,776 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:55:59,776 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:55:59,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:55:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 15:56:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:00,099 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:00,099 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:00,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:00,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:00,099 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:00,099 INFO L423 AbstractCegarLoop]: === Iteration 295 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:00,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1037745408, now seen corresponding path program 279 times [2018-12-03 15:56:00,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:00,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:00,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:00,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:00,168 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:00,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:00,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:00,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:00,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:00,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:00,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:00,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:00,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:00,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:00,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:00,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:00,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:00,327 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:00,865 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:56:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:00,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:00,866 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:56:00,866 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:56:00,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:56:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 15:56:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:56:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:56:01,138 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:56:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:01,138 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:56:01,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:56:01,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:01,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:01,139 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:56:01,139 INFO L423 AbstractCegarLoop]: === Iteration 296 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:01,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:01,139 INFO L82 PathProgramCache]: Analyzing trace with hash -982395652, now seen corresponding path program 280 times [2018-12-03 15:56:01,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:01,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:01,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:01,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:01,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:01,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:01,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:01,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:01,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:01,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:01,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:01,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:01,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:01,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:01,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:01,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:01,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:01,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:01,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:01,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:01,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:01,361 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:56:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:01,995 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:56:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:01,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:01,995 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:56:01,996 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:56:01,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:56:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 15:56:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:02,322 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:02,322 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:02,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:02,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:02,323 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:02,323 INFO L423 AbstractCegarLoop]: === Iteration 297 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:02,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash -982393730, now seen corresponding path program 281 times [2018-12-03 15:56:02,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:02,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:02,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:02,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:02,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:02,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:02,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:02,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:02,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:02,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:02,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:02,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:02,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:02,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:02,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:02,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:02,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:02,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:02,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:02,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:02,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:02,574 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:03,162 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:56:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:03,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:03,163 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:56:03,163 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:56:03,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:56:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:56:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:03,494 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:03,495 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:03,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:03,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:03,495 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:03,495 INFO L423 AbstractCegarLoop]: === Iteration 298 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:03,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash -982336070, now seen corresponding path program 282 times [2018-12-03 15:56:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:03,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:03,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:03,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:03,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:03,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:03,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:03,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:03,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:03,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:03,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:03,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:03,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:03,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:03,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:04,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:04,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:04,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:04,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:04,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:04,363 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:04,989 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:56:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:04,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:04,990 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:56:04,990 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:56:04,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:56:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 15:56:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:05,356 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:05,356 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:05,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:05,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:05,356 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:05,356 INFO L423 AbstractCegarLoop]: === Iteration 299 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:05,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash -982334148, now seen corresponding path program 283 times [2018-12-03 15:56:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:05,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:05,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:05,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:05,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:05,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:05,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:05,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:05,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:05,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:05,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:05,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:05,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:05,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:05,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:05,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:05,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:05,582 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:06,196 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:56:06,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:06,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:06,196 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:56:06,197 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:56:06,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:56:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 15:56:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:56:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:56:06,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:56:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:06,499 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:56:06,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:56:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:06,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:06,499 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:06,499 INFO L423 AbstractCegarLoop]: === Iteration 300 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:06,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash -980548610, now seen corresponding path program 284 times [2018-12-03 15:56:06,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:06,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:06,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:06,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:06,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:06,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:06,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:06,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:06,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:06,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:06,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:06,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:06,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:06,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:06,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:06,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:06,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:06,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:06,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:06,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:06,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:06,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:06,711 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:56:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:07,293 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:56:07,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:07,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:07,294 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:56:07,294 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:56:07,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:56:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:56:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:07,637 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:07,637 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:07,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:07,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:07,637 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:07,637 INFO L423 AbstractCegarLoop]: === Iteration 301 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:07,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash -980546688, now seen corresponding path program 285 times [2018-12-03 15:56:07,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:07,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:07,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:07,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:07,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:07,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:07,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:07,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:07,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:07,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:07,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:07,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:07,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:07,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:07,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:08,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:08,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:08,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:08,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:08,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:08,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:08,081 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:08,672 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:56:08,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:08,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:08,673 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:56:08,673 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:56:08,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:56:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 15:56:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:08,997 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:08,997 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:08,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:08,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:08,998 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:08,998 INFO L423 AbstractCegarLoop]: === Iteration 302 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:08,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash -980489028, now seen corresponding path program 286 times [2018-12-03 15:56:08,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:08,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:08,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:08,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:08,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:09,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:09,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:09,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:09,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:09,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:09,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:09,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:09,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:09,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:09,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:09,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:09,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:09,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:09,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:09,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:09,209 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:09,778 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:56:09,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:09,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:09,778 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:56:09,779 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:09,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 15:56:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:10,112 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:10,112 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:10,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:10,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:10,113 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:10,113 INFO L423 AbstractCegarLoop]: === Iteration 303 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:10,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash -980487106, now seen corresponding path program 287 times [2018-12-03 15:56:10,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:10,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:10,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:10,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:10,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:10,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:10,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:10,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:10,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:10,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:10,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:10,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:10,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:10,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:10,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:10,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:10,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:10,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:10,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:10,332 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:10,849 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:56:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:10,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:10,850 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:56:10,850 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:56:10,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:56:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-12-03 15:56:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:56:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:56:11,097 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 15:56:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:11,097 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:56:11,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:56:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:11,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:11,098 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:56:11,098 INFO L423 AbstractCegarLoop]: === Iteration 304 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:11,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash 735353408, now seen corresponding path program 288 times [2018-12-03 15:56:11,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:11,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:11,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:11,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:11,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:11,166 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:11,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:11,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:11,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:11,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:11,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:11,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:11,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:11,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:11,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:11,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:11,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:11,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:11,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:11,312 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 15:56:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:11,858 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:56:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:11,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:11,859 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:56:11,859 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:11,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:12,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 15:56:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:12,201 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:12,201 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:12,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:12,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:12,202 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:12,202 INFO L423 AbstractCegarLoop]: === Iteration 305 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:12,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash 735355330, now seen corresponding path program 289 times [2018-12-03 15:56:12,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:12,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:12,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:12,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:12,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:12,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:12,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:12,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:12,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:12,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:12,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:12,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:12,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:12,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:12,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:12,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:12,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:12,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:12,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:12,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:12,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:12,467 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:13,021 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:56:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:13,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:13,022 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:56:13,022 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:13,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 15:56:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:13,368 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:13,368 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:13,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:13,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:13,369 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:13,369 INFO L423 AbstractCegarLoop]: === Iteration 306 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:13,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:13,369 INFO L82 PathProgramCache]: Analyzing trace with hash 735412990, now seen corresponding path program 290 times [2018-12-03 15:56:13,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:13,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:13,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:13,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:13,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:13,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:13,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:13,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:13,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:13,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:13,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:13,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:13,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:13,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:13,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:13,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:13,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:13,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:13,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:13,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:13,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:13,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:13,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:13,596 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:14,126 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:56:14,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:14,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:14,126 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:56:14,127 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:56:14,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:56:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-12-03 15:56:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:14,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:14,478 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:14,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:14,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:14,479 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:14,479 INFO L423 AbstractCegarLoop]: === Iteration 307 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:14,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:14,479 INFO L82 PathProgramCache]: Analyzing trace with hash 735414912, now seen corresponding path program 291 times [2018-12-03 15:56:14,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:14,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:14,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:14,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:14,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:14,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:14,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:14,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:14,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:14,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:14,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:14,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:14,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:14,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:14,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:14,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:14,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:14,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:14,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:14,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:14,797 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:15,307 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:56:15,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:15,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:15,308 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:56:15,308 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:56:15,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:56:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:56:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:56:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:56:15,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:56:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:15,621 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:56:15,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:56:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:15,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:15,621 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:15,621 INFO L423 AbstractCegarLoop]: === Iteration 308 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:15,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 737200450, now seen corresponding path program 292 times [2018-12-03 15:56:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:15,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:15,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:15,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:15,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:15,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:15,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:15,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:15,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:15,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:15,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:15,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:15,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:15,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:15,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:15,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:15,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:15,849 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:56:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:16,414 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:56:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:16,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:16,415 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:56:16,415 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:16,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 15:56:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:16,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:16,774 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:16,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:16,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:16,774 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:16,774 INFO L423 AbstractCegarLoop]: === Iteration 309 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:16,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash 737202372, now seen corresponding path program 293 times [2018-12-03 15:56:16,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:16,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:16,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:16,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:16,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:16,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:16,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:16,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:16,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:16,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:16,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:16,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:16,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:16,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:16,991 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:16,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:16,992 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:17,544 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:56:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:17,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:17,545 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:56:17,545 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:17,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 15:56:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:17,877 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:17,877 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:17,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:17,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:17,878 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:17,878 INFO L423 AbstractCegarLoop]: === Iteration 310 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:17,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:17,878 INFO L82 PathProgramCache]: Analyzing trace with hash 737260032, now seen corresponding path program 294 times [2018-12-03 15:56:17,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:17,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:17,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:18,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:18,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:18,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:18,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:18,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:18,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:18,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:18,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:18,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:18,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:18,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:18,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:18,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:18,390 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:18,929 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:56:18,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:18,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:18,930 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:56:18,930 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:56:18,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:56:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-12-03 15:56:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:19,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:19,275 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:19,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:19,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:19,276 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:19,276 INFO L423 AbstractCegarLoop]: === Iteration 311 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:19,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash 737261954, now seen corresponding path program 295 times [2018-12-03 15:56:19,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:19,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:19,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:19,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:19,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:19,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:19,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:19,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:19,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:19,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:19,501 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:20,016 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:56:20,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:20,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:20,016 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:56:20,016 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:56:20,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:56:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 15:56:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:56:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:56:20,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:56:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:20,312 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:56:20,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:56:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:20,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:20,312 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:20,312 INFO L423 AbstractCegarLoop]: === Iteration 312 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:20,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:20,313 INFO L82 PathProgramCache]: Analyzing trace with hash 792611710, now seen corresponding path program 296 times [2018-12-03 15:56:20,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:20,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:20,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:20,383 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:20,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:20,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:20,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:20,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:20,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:20,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:20,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:20,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:20,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:20,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:20,538 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:56:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:21,049 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:56:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:21,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:21,050 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:56:21,050 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:56:21,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:56:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 15:56:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:21,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:21,423 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:21,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:21,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:21,423 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:21,423 INFO L423 AbstractCegarLoop]: === Iteration 313 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:21,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:21,423 INFO L82 PathProgramCache]: Analyzing trace with hash 792613632, now seen corresponding path program 297 times [2018-12-03 15:56:21,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:21,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:21,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:21,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:21,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:21,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:21,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:21,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:21,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:21,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:21,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:21,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:21,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:21,645 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:22,127 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:56:22,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:22,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:22,128 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:56:22,128 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:56:22,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:56:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 15:56:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:22,465 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:22,465 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:22,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:22,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:22,465 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:22,465 INFO L423 AbstractCegarLoop]: === Iteration 314 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:22,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash 792671292, now seen corresponding path program 298 times [2018-12-03 15:56:22,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:22,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:22,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:22,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:22,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:22,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:22,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:22,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:22,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:22,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:22,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:22,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:22,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:22,689 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:23,184 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:56:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:23,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:23,185 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:56:23,185 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:56:23,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:56:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 15:56:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:23,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:23,539 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:23,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:23,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:23,539 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:23,539 INFO L423 AbstractCegarLoop]: === Iteration 315 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:23,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash 792673214, now seen corresponding path program 299 times [2018-12-03 15:56:23,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:23,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:23,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:23,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:23,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:23,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:23,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:23,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:23,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:23,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:23,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:23,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:23,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:23,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:23,768 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:24,255 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:56:24,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:24,255 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:24,256 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:56:24,256 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:56:24,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:56:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 15:56:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:56:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:56:24,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:56:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:24,576 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:56:24,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:56:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:24,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:24,577 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:24,577 INFO L423 AbstractCegarLoop]: === Iteration 316 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:24,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash 794458752, now seen corresponding path program 300 times [2018-12-03 15:56:24,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:24,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:24,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:24,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:24,683 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:24,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:24,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:24,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:24,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:24,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:24,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:24,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:24,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:24,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:24,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:24,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:24,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:24,815 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:56:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:25,263 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:56:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:25,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:25,264 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:56:25,264 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:56:25,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:56:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-12-03 15:56:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:25,615 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:25,615 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:25,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:25,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:25,616 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:25,616 INFO L423 AbstractCegarLoop]: === Iteration 317 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:25,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:25,616 INFO L82 PathProgramCache]: Analyzing trace with hash 794460674, now seen corresponding path program 301 times [2018-12-03 15:56:25,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:25,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:25,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:25,688 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:25,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:25,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:25,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:25,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:25,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:25,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:25,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:25,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:25,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:25,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:25,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:25,834 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:26,309 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:56:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:26,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:26,310 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:56:26,310 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:56:26,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:56:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 15:56:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:26,643 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:26,643 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:26,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:26,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:26,644 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:26,644 INFO L423 AbstractCegarLoop]: === Iteration 318 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:26,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:26,644 INFO L82 PathProgramCache]: Analyzing trace with hash 794518334, now seen corresponding path program 302 times [2018-12-03 15:56:26,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:26,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:26,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:26,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:26,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:26,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:26,712 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:26,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:26,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:26,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:26,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:26,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:26,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:26,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:26,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:26,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:26,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:26,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:26,861 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:27,304 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:56:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:27,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:27,305 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:56:27,305 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:56:27,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:56:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-03 15:56:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:27,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:27,658 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:27,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:27,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:27,658 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:56:27,658 INFO L423 AbstractCegarLoop]: === Iteration 319 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:27,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:27,658 INFO L82 PathProgramCache]: Analyzing trace with hash 794520256, now seen corresponding path program 303 times [2018-12-03 15:56:27,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:27,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:27,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:27,732 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:27,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:27,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:27,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:27,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:27,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:27,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:27,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:27,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:27,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:27,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:27,887 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:28,289 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:56:28,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:28,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:28,289 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:56:28,290 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:56:28,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:56:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-03 15:56:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:56:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:56:28,501 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 11 [2018-12-03 15:56:28,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:28,502 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:56:28,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:56:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:28,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:28,502 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:56:28,502 INFO L423 AbstractCegarLoop]: === Iteration 320 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:28,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash 449751042, now seen corresponding path program 304 times [2018-12-03 15:56:28,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:28,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:28,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:28,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:28,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:28,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:28,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:28,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:28,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:28,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:28,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:28,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:28,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:28,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:28,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:28,768 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 11 states. [2018-12-03 15:56:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:29,566 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:56:29,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:29,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:29,567 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:29,567 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:29,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 15:56:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:29,956 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:29,956 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:29,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:29,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:29,956 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:56:29,956 INFO L423 AbstractCegarLoop]: === Iteration 321 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:29,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash 449752964, now seen corresponding path program 305 times [2018-12-03 15:56:29,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:29,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:29,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:30,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:30,198 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:30,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:30,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:30,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:30,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:30,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:30,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:30,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:30,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:30,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:30,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:30,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:30,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:30,332 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:31,150 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:56:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:31,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:31,150 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:31,151 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:31,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:56:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:31,543 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:31,544 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:31,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:31,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:31,544 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:56:31,544 INFO L423 AbstractCegarLoop]: === Iteration 322 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:31,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:31,544 INFO L82 PathProgramCache]: Analyzing trace with hash 449810624, now seen corresponding path program 306 times [2018-12-03 15:56:31,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:31,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:31,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:31,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:31,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:31,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:31,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:31,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:31,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:31,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:31,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:31,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:31,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:31,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:31,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:31,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:31,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:31,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:31,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:31,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:31,760 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:32,526 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:56:32,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:32,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:32,526 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:56:32,527 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:56:32,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:56:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:56:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:32,915 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:32,916 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:32,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:32,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:32,916 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:32,916 INFO L423 AbstractCegarLoop]: === Iteration 323 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:32,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 449812546, now seen corresponding path program 307 times [2018-12-03 15:56:32,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:32,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:32,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:32,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:32,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:32,985 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:32,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:32,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:32,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:32,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:32,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:32,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:33,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:33,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:33,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:33,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:33,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:33,123 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:33,903 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:56:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:33,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:33,903 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:56:33,904 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:56:33,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:56:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-12-03 15:56:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:56:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:56:34,268 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:56:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:34,268 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:56:34,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:56:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:34,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:34,268 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:56:34,268 INFO L423 AbstractCegarLoop]: === Iteration 324 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:34,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash 451598084, now seen corresponding path program 308 times [2018-12-03 15:56:34,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:34,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:34,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:34,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:34,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:34,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:34,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:34,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:34,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:34,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:34,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:34,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:34,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:34,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:34,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:34,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:34,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:34,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:34,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:34,484 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:56:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:35,283 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:56:35,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:35,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:35,284 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:35,284 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:35,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 15:56:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:35,685 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:35,686 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:35,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:35,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:35,686 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:35,686 INFO L423 AbstractCegarLoop]: === Iteration 325 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:35,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:35,686 INFO L82 PathProgramCache]: Analyzing trace with hash 451600006, now seen corresponding path program 309 times [2018-12-03 15:56:35,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:35,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:35,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:35,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:35,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:35,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:35,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:35,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:35,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:35,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:35,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:35,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:35,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:35,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:35,917 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:35,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:35,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:35,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:35,917 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:36,734 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:56:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:36,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:36,735 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:36,735 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:36,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:56:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:37,113 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:37,113 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:37,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:37,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:37,114 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:37,114 INFO L423 AbstractCegarLoop]: === Iteration 326 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:37,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash 451657666, now seen corresponding path program 310 times [2018-12-03 15:56:37,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:37,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:37,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:37,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:37,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:37,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:37,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:37,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:37,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:37,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:37,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:37,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:37,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:37,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:37,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:37,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:37,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:37,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:37,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:37,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:37,336 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:38,110 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:56:38,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:38,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:38,111 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:56:38,111 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:56:38,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:56:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:56:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:38,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:38,513 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:38,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:38,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:38,513 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:38,513 INFO L423 AbstractCegarLoop]: === Iteration 327 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:38,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash 451659588, now seen corresponding path program 311 times [2018-12-03 15:56:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:38,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:38,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:38,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:38,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:38,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:38,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:38,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:38,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:38,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:38,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:38,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:38,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:38,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:38,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:38,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:38,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:38,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:38,864 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:39,633 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:56:39,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:39,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:39,633 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:56:39,634 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:56:39,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:56:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-12-03 15:56:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:56:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:56:39,964 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:56:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:39,964 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:56:39,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:56:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:39,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:39,964 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:56:39,964 INFO L423 AbstractCegarLoop]: === Iteration 328 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:39,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 507009344, now seen corresponding path program 312 times [2018-12-03 15:56:39,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:39,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:39,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:39,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:39,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:40,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:40,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:40,052 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:40,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:40,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:40,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:40,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:40,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:40,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:40,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:40,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:40,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:40,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:40,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:40,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:40,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:40,206 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:56:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:40,945 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:56:40,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:40,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:40,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:40,946 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:56:40,946 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:56:40,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:56:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:56:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:41,339 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:41,339 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:41,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:41,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:41,339 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:41,339 INFO L423 AbstractCegarLoop]: === Iteration 329 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:41,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash 507011266, now seen corresponding path program 313 times [2018-12-03 15:56:41,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:41,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:41,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:41,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:41,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:41,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:41,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:41,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:41,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:41,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:41,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:41,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:41,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:41,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:41,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:41,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:41,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:41,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:41,563 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:42,271 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:56:42,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:42,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:42,272 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:56:42,272 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:56:42,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:56:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 15:56:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:42,660 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:42,660 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:42,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:42,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:42,660 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:42,660 INFO L423 AbstractCegarLoop]: === Iteration 330 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:42,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash 507068926, now seen corresponding path program 314 times [2018-12-03 15:56:42,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:42,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:42,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:42,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:42,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:42,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:42,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:42,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:42,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:42,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:42,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:42,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:42,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:42,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:42,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:42,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:42,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:42,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:42,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:42,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:42,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:42,980 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:43,755 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:56:43,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:43,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:43,755 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:56:43,755 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:56:43,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:56:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:56:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:44,165 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:44,165 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:44,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:44,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:44,165 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:44,165 INFO L423 AbstractCegarLoop]: === Iteration 331 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:44,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:44,166 INFO L82 PathProgramCache]: Analyzing trace with hash 507070848, now seen corresponding path program 315 times [2018-12-03 15:56:44,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:44,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:44,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:44,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:44,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:44,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:44,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:44,234 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:44,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:44,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:44,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:44,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:44,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:44,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:44,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:44,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:44,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:44,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:44,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:44,388 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:44,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:44,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:44,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:44,389 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:45,108 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:56:45,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:45,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:45,109 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:56:45,109 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:56:45,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:56:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-12-03 15:56:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:56:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:56:45,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:56:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:45,474 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:56:45,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:56:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:45,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:45,474 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:45,474 INFO L423 AbstractCegarLoop]: === Iteration 332 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:45,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash 508856386, now seen corresponding path program 316 times [2018-12-03 15:56:45,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:45,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:45,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:45,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:45,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:45,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:45,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:45,580 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:45,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:45,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:45,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:45,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:45,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:45,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:45,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:45,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:45,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:45,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:45,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:45,735 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:56:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:46,447 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:56:46,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:46,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:46,447 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:56:46,447 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:56:46,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:56:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 15:56:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:46,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:46,838 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:46,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:46,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:46,839 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:46,839 INFO L423 AbstractCegarLoop]: === Iteration 333 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:46,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:46,839 INFO L82 PathProgramCache]: Analyzing trace with hash 508858308, now seen corresponding path program 317 times [2018-12-03 15:56:46,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:46,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:46,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:46,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:46,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:47,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:47,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:47,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:47,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:47,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:47,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:47,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:47,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:47,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:47,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:47,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:47,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:47,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:47,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:47,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:47,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:47,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:47,159 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:47,867 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:56:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:47,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:47,868 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:56:47,868 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:56:47,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:56:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:56:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:48,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:48,269 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:48,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:48,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:48,270 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:48,270 INFO L423 AbstractCegarLoop]: === Iteration 334 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:48,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash 508915968, now seen corresponding path program 318 times [2018-12-03 15:56:48,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:48,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:48,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:48,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:48,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:48,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:48,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:48,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:48,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:48,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:48,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:48,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:48,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:48,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:48,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:48,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:48,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:48,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:48,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:48,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:48,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:48,478 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:49,127 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:56:49,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:49,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:49,128 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:56:49,128 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:56:49,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:56:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:56:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:49,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:49,541 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:49,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:49,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:49,542 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:49,542 INFO L423 AbstractCegarLoop]: === Iteration 335 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:49,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 508917890, now seen corresponding path program 319 times [2018-12-03 15:56:49,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:49,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:49,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:49,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:49,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:49,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:49,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:49,613 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:49,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:49,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:49,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:49,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:49,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:49,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:49,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:49,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:49,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:49,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:49,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:49,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:49,768 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:50,407 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:56:50,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:50,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:50,408 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:56:50,408 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:50,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 15:56:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:56:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:56:50,704 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 15:56:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:50,704 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:56:50,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:56:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:50,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:50,705 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:56:50,705 INFO L423 AbstractCegarLoop]: === Iteration 336 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:50,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2070208892, now seen corresponding path program 320 times [2018-12-03 15:56:50,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:50,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:50,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:50,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:50,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:50,771 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:50,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:50,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:50,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:50,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:50,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:50,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:50,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:50,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:50,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:50,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:50,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:50,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:50,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:50,927 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 15:56:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:51,759 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:56:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:51,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:51,760 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:51,760 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:51,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 15:56:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:52,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:52,176 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:52,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:52,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:52,177 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:52,177 INFO L423 AbstractCegarLoop]: === Iteration 337 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:52,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2070206970, now seen corresponding path program 321 times [2018-12-03 15:56:52,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:52,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:52,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:52,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:52,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:52,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:52,243 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:52,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:52,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:52,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:52,252 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:52,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:52,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:52,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:52,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:52,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:52,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:52,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:52,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:52,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:52,482 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:53,339 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:56:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:53,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:53,340 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:53,340 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:53,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:56:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:53,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:53,741 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:53,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:53,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:53,741 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:53,741 INFO L423 AbstractCegarLoop]: === Iteration 338 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:53,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2070149310, now seen corresponding path program 322 times [2018-12-03 15:56:53,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:53,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:53,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:53,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:53,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:53,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:53,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:53,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:53,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:53,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:53,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:53,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:53,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:54,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:54,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:54,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:54,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:54,073 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:56:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:54,856 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:56:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:54,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:54,857 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:56:54,857 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:56:54,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:56:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:56:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:55,265 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:55,266 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:55,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:55,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:55,266 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:55,266 INFO L423 AbstractCegarLoop]: === Iteration 339 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:55,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2070147388, now seen corresponding path program 323 times [2018-12-03 15:56:55,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:55,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:55,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:55,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:55,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:55,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:55,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:55,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:55,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:55,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:55,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:55,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:55,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:55,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:55,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:55,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:55,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:55,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:55,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:55,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:55,487 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:56,251 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:56:56,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:56,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:56,252 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:56:56,252 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:56:56,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:56:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-12-03 15:56:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:56:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:56:56,624 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:56:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:56,624 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:56:56,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:56:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:56,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:56,625 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:56:56,625 INFO L423 AbstractCegarLoop]: === Iteration 340 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:56,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2068361850, now seen corresponding path program 324 times [2018-12-03 15:56:56,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:56,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:56,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:56,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:56,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:56,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:56,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:56,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:56,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:56,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:56,700 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:56,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:56,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:56,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:56,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:56,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:56,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:56,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:56,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:56,837 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:56:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:57,672 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:56:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:57,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:57,673 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:57,673 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:57,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 15:56:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:56:58,075 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:56:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:58,075 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:56:58,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:56:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:58,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:58,075 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:58,075 INFO L423 AbstractCegarLoop]: === Iteration 341 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:58,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:58,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2068359928, now seen corresponding path program 325 times [2018-12-03 15:56:58,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:58,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:58,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:58,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:58,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:58,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:58,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:58,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:58,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:58,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:58,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:58,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:58,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:58,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:58,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:58,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:58,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:58,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:58,289 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:56:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:59,141 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:56:59,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:59,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:59,141 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:56:59,142 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:56:59,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:56:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:56:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:56:59,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:56:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:59,533 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:56:59,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:56:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:59,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:59,533 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:56:59,533 INFO L423 AbstractCegarLoop]: === Iteration 342 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:59,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:59,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2068302268, now seen corresponding path program 326 times [2018-12-03 15:56:59,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:59,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:59,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:59,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:59,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:59,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:59,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:59,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:59,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:59,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:59,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:59,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:59,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:59,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:59,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:59,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:59,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:59,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:59,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:59,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:59,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:59,754 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:00,585 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:57:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:00,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:00,586 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:57:00,586 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:57:00,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:57:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:57:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:00,990 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:00,990 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:00,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:00,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:00,991 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:00,991 INFO L423 AbstractCegarLoop]: === Iteration 343 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:00,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2068300346, now seen corresponding path program 327 times [2018-12-03 15:57:00,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:00,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:00,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:01,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:01,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:01,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:01,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:01,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:01,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:01,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:01,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:01,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:01,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:01,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:01,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:01,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:01,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:01,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:01,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:01,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:01,220 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:02,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:02,013 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:57:02,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:02,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:02,014 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:57:02,014 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:57:02,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:57:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-12-03 15:57:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:57:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:57:02,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:57:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:02,360 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:57:02,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:57:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:02,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:02,360 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:02,361 INFO L423 AbstractCegarLoop]: === Iteration 344 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:02,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2012950590, now seen corresponding path program 328 times [2018-12-03 15:57:02,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:02,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:02,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:02,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:02,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:02,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:02,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:02,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:02,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:02,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:02,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:02,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:02,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:02,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:02,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:02,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:02,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:02,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:02,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:02,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:02,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:02,584 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:57:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:03,348 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:57:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:03,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:03,348 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:57:03,349 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:57:03,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:57:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:57:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:03,756 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:03,756 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:03,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:03,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:03,757 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:03,757 INFO L423 AbstractCegarLoop]: === Iteration 345 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:03,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2012948668, now seen corresponding path program 329 times [2018-12-03 15:57:03,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:03,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:03,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:03,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:03,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:03,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:03,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:03,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:03,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:03,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:03,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:03,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:03,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:03,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:03,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:03,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:03,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:03,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:03,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:03,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:03,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:03,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:03,974 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:04,724 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:57:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:04,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:04,725 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:57:04,725 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:04,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 15:57:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:05,152 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:05,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:05,153 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:05,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:05,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:05,153 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:05,153 INFO L423 AbstractCegarLoop]: === Iteration 346 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:05,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2012891008, now seen corresponding path program 330 times [2018-12-03 15:57:05,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:05,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:05,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:05,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:05,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:05,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:05,241 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:05,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:05,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:05,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:05,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:05,250 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:05,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:05,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:05,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:05,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:05,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:05,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:05,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:05,383 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:06,146 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:57:06,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:06,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:06,147 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:57:06,147 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:57:06,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:57:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:57:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:06,587 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:06,587 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:06,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:06,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:06,588 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:06,588 INFO L423 AbstractCegarLoop]: === Iteration 347 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:06,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:06,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2012889086, now seen corresponding path program 331 times [2018-12-03 15:57:06,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:06,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:06,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:06,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:06,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:06,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:06,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:06,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:06,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:06,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:06,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:06,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:06,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:06,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:06,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:06,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:06,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:06,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:06,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:06,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:06,811 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:07,548 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:57:07,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:07,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:07,549 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:57:07,549 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:07,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-12-03 15:57:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:57:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:57:07,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:57:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:07,926 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:57:07,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:57:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:07,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:07,926 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:07,926 INFO L423 AbstractCegarLoop]: === Iteration 348 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:07,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2011103548, now seen corresponding path program 332 times [2018-12-03 15:57:07,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:07,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:07,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:07,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:07,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:07,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:07,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:07,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:07,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:07,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:07,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:08,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:08,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:08,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:08,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:08,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:08,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:08,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:08,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:08,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:08,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:08,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:08,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:08,154 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:57:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:08,866 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:57:08,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:08,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:08,867 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:57:08,867 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:57:08,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:57:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 15:57:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:09,281 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:09,281 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:09,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:09,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:09,281 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:09,281 INFO L423 AbstractCegarLoop]: === Iteration 349 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:09,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2011101626, now seen corresponding path program 333 times [2018-12-03 15:57:09,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:09,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:09,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:09,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:09,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:09,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:09,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:09,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:09,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:09,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:09,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:09,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:09,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:09,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:09,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:09,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:09,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:09,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:09,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:09,547 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:10,252 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:57:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:10,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:10,253 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:57:10,253 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:57:10,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:57:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:57:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:10,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:10,657 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:10,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:10,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:10,657 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:10,657 INFO L423 AbstractCegarLoop]: === Iteration 350 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:10,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:10,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2011043966, now seen corresponding path program 334 times [2018-12-03 15:57:10,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:10,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:10,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:10,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:10,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:10,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:10,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:10,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:10,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:10,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:10,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:10,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:10,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:10,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:10,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:10,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:10,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:10,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:10,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:10,861 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:11,541 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:57:11,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:11,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:11,542 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:57:11,542 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:57:11,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:57:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:57:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:11,935 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:11,935 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:11,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:11,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:11,936 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:57:11,936 INFO L423 AbstractCegarLoop]: === Iteration 351 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:11,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:11,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2011042044, now seen corresponding path program 335 times [2018-12-03 15:57:11,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:11,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:12,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:12,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:12,003 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:12,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:12,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:12,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:12,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:12,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:12,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:12,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:12,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:12,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:12,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:12,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:12,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:12,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:12,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:12,164 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:12,829 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:57:12,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:12,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:12,830 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:57:12,830 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:12,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2018-12-03 15:57:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:57:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 15:57:13,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 11 [2018-12-03 15:57:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:13,115 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 15:57:13,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 15:57:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:13,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:13,115 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:57:13,115 INFO L423 AbstractCegarLoop]: === Iteration 352 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:13,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:13,115 INFO L82 PathProgramCache]: Analyzing trace with hash -359595584, now seen corresponding path program 336 times [2018-12-03 15:57:13,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:13,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:13,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:13,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:13,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:13,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:13,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:13,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:13,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:13,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:13,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:13,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:13,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:13,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:13,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:13,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:13,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:13,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:13,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:13,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:13,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:13,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:13,584 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 11 states. [2018-12-03 15:57:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:14,344 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:57:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:14,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:14,344 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:57:14,345 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:14,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 15:57:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:14,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:14,755 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:14,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:14,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:14,755 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:14,756 INFO L423 AbstractCegarLoop]: === Iteration 353 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:14,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash -359593662, now seen corresponding path program 337 times [2018-12-03 15:57:14,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:14,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:14,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:14,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:14,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:14,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:14,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:14,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:14,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:14,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:14,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:14,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:14,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:14,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:14,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:14,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:14,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:14,993 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:15,718 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:57:15,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:15,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:15,718 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:57:15,719 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:57:15,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:57:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:57:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:16,147 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:16,147 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:16,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:16,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:16,148 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:16,148 INFO L423 AbstractCegarLoop]: === Iteration 354 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:16,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash -359536002, now seen corresponding path program 338 times [2018-12-03 15:57:16,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:16,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:16,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:16,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:16,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:16,214 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:16,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:16,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:16,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:16,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:16,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:16,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:16,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:16,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:16,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:16,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:16,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:16,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:16,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:16,355 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:17,149 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:57:17,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:17,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:17,150 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:57:17,150 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:17,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 15:57:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:17,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:17,582 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:17,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:17,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:17,582 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:17,582 INFO L423 AbstractCegarLoop]: === Iteration 355 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:17,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:17,583 INFO L82 PathProgramCache]: Analyzing trace with hash -359534080, now seen corresponding path program 339 times [2018-12-03 15:57:17,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:17,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:17,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:17,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:17,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:17,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:17,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:17,668 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:17,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:17,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:17,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:17,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:17,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:17,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:17,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:17,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:17,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:17,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:17,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:17,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:17,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:17,845 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:18,592 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:57:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:18,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:18,592 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:57:18,592 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:57:18,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:57:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 15:57:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:57:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:57:18,980 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:57:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:18,980 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:57:18,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:57:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:18,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:18,980 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:18,980 INFO L423 AbstractCegarLoop]: === Iteration 356 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:18,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash -357748542, now seen corresponding path program 340 times [2018-12-03 15:57:18,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:18,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:18,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:18,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:18,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:19,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:19,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:19,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:19,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:19,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:19,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:19,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:19,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:19,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:19,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:19,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:19,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:19,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:19,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:19,187 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:57:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:19,880 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:57:19,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:19,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:19,881 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:57:19,881 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:57:19,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:57:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:57:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:20,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:20,310 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:20,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:20,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:20,311 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:20,311 INFO L423 AbstractCegarLoop]: === Iteration 357 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:20,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash -357746620, now seen corresponding path program 341 times [2018-12-03 15:57:20,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:20,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:20,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:20,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:20,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:20,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:20,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:20,377 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:20,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:20,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:20,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:20,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:20,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:20,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:20,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:20,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:20,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:20,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:20,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:20,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:20,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:20,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:20,524 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:21,255 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:57:21,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:21,255 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:21,255 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:57:21,255 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:57:21,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:57:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 15:57:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:21,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:21,662 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:21,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:21,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:21,662 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:21,662 INFO L423 AbstractCegarLoop]: === Iteration 358 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:21,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash -357688960, now seen corresponding path program 342 times [2018-12-03 15:57:21,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:21,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:21,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:21,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:21,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:21,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:21,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:21,731 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:21,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:21,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:21,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:21,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:21,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:21,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:21,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:21,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:21,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:21,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:21,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:21,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:21,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:21,905 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:22,605 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:57:22,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:22,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:22,606 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:57:22,606 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:22,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 15:57:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:23,029 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:23,029 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:23,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:23,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:23,029 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:23,029 INFO L423 AbstractCegarLoop]: === Iteration 359 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:23,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash -357687038, now seen corresponding path program 343 times [2018-12-03 15:57:23,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:23,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:23,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:23,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:23,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:23,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:23,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:23,104 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:23,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:23,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:23,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:23,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:23,114 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:23,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:23,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:23,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:23,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:23,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:23,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:23,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:23,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:23,243 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:23,892 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:57:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:23,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:23,893 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:57:23,893 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:57:23,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:57:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 15:57:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:57:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:57:24,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:57:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:24,262 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:57:24,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:57:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:24,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:24,262 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:24,262 INFO L423 AbstractCegarLoop]: === Iteration 360 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:24,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash -302337282, now seen corresponding path program 344 times [2018-12-03 15:57:24,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:24,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:24,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:24,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:24,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:24,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:24,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:24,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:24,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:24,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:24,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:24,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:24,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:24,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:24,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:24,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:24,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:24,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:24,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:24,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:24,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:24,497 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:57:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:25,272 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:57:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:25,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:25,273 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:57:25,273 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:25,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 15:57:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:25,700 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:25,701 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:25,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:25,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:25,701 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:25,701 INFO L423 AbstractCegarLoop]: === Iteration 361 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:25,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash -302335360, now seen corresponding path program 345 times [2018-12-03 15:57:25,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:25,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:25,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:25,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:25,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:25,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:25,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:25,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:25,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:25,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:25,782 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:25,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:25,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:25,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:25,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:26,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:26,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:26,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:26,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:26,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:26,036 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:26,792 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:57:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:26,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:26,793 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:57:26,793 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:57:26,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:57:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 15:57:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:27,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:27,252 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:27,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:27,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:27,252 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:27,252 INFO L423 AbstractCegarLoop]: === Iteration 362 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:27,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash -302277700, now seen corresponding path program 346 times [2018-12-03 15:57:27,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:27,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:27,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:27,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:27,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:27,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:27,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:27,317 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:27,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:27,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:27,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:27,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:27,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:27,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:27,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:27,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:27,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:27,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:27,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:27,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:27,462 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:28,230 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:57:28,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:28,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:28,230 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:57:28,230 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:28,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 15:57:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:28,757 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:28,757 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:28,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:28,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:28,758 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:28,758 INFO L423 AbstractCegarLoop]: === Iteration 363 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:28,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash -302275778, now seen corresponding path program 347 times [2018-12-03 15:57:28,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:28,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:28,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:28,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:28,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:28,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:28,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:28,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:28,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:28,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:28,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:28,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:28,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:28,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:28,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:28,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:28,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:28,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:28,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:28,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:28,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:28,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:28,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:28,969 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:29,731 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:57:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:29,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:29,732 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:57:29,732 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:57:29,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:57:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 15:57:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:57:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:57:30,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:57:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:30,135 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:57:30,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:57:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:30,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:30,135 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:30,135 INFO L423 AbstractCegarLoop]: === Iteration 364 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:30,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash -300490240, now seen corresponding path program 348 times [2018-12-03 15:57:30,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:30,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:30,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:30,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:30,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:30,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:30,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:30,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:30,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:30,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:30,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:30,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:30,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:30,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:30,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:30,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:30,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:30,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:30,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:30,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:30,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:30,424 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:57:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:31,157 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:57:31,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:31,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:31,157 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:57:31,157 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:57:31,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:57:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 15:57:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:31,605 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:31,605 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:31,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:31,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:31,606 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:31,606 INFO L423 AbstractCegarLoop]: === Iteration 365 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:31,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash -300488318, now seen corresponding path program 349 times [2018-12-03 15:57:31,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:31,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:31,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:31,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:31,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:31,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:31,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:31,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:31,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:31,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:31,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:31,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:31,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:31,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:31,819 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:32,550 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 15:57:32,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:32,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:32,551 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:57:32,551 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:57:32,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:57:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 15:57:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:32,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:32,967 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:32,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:32,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:32,968 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:32,968 INFO L423 AbstractCegarLoop]: === Iteration 366 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:32,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash -300430658, now seen corresponding path program 350 times [2018-12-03 15:57:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:33,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:33,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:33,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:33,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:33,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:33,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:33,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:33,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:33,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:33,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:33,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:33,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:33,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:33,194 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:33,873 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:57:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:33,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:33,874 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:57:33,874 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:33,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 15:57:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:34,330 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:34,330 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:34,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:34,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:34,331 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:57:34,331 INFO L423 AbstractCegarLoop]: === Iteration 367 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:34,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash -300428736, now seen corresponding path program 351 times [2018-12-03 15:57:34,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:34,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:34,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:34,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:34,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:34,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:34,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:34,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:34,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:34,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:34,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:34,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:34,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:34,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:34,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:34,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:34,537 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:35,201 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:57:35,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:35,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:35,202 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:57:35,202 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:57:35,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:57:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-12-03 15:57:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:57:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:57:35,521 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 15:57:35,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:35,521 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:57:35,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:57:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:35,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:35,522 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:35,522 INFO L423 AbstractCegarLoop]: === Iteration 368 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:35,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1415411778, now seen corresponding path program 352 times [2018-12-03 15:57:35,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:35,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:35,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:35,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:35,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:35,600 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:35,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:35,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:35,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:35,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:35,732 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 15:57:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:36,447 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:57:36,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:36,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:36,447 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:57:36,447 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:36,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 15:57:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:36,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:36,900 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:36,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:36,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:36,900 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:36,900 INFO L423 AbstractCegarLoop]: === Iteration 369 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:36,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1415413700, now seen corresponding path program 353 times [2018-12-03 15:57:36,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:36,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:36,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:36,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:36,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:36,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:36,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:36,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:36,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:36,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:36,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:36,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:36,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:36,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:36,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:36,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:36,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:37,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:37,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:37,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:37,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:37,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:37,111 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:37,808 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:57:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:37,808 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:37,809 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:57:37,809 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:37,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 15:57:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:38,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:38,279 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:38,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:38,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:38,280 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:38,280 INFO L423 AbstractCegarLoop]: === Iteration 370 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:38,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1415471360, now seen corresponding path program 354 times [2018-12-03 15:57:38,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:38,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:38,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:38,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:38,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:38,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:38,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:38,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:38,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:38,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:38,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:38,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:38,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:38,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:38,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:38,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:38,504 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:38,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:38,505 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:39,175 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:57:39,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:39,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:39,176 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:57:39,176 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:57:39,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:57:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-12-03 15:57:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:39,613 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:39,613 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:39,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:39,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:39,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:39,614 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:39,614 INFO L423 AbstractCegarLoop]: === Iteration 371 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:39,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:39,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1415473282, now seen corresponding path program 355 times [2018-12-03 15:57:39,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:39,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:39,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:39,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:39,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:39,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:39,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:39,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:39,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:39,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:39,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:39,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:39,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:39,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:39,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:39,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:39,871 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:40,505 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:57:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:40,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:40,507 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:57:40,507 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:57:40,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:57:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 15:57:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:57:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:57:40,907 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:57:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:40,908 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:57:40,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:57:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:40,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:40,908 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:40,908 INFO L423 AbstractCegarLoop]: === Iteration 372 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:40,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1417258820, now seen corresponding path program 356 times [2018-12-03 15:57:40,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:40,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:40,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:40,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:40,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:40,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:40,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:40,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:40,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:40,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:41,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:41,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:41,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:41,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:41,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:41,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:41,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:41,126 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:57:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:41,834 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:57:41,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:41,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:41,835 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:57:41,835 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:41,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 15:57:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:42,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:42,264 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:42,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:42,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:42,265 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:42,265 INFO L423 AbstractCegarLoop]: === Iteration 373 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:42,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1417260742, now seen corresponding path program 357 times [2018-12-03 15:57:42,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:42,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:42,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:42,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:42,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:42,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:42,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:42,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:42,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:42,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:42,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:42,346 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:42,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:42,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:42,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:42,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:42,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:42,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:42,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:42,483 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:43,183 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 15:57:43,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:43,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:43,183 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:57:43,183 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:43,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 15:57:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:43,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:43,603 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:43,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:43,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:43,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:43,604 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:43,604 INFO L423 AbstractCegarLoop]: === Iteration 374 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:43,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:43,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1417318402, now seen corresponding path program 358 times [2018-12-03 15:57:43,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:43,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:43,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:43,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:43,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:43,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:43,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:43,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:43,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:43,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:43,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:43,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:43,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:43,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:43,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:43,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:43,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:43,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:43,825 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:44,503 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 15:57:44,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:44,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:44,504 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:57:44,504 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:57:44,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:57:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-12-03 15:57:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:44,948 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:44,948 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:44,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:44,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:44,948 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:57:44,948 INFO L423 AbstractCegarLoop]: === Iteration 375 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:44,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:44,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1417320324, now seen corresponding path program 359 times [2018-12-03 15:57:44,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:44,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:44,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:45,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:45,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:45,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:45,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:45,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:45,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:45,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:45,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:45,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:45,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:45,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:45,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:45,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:45,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:45,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:45,337 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:45,988 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:57:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:45,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:45,989 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:57:45,989 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:57:45,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:57:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 15:57:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:57:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:57:46,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:57:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:46,358 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:57:46,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:57:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:46,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:46,359 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:57:46,359 INFO L423 AbstractCegarLoop]: === Iteration 376 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:46,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1472670080, now seen corresponding path program 360 times [2018-12-03 15:57:46,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:46,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:46,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:46,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:46,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:46,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:46,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:46,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:46,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:46,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:46,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:46,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:46,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:46,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:46,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:46,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:46,634 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:57:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:47,242 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:57:47,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:47,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:47,243 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:57:47,243 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:57:47,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:57:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 15:57:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:47,680 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:47,680 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:47,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:47,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:47,681 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:47,681 INFO L423 AbstractCegarLoop]: === Iteration 377 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:47,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1472672002, now seen corresponding path program 361 times [2018-12-03 15:57:47,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:47,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:47,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:47,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:47,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:47,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:47,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:47,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:47,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:47,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:47,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:47,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:47,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:47,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:47,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:47,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:47,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:47,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:47,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:47,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:47,924 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:48,542 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:57:48,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:48,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:48,543 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:57:48,543 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:57:48,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:57:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 15:57:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:48,989 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:48,989 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:48,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:48,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:48,989 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:48,989 INFO L423 AbstractCegarLoop]: === Iteration 378 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:48,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1472729662, now seen corresponding path program 362 times [2018-12-03 15:57:48,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:48,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:48,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:49,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:49,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:49,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:49,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:49,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:49,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:49,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:49,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:49,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:49,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:49,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:49,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:49,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:49,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:49,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:49,208 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:49,944 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 15:57:49,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:49,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:49,944 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:57:49,945 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:57:49,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:57:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 15:57:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:50,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:50,411 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:50,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:50,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:50,412 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:57:50,412 INFO L423 AbstractCegarLoop]: === Iteration 379 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:50,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1472731584, now seen corresponding path program 363 times [2018-12-03 15:57:50,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:50,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:50,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:50,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:50,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:50,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:50,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:50,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:50,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:50,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:50,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:50,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:50,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:50,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:50,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:50,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:50,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:50,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:50,622 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:50,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:50,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:50,623 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:51,235 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 15:57:51,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:51,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:51,235 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:57:51,236 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:57:51,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:57:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 15:57:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:57:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:57:51,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:57:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:51,646 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:57:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:57:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:51,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:51,646 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:57:51,646 INFO L423 AbstractCegarLoop]: === Iteration 380 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:51,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1474517122, now seen corresponding path program 364 times [2018-12-03 15:57:51,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:51,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:51,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:51,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:51,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:51,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:51,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:51,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:51,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:51,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:51,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:51,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:51,900 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:51,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:51,901 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:57:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:52,473 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:57:52,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:52,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:52,474 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:57:52,474 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:57:52,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:57:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-12-03 15:57:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:52,924 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:52,924 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:52,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:52,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:52,925 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:57:52,925 INFO L423 AbstractCegarLoop]: === Iteration 381 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:52,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1474519044, now seen corresponding path program 365 times [2018-12-03 15:57:52,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:52,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:52,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:53,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:53,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:53,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:53,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:53,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:53,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:53,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:53,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:53,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:53,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:53,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:53,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:53,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:53,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:53,148 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:53,727 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 15:57:53,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:53,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:53,728 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:57:53,728 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:57:53,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:57:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 15:57:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:57:54,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:57:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:54,154 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:57:54,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:57:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:54,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:54,154 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:57:54,154 INFO L423 AbstractCegarLoop]: === Iteration 382 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:54,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:54,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1474576704, now seen corresponding path program 366 times [2018-12-03 15:57:54,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:54,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:54,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:54,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:54,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:54,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:54,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:54,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:54,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:54,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:54,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:54,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:54,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:54,235 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:54,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:54,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:54,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:54,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:54,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:54,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:54,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:54,377 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:57:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:54,921 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 15:57:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:54,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:54,922 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:57:54,922 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:57:54,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:57:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-03 15:57:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:57:55,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:57:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:55,363 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:57:55,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:57:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:55,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:55,364 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:57:55,364 INFO L423 AbstractCegarLoop]: === Iteration 383 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:55,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1474578626, now seen corresponding path program 367 times [2018-12-03 15:57:55,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:55,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:55,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:55,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:55,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:55,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:55,508 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:55,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:55,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:55,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:55,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:55,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:55,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:55,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:55,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:55,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:55,643 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:57:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:56,152 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 15:57:56,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:56,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:56,154 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:57:56,154 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:57:56,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:57:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-03 15:57:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:57:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 15:57:56,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 11 [2018-12-03 15:57:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:56,432 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 15:57:56,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 15:57:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:56,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:56,433 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:57:56,433 INFO L423 AbstractCegarLoop]: === Iteration 384 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:56,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:56,433 INFO L82 PathProgramCache]: Analyzing trace with hash -623334338, now seen corresponding path program 368 times [2018-12-03 15:57:56,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:56,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:56,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:56,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:56,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:56,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:56,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:56,506 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:56,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:56,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:56,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:56,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:56,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:56,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:56,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:56,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:56,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:57,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:57,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:57,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:57,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:57,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:57,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:57,354 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 11 states. [2018-12-03 15:57:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:58,543 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 15:57:58,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:58,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:57:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:58,545 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:57:58,545 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:57:58,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:57:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 15:57:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:57:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:57:59,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:57:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:59,072 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:57:59,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:57:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:59,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:59,073 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:57:59,073 INFO L423 AbstractCegarLoop]: === Iteration 385 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:59,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash -623332416, now seen corresponding path program 369 times [2018-12-03 15:57:59,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:59,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:59,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:59,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:59,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:59,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:59,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:59,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:59,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:59,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:59,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:59,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:59,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:59,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:59,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:57:59,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:59,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:59,284 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:00,484 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 15:58:00,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:00,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:00,485 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:58:00,485 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:58:00,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:58:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 15:58:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:58:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:58:01,026 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:58:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:01,027 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:58:01,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:58:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:01,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:01,027 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:58:01,027 INFO L423 AbstractCegarLoop]: === Iteration 386 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:01,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:01,027 INFO L82 PathProgramCache]: Analyzing trace with hash -623274756, now seen corresponding path program 370 times [2018-12-03 15:58:01,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:01,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:01,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:01,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:01,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:01,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:01,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:01,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:01,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:01,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:01,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:01,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:01,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:01,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:01,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:01,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:01,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:01,276 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:58:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:02,469 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 15:58:02,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:02,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:02,470 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:58:02,470 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:58:02,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:58:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 15:58:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:03,005 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:03,005 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:03,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:03,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:03,005 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:03,005 INFO L423 AbstractCegarLoop]: === Iteration 387 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:03,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:03,006 INFO L82 PathProgramCache]: Analyzing trace with hash -623272834, now seen corresponding path program 371 times [2018-12-03 15:58:03,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:03,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:03,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:03,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:03,073 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:03,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:03,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:03,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:03,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:03,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:03,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:03,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:03,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:03,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:03,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:03,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:03,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:03,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:03,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:03,227 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:04,381 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 15:58:04,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:04,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:04,381 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:58:04,382 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:58:04,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:58:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-12-03 15:58:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:58:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:58:04,865 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:58:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:04,865 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:58:04,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:58:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:04,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:04,865 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:58:04,866 INFO L423 AbstractCegarLoop]: === Iteration 388 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:04,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:04,866 INFO L82 PathProgramCache]: Analyzing trace with hash -621487296, now seen corresponding path program 372 times [2018-12-03 15:58:04,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:04,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:04,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:04,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:04,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:04,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:04,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:04,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:04,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:04,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:04,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:04,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:05,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:05,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:05,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:05,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:05,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:05,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:05,096 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:58:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:06,220 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 15:58:06,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:06,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:06,221 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:58:06,221 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:58:06,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:58:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 15:58:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:06,737 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:06,737 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:06,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:06,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:06,738 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:06,738 INFO L423 AbstractCegarLoop]: === Iteration 389 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:06,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:06,738 INFO L82 PathProgramCache]: Analyzing trace with hash -621485374, now seen corresponding path program 373 times [2018-12-03 15:58:06,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:06,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:06,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:06,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:06,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:06,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:06,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:06,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:06,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:06,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:06,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:06,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:06,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:06,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:06,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:06,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:06,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:06,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:06,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:06,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:06,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:06,958 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:08,068 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 15:58:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:08,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:08,068 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:58:08,069 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:58:08,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:58:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2018-12-03 15:58:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:58:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:58:08,578 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:58:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:08,578 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:58:08,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:58:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:08,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:08,578 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:08,578 INFO L423 AbstractCegarLoop]: === Iteration 390 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:08,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash -621427714, now seen corresponding path program 374 times [2018-12-03 15:58:08,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:08,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:08,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:08,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:08,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:08,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:08,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:08,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:08,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:08,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:08,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:08,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:08,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:08,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:08,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:08,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:08,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:08,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:08,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:08,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:08,805 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:58:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:09,900 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:58:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:09,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:09,901 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:58:09,901 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:58:09,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:58:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 15:58:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:10,416 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:10,417 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:10,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:10,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:10,417 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:10,417 INFO L423 AbstractCegarLoop]: === Iteration 391 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:10,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:10,417 INFO L82 PathProgramCache]: Analyzing trace with hash -621425792, now seen corresponding path program 375 times [2018-12-03 15:58:10,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:10,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:10,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:10,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:10,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:10,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:10,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:10,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:10,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:10,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:10,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:10,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:10,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:10,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:10,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:10,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:10,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:10,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:10,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:10,731 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:11,772 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 15:58:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:11,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:11,772 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:58:11,772 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:58:11,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:58:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 17. [2018-12-03 15:58:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:58:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:58:12,232 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:58:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:12,232 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:58:12,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:58:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:12,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:12,232 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:58:12,232 INFO L423 AbstractCegarLoop]: === Iteration 392 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:12,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:12,232 INFO L82 PathProgramCache]: Analyzing trace with hash -566076036, now seen corresponding path program 376 times [2018-12-03 15:58:12,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:12,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:12,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:12,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:12,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:12,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:12,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:12,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:12,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:12,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:12,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:12,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:12,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:12,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:12,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:12,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:12,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:12,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:12,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:12,454 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:58:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:13,681 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 15:58:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:13,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:13,681 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:58:13,681 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:58:13,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:58:14,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 15:58:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:14,203 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:14,203 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:14,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:14,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:14,203 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:14,204 INFO L423 AbstractCegarLoop]: === Iteration 393 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:14,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:14,204 INFO L82 PathProgramCache]: Analyzing trace with hash -566074114, now seen corresponding path program 377 times [2018-12-03 15:58:14,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:14,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:14,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:14,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:14,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:14,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:14,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:14,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:14,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:14,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:14,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:14,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:14,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:14,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:14,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:14,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:14,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:14,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:14,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:14,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:14,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:14,418 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:15,582 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 15:58:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:15,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:15,582 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:58:15,583 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:58:15,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:58:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 15:58:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:58:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:58:16,103 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:58:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:16,103 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:58:16,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:58:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:16,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:16,104 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:16,104 INFO L423 AbstractCegarLoop]: === Iteration 394 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:16,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash -566016454, now seen corresponding path program 378 times [2018-12-03 15:58:16,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:16,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:16,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:16,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:16,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:16,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:16,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:16,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:16,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:16,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:16,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:16,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:16,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:16,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:16,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:16,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:16,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:16,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:16,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:16,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:16,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:16,315 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:58:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:17,531 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 15:58:17,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:17,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:17,532 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:58:17,532 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:58:17,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:58:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 15:58:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:18,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:18,056 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:18,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:18,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:18,057 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:18,057 INFO L423 AbstractCegarLoop]: === Iteration 395 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:18,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash -566014532, now seen corresponding path program 379 times [2018-12-03 15:58:18,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:18,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:18,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:18,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:18,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:18,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:18,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:18,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:18,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:18,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:18,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:18,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:18,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:18,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:18,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:18,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:18,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:18,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:18,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:18,293 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:19,465 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 15:58:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:19,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:19,466 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:58:19,466 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:58:19,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:58:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-12-03 15:58:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:58:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:58:19,955 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:58:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:58:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:58:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:19,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:19,956 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:19,956 INFO L423 AbstractCegarLoop]: === Iteration 396 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash -564228994, now seen corresponding path program 380 times [2018-12-03 15:58:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:19,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:20,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:20,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:20,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:20,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:20,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:20,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:20,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:20,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:20,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:20,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:20,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:20,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:20,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:20,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:20,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:20,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:20,184 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:58:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:21,336 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 15:58:21,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:21,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:21,336 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:58:21,337 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:58:21,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:58:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 15:58:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:21,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:21,899 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:21,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:21,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:21,899 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:21,899 INFO L423 AbstractCegarLoop]: === Iteration 397 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:21,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:21,900 INFO L82 PathProgramCache]: Analyzing trace with hash -564227072, now seen corresponding path program 381 times [2018-12-03 15:58:21,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:21,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:21,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:21,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:21,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:21,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:21,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:21,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:21,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:21,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:21,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:21,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:21,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:21,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:21,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:22,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:22,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:22,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:22,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:22,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:22,115 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:23,250 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 15:58:23,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:23,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:23,251 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:58:23,251 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:58:23,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:58:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2018-12-03 15:58:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:58:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:58:23,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:58:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:23,765 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:58:23,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:58:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:23,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:23,766 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:23,766 INFO L423 AbstractCegarLoop]: === Iteration 398 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:23,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash -564169412, now seen corresponding path program 382 times [2018-12-03 15:58:23,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:23,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:23,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:23,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:23,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:23,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:23,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:23,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:23,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:23,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:23,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:23,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:23,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:23,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:23,986 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:58:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:25,092 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:58:25,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:25,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:25,093 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:58:25,093 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:58:25,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:58:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 15:58:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:25,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:25,633 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:25,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:25,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:25,633 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:25,633 INFO L423 AbstractCegarLoop]: === Iteration 399 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:25,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:25,634 INFO L82 PathProgramCache]: Analyzing trace with hash -564167490, now seen corresponding path program 383 times [2018-12-03 15:58:25,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:25,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:25,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:25,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:25,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:25,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:25,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:25,703 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:25,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:25,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:25,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:25,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:25,712 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:25,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:25,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:25,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:25,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:25,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:25,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:25,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:25,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:25,866 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:26,945 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 15:58:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:26,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:26,946 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:58:26,946 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:58:26,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:58:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2018-12-03 15:58:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:58:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:58:27,369 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:58:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:27,369 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:58:27,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:58:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:27,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:27,370 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:58:27,370 INFO L423 AbstractCegarLoop]: === Iteration 400 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:27,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1151673024, now seen corresponding path program 384 times [2018-12-03 15:58:27,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:27,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:27,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:27,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:27,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:27,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:27,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:27,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:27,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:27,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:27,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:27,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:27,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:27,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:27,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:27,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:27,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:27,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:27,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:27,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:27,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:27,591 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:58:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:28,694 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:58:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:28,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:28,695 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:58:28,695 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:58:28,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:58:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 15:58:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:29,236 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:29,236 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:29,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:29,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:29,237 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:29,237 INFO L423 AbstractCegarLoop]: === Iteration 401 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:29,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1151674946, now seen corresponding path program 385 times [2018-12-03 15:58:29,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:29,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:29,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:29,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:29,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:29,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:29,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:29,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:29,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:29,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:29,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:29,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:29,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:29,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:29,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:29,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:29,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:29,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:29,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:29,470 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:30,574 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:58:30,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:30,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:30,574 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:58:30,574 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:58:30,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:58:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-03 15:58:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:58:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:58:31,101 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:58:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:31,101 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:58:31,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:58:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:31,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:31,102 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:31,102 INFO L423 AbstractCegarLoop]: === Iteration 402 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:31,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1151732606, now seen corresponding path program 386 times [2018-12-03 15:58:31,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:31,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:31,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:31,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:31,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:31,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:31,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:31,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:31,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:31,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:31,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:31,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:31,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:31,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:31,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:31,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:31,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:31,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:31,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:31,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:31,475 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:58:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:32,545 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 15:58:32,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:32,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:32,546 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:58:32,546 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:58:32,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:58:33,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 15:58:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:33,083 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:33,083 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:33,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:33,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:33,083 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:33,083 INFO L423 AbstractCegarLoop]: === Iteration 403 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:33,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1151734528, now seen corresponding path program 387 times [2018-12-03 15:58:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:33,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:33,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:33,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:33,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:33,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:33,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:33,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:33,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:33,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:33,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:33,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:33,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:33,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:33,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:33,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:33,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:33,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:33,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:33,305 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:34,350 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:58:34,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:34,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:34,351 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:58:34,351 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:58:34,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:58:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:58:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:58:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:58:34,852 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:58:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:34,852 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:58:34,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:58:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:34,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:34,852 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:34,852 INFO L423 AbstractCegarLoop]: === Iteration 404 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:34,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:34,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1153520066, now seen corresponding path program 388 times [2018-12-03 15:58:34,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:34,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:34,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:34,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:34,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:34,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:34,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:34,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:34,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:34,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:34,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:34,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:34,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:34,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:34,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:35,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:35,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:35,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:35,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:35,065 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:58:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:36,244 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:58:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:36,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:36,245 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:58:36,245 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:58:36,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:58:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 15:58:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:36,781 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:36,781 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:36,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:36,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:36,781 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:36,781 INFO L423 AbstractCegarLoop]: === Iteration 405 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:36,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1153521988, now seen corresponding path program 389 times [2018-12-03 15:58:36,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:36,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:36,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:36,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:36,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:36,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:36,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:36,848 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:36,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:36,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:36,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:36,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:36,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:36,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:36,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:36,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:36,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:37,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:37,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:37,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:37,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:37,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:37,165 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:38,289 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:58:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:38,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:38,290 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:58:38,290 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:58:38,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:58:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-03 15:58:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:58:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:58:38,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:58:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:38,809 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:58:38,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:58:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:38,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:38,810 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:38,810 INFO L423 AbstractCegarLoop]: === Iteration 406 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:38,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:38,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1153579648, now seen corresponding path program 390 times [2018-12-03 15:58:38,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:38,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:38,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:38,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:38,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:38,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:38,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:38,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:38,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:38,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:38,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:38,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:38,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:38,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:38,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:38,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:38,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:39,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:39,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:39,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:39,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:39,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:39,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:39,023 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:58:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:40,102 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 15:58:40,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:40,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:40,103 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:58:40,103 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:58:40,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:58:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 15:58:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:40,644 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:40,644 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:40,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:40,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:40,644 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:40,644 INFO L423 AbstractCegarLoop]: === Iteration 407 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:40,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1153581570, now seen corresponding path program 391 times [2018-12-03 15:58:40,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:40,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:40,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:40,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:40,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:40,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:40,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:40,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:40,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:40,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:40,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:40,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:40,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:40,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:40,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:40,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:40,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:40,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:40,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:40,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:40,869 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:41,890 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:58:41,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:41,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:41,890 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:58:41,891 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:58:41,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:58:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 17. [2018-12-03 15:58:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:58:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:58:42,543 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:58:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:42,543 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:58:42,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:58:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:42,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:42,543 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:42,543 INFO L423 AbstractCegarLoop]: === Iteration 408 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:42,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1208931326, now seen corresponding path program 392 times [2018-12-03 15:58:42,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:42,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:42,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:42,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:42,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:42,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:42,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:42,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:42,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:42,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:42,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:42,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:42,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:42,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:42,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:42,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:42,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:42,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:42,755 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:58:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:43,816 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:58:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:43,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:43,817 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:58:43,817 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:58:43,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:58:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 15:58:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:44,351 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:44,351 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:44,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:44,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:44,351 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:44,351 INFO L423 AbstractCegarLoop]: === Iteration 409 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:44,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1208933248, now seen corresponding path program 393 times [2018-12-03 15:58:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:44,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:44,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:44,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:44,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:44,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:44,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:44,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:44,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:44,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:44,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:44,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:44,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:44,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:44,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:44,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:44,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:44,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:44,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:44,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:44,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:44,566 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:45,597 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:58:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:45,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:45,597 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:58:45,597 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:58:45,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:58:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:58:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:58:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:58:46,124 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:58:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:46,124 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:58:46,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:58:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:46,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:46,124 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:46,124 INFO L423 AbstractCegarLoop]: === Iteration 410 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:46,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1208990908, now seen corresponding path program 394 times [2018-12-03 15:58:46,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:46,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:46,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:46,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:46,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:46,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:46,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:46,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:46,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:46,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:46,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:46,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:46,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:46,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:46,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:46,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:46,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:46,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:46,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:46,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:46,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:46,335 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:58:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:47,372 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:58:47,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:47,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:47,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:47,373 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:58:47,373 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:58:47,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:58:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 15:58:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:47,906 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:47,906 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:47,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:47,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:47,907 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:47,907 INFO L423 AbstractCegarLoop]: === Iteration 411 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:47,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1208992830, now seen corresponding path program 395 times [2018-12-03 15:58:47,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:47,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:47,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:47,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:47,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:47,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:47,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:47,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:47,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:47,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:47,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:47,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:48,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:48,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:48,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:48,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:48,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:48,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:48,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:48,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:48,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:48,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:48,128 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:49,145 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:58:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:49,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:49,146 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:58:49,146 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:58:49,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:58:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 15:58:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:58:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:58:49,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:58:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:49,650 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:58:49,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:58:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:49,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:49,651 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:58:49,651 INFO L423 AbstractCegarLoop]: === Iteration 412 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:49,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1210778368, now seen corresponding path program 396 times [2018-12-03 15:58:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:49,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:49,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:49,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:49,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:49,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:49,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:49,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:49,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:49,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:49,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:49,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:49,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:49,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:49,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:49,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:49,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:49,873 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:49,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:49,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:49,873 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:58:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:50,842 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:58:50,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:50,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:50,842 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:58:50,842 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:58:50,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:58:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 15:58:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:51,383 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:51,383 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:51,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:51,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:51,384 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:51,384 INFO L423 AbstractCegarLoop]: === Iteration 413 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:51,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1210780290, now seen corresponding path program 397 times [2018-12-03 15:58:51,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:51,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:51,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:51,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:51,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:51,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:51,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:51,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:51,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:51,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:51,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:51,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:51,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:51,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:51,786 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:51,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:51,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:51,787 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:52,777 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:58:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:52,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:52,777 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:58:52,778 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:58:52,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:58:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:58:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:58:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:58:53,300 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:58:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:53,300 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:58:53,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:58:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:53,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:53,301 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:53,301 INFO L423 AbstractCegarLoop]: === Iteration 414 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:53,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:53,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1210837950, now seen corresponding path program 398 times [2018-12-03 15:58:53,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:53,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:53,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:53,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:53,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:53,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:53,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:53,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:53,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:53,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:53,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:53,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:53,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:53,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:53,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:53,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:53,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:53,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:53,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:53,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:53,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:53,507 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:58:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:54,434 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:58:54,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:54,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:54,434 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:58:54,434 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:58:54,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:58:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-12-03 15:58:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:55,031 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:55,031 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:55,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:55,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:55,032 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:58:55,032 INFO L423 AbstractCegarLoop]: === Iteration 415 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:55,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1210839872, now seen corresponding path program 399 times [2018-12-03 15:58:55,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:55,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:55,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:55,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:55,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:55,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:55,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:55,110 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:55,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:55,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:55,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:55,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:55,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:55,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:55,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:55,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:55,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:55,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:55,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:55,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:55,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:55,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:55,267 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:58:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:56,180 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 15:58:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:56,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:56,180 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:58:56,180 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:58:56,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:58:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 15. [2018-12-03 15:58:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:58:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 15:58:56,555 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 15:58:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:56,556 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 15:58:56,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 15:58:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:56,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:56,556 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:58:56,556 INFO L423 AbstractCegarLoop]: === Iteration 416 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:56,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1432680964, now seen corresponding path program 400 times [2018-12-03 15:58:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:56,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:56,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:56,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:56,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:56,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:56,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:56,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:56,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:56,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:56,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:56,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:56,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:56,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:56,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:56,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:56,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:56,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:56,871 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 15:58:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:58,201 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 15:58:58,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:58:58,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:58:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:58,201 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:58:58,202 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:58:58,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:58:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 15:58:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:58:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:58:58,765 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:58:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:58,766 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:58:58,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:58:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:58:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:58:58,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:58,766 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:58:58,766 INFO L423 AbstractCegarLoop]: === Iteration 417 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:58,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:58,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1432679042, now seen corresponding path program 401 times [2018-12-03 15:58:58,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:58,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:58,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:58,833 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:58,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:58,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:58,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:58,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:58,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:58,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:58:58,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:58,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:58,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:58:58,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:58,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:58:58,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:58:58,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:58,976 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:00,292 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 15:59:00,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:00,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:00,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:00,292 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:59:00,293 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:59:00,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:59:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 15:59:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:59:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:59:00,880 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:59:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:00,880 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:59:00,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:59:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:00,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:00,880 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:00,880 INFO L423 AbstractCegarLoop]: === Iteration 418 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:00,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1432621382, now seen corresponding path program 402 times [2018-12-03 15:59:00,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:00,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:00,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:00,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:00,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:00,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:00,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:00,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:00,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:00,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:00,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:00,957 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:00,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:00,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:00,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:01,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:01,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:01,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:01,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:01,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:01,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:01,100 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:59:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:02,410 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 15:59:02,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:02,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:02,411 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:59:02,411 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:59:02,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:59:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 15:59:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:02,975 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:02,975 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:02,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:02,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:02,975 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:02,975 INFO L423 AbstractCegarLoop]: === Iteration 419 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:02,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1432619460, now seen corresponding path program 403 times [2018-12-03 15:59:02,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:02,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:02,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:02,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:02,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:03,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:03,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:03,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:03,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:03,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:03,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:03,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:03,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:03,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:03,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:03,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:03,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:03,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:03,201 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:04,532 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 15:59:04,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:04,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:04,533 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:59:04,533 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:59:04,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:59:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-12-03 15:59:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:59:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:59:05,057 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:59:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:05,057 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:59:05,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:59:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:05,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:05,057 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:05,057 INFO L423 AbstractCegarLoop]: === Iteration 420 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:05,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:05,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1430833922, now seen corresponding path program 404 times [2018-12-03 15:59:05,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:05,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:05,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:05,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:05,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:05,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:05,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:05,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:05,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:05,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:05,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:05,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:05,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:05,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:05,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:05,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:05,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:05,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:05,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:05,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:05,281 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:59:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:06,506 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 15:59:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:06,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:06,506 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:59:06,506 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:59:06,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:59:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 15:59:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:07,076 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:07,077 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:07,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:07,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:07,077 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:07,077 INFO L423 AbstractCegarLoop]: === Iteration 421 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:07,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1430832000, now seen corresponding path program 405 times [2018-12-03 15:59:07,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:07,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:07,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:07,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:07,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:07,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:07,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:07,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:07,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:07,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:07,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:07,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:07,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:07,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:07,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:07,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:07,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:07,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:07,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:07,399 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:08,642 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 15:59:08,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:08,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:08,643 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:59:08,643 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:59:08,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:59:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2018-12-03 15:59:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:59:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:59:09,192 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:59:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:09,192 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:59:09,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:59:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:09,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:09,192 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:09,193 INFO L423 AbstractCegarLoop]: === Iteration 422 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:09,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1430774340, now seen corresponding path program 406 times [2018-12-03 15:59:09,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:09,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:09,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:09,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:09,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:09,258 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:09,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:09,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:09,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:09,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:09,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:09,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:09,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:09,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:09,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:09,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:09,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:09,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:09,422 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:59:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:10,596 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:59:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:10,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:10,597 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:59:10,597 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:59:10,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:59:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 15:59:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:11,166 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:11,166 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:11,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:11,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:11,167 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:11,167 INFO L423 AbstractCegarLoop]: === Iteration 423 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:11,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:11,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1430772418, now seen corresponding path program 407 times [2018-12-03 15:59:11,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:11,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:11,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:11,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:11,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:11,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:11,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:11,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:11,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:11,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:11,250 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:11,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:11,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:11,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:11,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:11,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:11,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:11,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:11,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:11,417 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:12,600 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 15:59:12,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:12,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:12,601 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:59:12,601 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:59:12,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:59:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 17. [2018-12-03 15:59:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:59:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:59:13,095 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:59:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:13,096 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:59:13,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:59:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:13,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:13,096 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:13,096 INFO L423 AbstractCegarLoop]: === Iteration 424 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:13,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:13,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1375422662, now seen corresponding path program 408 times [2018-12-03 15:59:13,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:13,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:13,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:13,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:13,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:13,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:13,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:13,168 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:13,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:13,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:13,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:13,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:13,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:13,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:13,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:13,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:13,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:13,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:13,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:13,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:13,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:13,318 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:59:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:14,690 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 15:59:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:14,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:14,691 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:59:14,691 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:59:14,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:59:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 15:59:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:15,255 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:15,255 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:15,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:15,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:15,256 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:15,256 INFO L423 AbstractCegarLoop]: === Iteration 425 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:15,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1375420740, now seen corresponding path program 409 times [2018-12-03 15:59:15,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:15,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:15,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:15,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:15,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:15,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:15,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:15,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:15,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:15,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:15,334 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:15,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:15,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:15,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:15,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:15,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:15,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:15,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:15,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:15,492 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:16,800 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 15:59:16,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:16,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:16,801 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:59:16,801 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:59:16,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:59:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 15:59:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:59:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:59:17,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:59:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:17,378 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:59:17,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:59:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:17,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:17,378 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:17,379 INFO L423 AbstractCegarLoop]: === Iteration 426 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:17,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1375363080, now seen corresponding path program 410 times [2018-12-03 15:59:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:17,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:17,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:17,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:17,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:17,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:17,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:17,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:17,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:17,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:17,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:17,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:17,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:17,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:17,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:17,614 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:17,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:17,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:17,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:17,614 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:59:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:18,962 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 15:59:18,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:18,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:18,962 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:59:18,962 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:59:18,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:59:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 15:59:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:19,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:19,530 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:19,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:19,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:19,531 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:19,531 INFO L423 AbstractCegarLoop]: === Iteration 427 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:19,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1375361158, now seen corresponding path program 411 times [2018-12-03 15:59:19,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:19,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:19,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:19,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:19,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:19,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:19,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:19,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:19,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:19,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:19,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:19,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:19,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:19,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:19,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:19,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:19,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:19,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:19,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:19,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:19,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:19,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:19,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:19,738 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:21,049 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 15:59:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:21,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:21,049 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:59:21,049 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:59:21,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:59:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-12-03 15:59:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:59:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:59:21,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:59:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:21,575 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:59:21,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:59:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:21,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:21,576 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:21,576 INFO L423 AbstractCegarLoop]: === Iteration 428 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:21,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:21,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1373575620, now seen corresponding path program 412 times [2018-12-03 15:59:21,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:21,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:21,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:21,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:21,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:21,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:21,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:21,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:21,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:21,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:21,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:21,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:21,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:21,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:21,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:21,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:21,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:21,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:21,806 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:59:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:23,042 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 15:59:23,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:23,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:23,043 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:59:23,043 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:59:23,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:59:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 15:59:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:23,627 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:23,627 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:23,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:23,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:23,627 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:23,627 INFO L423 AbstractCegarLoop]: === Iteration 429 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:23,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1373573698, now seen corresponding path program 413 times [2018-12-03 15:59:23,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:23,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:23,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:23,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:23,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:23,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:23,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:23,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:23,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:23,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:23,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:23,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:23,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:23,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:23,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:23,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:23,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:23,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:23,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:23,844 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:25,112 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 15:59:25,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:25,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:25,113 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:59:25,113 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:59:25,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:59:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2018-12-03 15:59:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:59:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:59:25,673 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:59:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:25,673 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:59:25,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:59:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:25,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:25,674 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:25,674 INFO L423 AbstractCegarLoop]: === Iteration 430 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:25,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1373516038, now seen corresponding path program 414 times [2018-12-03 15:59:25,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:25,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:25,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:25,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:25,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:25,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:25,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:25,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:25,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:25,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:25,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:25,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:25,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:25,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:25,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:25,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:25,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:25,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:25,885 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:25,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:25,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:25,886 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:59:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:27,082 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:59:27,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:27,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:27,083 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:59:27,083 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:59:27,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:59:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 15:59:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:27,673 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:27,673 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:27,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:27,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:27,673 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:59:27,673 INFO L423 AbstractCegarLoop]: === Iteration 431 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:27,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1373514116, now seen corresponding path program 415 times [2018-12-03 15:59:27,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:27,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:27,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:27,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:27,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:27,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:27,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:27,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:27,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:27,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:27,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:27,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:27,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:27,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:27,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:27,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:27,935 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:29,128 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 15:59:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:29,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:29,128 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:59:29,128 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:59:29,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:59:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2018-12-03 15:59:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:59:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 15:59:29,570 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 15:59:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:29,570 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 15:59:29,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 15:59:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:29,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:29,570 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:29,570 INFO L423 AbstractCegarLoop]: === Iteration 432 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:29,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 342326398, now seen corresponding path program 416 times [2018-12-03 15:59:29,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:29,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:29,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:29,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:29,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:29,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:29,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:29,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:29,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:29,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:29,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:29,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:29,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:29,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:29,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:29,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:29,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:29,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:29,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:29,781 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 15:59:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:30,990 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:59:30,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:30,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:30,990 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:59:30,990 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:59:30,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:59:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 15:59:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:31,581 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:31,581 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:31,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:31,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:31,582 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:31,582 INFO L423 AbstractCegarLoop]: === Iteration 433 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:31,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash 342328320, now seen corresponding path program 417 times [2018-12-03 15:59:31,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:31,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:31,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:31,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:31,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:31,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:31,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:31,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:31,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:31,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:31,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:31,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:31,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:31,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:31,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:31,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:31,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:31,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:31,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:31,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:31,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:31,795 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:32,996 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:59:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:32,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:32,997 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:59:32,997 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:59:32,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:59:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-03 15:59:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:59:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:59:33,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:59:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:33,561 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:59:33,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:59:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:33,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:33,561 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:33,561 INFO L423 AbstractCegarLoop]: === Iteration 434 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:33,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash 342385980, now seen corresponding path program 418 times [2018-12-03 15:59:33,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:33,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:33,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:33,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:33,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:33,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:33,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:33,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:33,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:33,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:33,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:33,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:33,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:33,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:33,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:33,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:33,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:33,776 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:59:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:34,997 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 15:59:34,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:34,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:34,998 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:59:34,998 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:59:34,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:59:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 15:59:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:35,574 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:35,574 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:35,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:35,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:35,574 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:35,575 INFO L423 AbstractCegarLoop]: === Iteration 435 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:35,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:35,575 INFO L82 PathProgramCache]: Analyzing trace with hash 342387902, now seen corresponding path program 419 times [2018-12-03 15:59:35,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:35,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:35,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:35,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:35,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:35,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:35,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:35,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:35,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:35,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:35,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:35,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:35,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:35,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:35,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:35,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:35,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:35,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:35,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:35,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:35,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:35,806 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:36,945 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:59:36,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:36,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:36,946 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:59:36,946 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:59:36,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:59:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 15:59:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:59:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:59:37,498 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:59:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:37,498 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:59:37,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:59:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:37,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:37,498 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:37,499 INFO L423 AbstractCegarLoop]: === Iteration 436 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:37,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 344173440, now seen corresponding path program 420 times [2018-12-03 15:59:37,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:37,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:37,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:37,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:37,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:37,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:37,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:37,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:37,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:37,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:37,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:37,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:37,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:37,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:37,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:37,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:37,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:37,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:37,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:37,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:37,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:37,843 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:59:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:39,105 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:59:39,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:39,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:39,106 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:59:39,106 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:59:39,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:59:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 15:59:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:39,693 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:39,693 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:39,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:39,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:39,694 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:39,694 INFO L423 AbstractCegarLoop]: === Iteration 437 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:39,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 344175362, now seen corresponding path program 421 times [2018-12-03 15:59:39,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:39,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:39,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:39,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:39,782 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:39,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:39,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:39,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:39,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:39,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:39,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:39,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:39,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:39,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:39,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:39,908 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:41,120 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 15:59:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:41,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:41,121 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:59:41,121 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:59:41,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:59:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-03 15:59:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:59:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:59:41,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:59:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:41,687 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:59:41,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:59:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:41,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:41,688 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:41,688 INFO L423 AbstractCegarLoop]: === Iteration 438 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:41,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash 344233022, now seen corresponding path program 422 times [2018-12-03 15:59:41,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:41,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:41,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:41,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:41,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:41,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:41,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:41,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:41,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:41,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:41,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:41,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:41,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:41,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:41,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:41,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:41,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:41,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:41,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:41,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:41,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:41,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:41,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:41,931 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:59:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:43,081 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 15:59:43,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:43,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:43,082 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:59:43,082 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:59:43,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:59:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 15:59:43,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:43,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:43,671 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:43,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:43,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:43,671 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:59:43,671 INFO L423 AbstractCegarLoop]: === Iteration 439 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:43,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash 344234944, now seen corresponding path program 423 times [2018-12-03 15:59:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:43,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:43,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:43,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:43,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:43,741 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:43,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:43,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:43,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:43,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:43,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:43,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:43,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:43,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:43,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:43,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:43,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:43,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:43,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:43,888 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:45,019 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:59:45,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:45,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:45,020 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:59:45,020 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:59:45,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:59:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 17. [2018-12-03 15:59:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:59:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 15:59:45,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 15:59:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:45,541 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 15:59:45,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 15:59:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:45,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:45,542 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 15:59:45,542 INFO L423 AbstractCegarLoop]: === Iteration 440 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:45,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash 399584700, now seen corresponding path program 424 times [2018-12-03 15:59:45,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:45,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:45,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:45,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:45,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:45,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:45,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:45,609 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:45,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:45,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:45,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:45,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:45,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:45,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:45,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:45,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:45,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:45,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:45,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:45,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:45,791 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 15:59:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:46,961 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:59:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:46,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:46,962 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:59:46,962 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:59:46,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:59:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 15:59:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:47,554 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:47,554 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:47,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:47,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:47,554 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:47,554 INFO L423 AbstractCegarLoop]: === Iteration 441 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:47,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 399586622, now seen corresponding path program 425 times [2018-12-03 15:59:47,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:47,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:47,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:47,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:47,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:47,621 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:47,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:47,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:47,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:47,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:47,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:47,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:47,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:47,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:47,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:47,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:47,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:47,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:47,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:47,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:47,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:47,783 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:48,874 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:59:48,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:48,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:48,875 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:59:48,875 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:59:48,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:59:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:59:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:59:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:59:49,447 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:59:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:49,447 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:59:49,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:59:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:49,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:49,448 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:49,448 INFO L423 AbstractCegarLoop]: === Iteration 442 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:49,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash 399644282, now seen corresponding path program 426 times [2018-12-03 15:59:49,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:49,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:49,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:49,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:49,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:49,520 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:49,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:49,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:49,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:49,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:49,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:49,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:49,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:49,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:49,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:49,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:49,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:49,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:49,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:49,744 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:59:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:50,892 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 15:59:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:50,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:50,893 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:59:50,893 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:59:50,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:59:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 15:59:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:51,478 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:51,478 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:51,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:51,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:51,479 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:59:51,479 INFO L423 AbstractCegarLoop]: === Iteration 443 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:51,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash 399646204, now seen corresponding path program 427 times [2018-12-03 15:59:51,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:51,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:51,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:51,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:51,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:51,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:51,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:51,548 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:51,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:51,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:51,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:51,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:51,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:51,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:51,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:51,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:51,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:51,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:51,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:51,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:51,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:51,694 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:52,820 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 15:59:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:52,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:52,821 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:59:52,821 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:59:52,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:59:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 15:59:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:59:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 15:59:53,385 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 15:59:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:53,385 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 15:59:53,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 15:59:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:53,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:53,386 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 15:59:53,386 INFO L423 AbstractCegarLoop]: === Iteration 444 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:53,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:53,386 INFO L82 PathProgramCache]: Analyzing trace with hash 401431742, now seen corresponding path program 428 times [2018-12-03 15:59:53,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:53,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:53,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:53,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:53,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:53,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:53,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:53,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:53,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:53,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:53,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:53,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:53,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:53,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:53,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:53,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:53,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:53,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:53,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:53,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:53,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:53,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:53,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:53,636 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 15:59:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:54,687 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:59:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:54,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:54,687 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:59:54,687 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:59:54,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:59:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 15:59:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:55,272 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:55,272 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:55,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:55,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:55,273 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:59:55,273 INFO L423 AbstractCegarLoop]: === Iteration 445 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:55,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash 401433664, now seen corresponding path program 429 times [2018-12-03 15:59:55,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:55,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:55,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:55,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:55,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:55,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:55,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:55,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:55,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:55,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:55,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:55,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:55,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:55,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:55,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:55,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:55,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:55,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:55,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:55,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:55,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:55,494 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 15:59:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:56,543 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 15:59:56,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:56,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:56,544 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:59:56,544 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:59:56,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:59:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 15:59:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:59:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 15:59:57,120 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 15:59:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:57,120 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 15:59:57,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 15:59:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:57,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:57,120 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 15:59:57,121 INFO L423 AbstractCegarLoop]: === Iteration 446 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:57,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash 401491324, now seen corresponding path program 430 times [2018-12-03 15:59:57,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:57,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:57,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:57,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:57,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:57,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:57,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:57,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:57,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:57,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:57,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:57,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:57,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:57,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:57,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:57,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:57,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:57,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:57,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:57,349 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 15:59:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:58,352 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 15:59:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:59:58,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:59:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:58,352 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:59:58,352 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:59:58,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:59:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-12-03 15:59:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:59:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 15:59:58,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 15:59:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:58,956 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 15:59:58,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:59:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 15:59:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:59:58,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:58,956 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 15:59:58,956 INFO L423 AbstractCegarLoop]: === Iteration 447 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:58,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash 401493246, now seen corresponding path program 431 times [2018-12-03 15:59:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:58,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:59,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:59,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:59,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:59,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:59,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:59,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:59,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:59,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:59:59,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:59,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:59,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:59,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:59,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:59:59,179 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:59,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:59:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:59:59,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:59:59,179 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:00,162 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:00:00,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:00,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:00,163 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:00:00,163 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:00:00,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:00:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 14. [2018-12-03 16:00:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:00:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:00:00,546 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 11 [2018-12-03 16:00:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:00,546 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:00:00,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:00:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:00,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:00,546 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:00:00,546 INFO L423 AbstractCegarLoop]: === Iteration 448 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:00,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash 56724032, now seen corresponding path program 432 times [2018-12-03 16:00:00,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:00,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:00,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:00,621 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:00,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:00,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:00,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:00,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:00,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:00,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:00,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:00,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:00,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:00,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:00,773 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 11 states. [2018-12-03 16:00:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:02,043 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:00:02,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:02,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:02,043 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:00:02,044 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:00:02,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:00:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 16:00:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:02,678 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:02,678 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:02,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:02,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:02,679 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:02,679 INFO L423 AbstractCegarLoop]: === Iteration 449 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:02,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:02,679 INFO L82 PathProgramCache]: Analyzing trace with hash 56725954, now seen corresponding path program 433 times [2018-12-03 16:00:02,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:02,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:02,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:02,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:02,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:02,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:02,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:02,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:02,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:02,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:02,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:02,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:02,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:02,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:02,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:02,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:02,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:02,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:02,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:02,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:02,897 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:04,168 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:00:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:04,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:04,169 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:00:04,169 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:00:04,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:00:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 16:00:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:00:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:00:04,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:00:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:04,904 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:00:04,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:00:04,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:04,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:04,905 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:04,905 INFO L423 AbstractCegarLoop]: === Iteration 450 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:04,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:04,905 INFO L82 PathProgramCache]: Analyzing trace with hash 56783614, now seen corresponding path program 434 times [2018-12-03 16:00:04,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:04,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:04,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:04,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:04,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:04,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:04,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:04,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:04,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:04,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:04,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:04,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:04,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:04,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:04,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:04,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:05,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:05,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:05,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:05,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:05,134 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:00:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:06,357 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:00:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:06,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:06,358 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:00:06,358 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:00:06,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:00:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 16:00:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:06,992 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:06,992 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:06,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:06,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:06,992 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:06,992 INFO L423 AbstractCegarLoop]: === Iteration 451 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:06,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:06,993 INFO L82 PathProgramCache]: Analyzing trace with hash 56785536, now seen corresponding path program 435 times [2018-12-03 16:00:06,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:06,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:06,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:06,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:06,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:07,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:07,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:07,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:07,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:07,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:07,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:07,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:07,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:07,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:07,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:07,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:07,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:07,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:07,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:07,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:07,217 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:08,437 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:00:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:08,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:08,437 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:00:08,437 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:00:08,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:00:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 16:00:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:00:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:00:09,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:00:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:09,033 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:00:09,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:00:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:09,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:09,034 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:09,034 INFO L423 AbstractCegarLoop]: === Iteration 452 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:09,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:09,034 INFO L82 PathProgramCache]: Analyzing trace with hash 58571074, now seen corresponding path program 436 times [2018-12-03 16:00:09,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:09,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:09,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:09,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:09,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:09,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:09,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:09,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:09,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:09,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:09,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:09,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:09,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:09,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:09,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:09,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:09,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:09,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:09,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:09,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:09,243 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:00:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:10,526 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:00:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:10,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:10,526 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:00:10,526 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:00:10,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:00:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 16:00:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:11,164 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:11,164 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:11,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:11,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:11,165 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:11,165 INFO L423 AbstractCegarLoop]: === Iteration 453 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:11,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:11,165 INFO L82 PathProgramCache]: Analyzing trace with hash 58572996, now seen corresponding path program 437 times [2018-12-03 16:00:11,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:11,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:11,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:11,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:11,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:11,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:11,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:11,235 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:11,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:11,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:11,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:11,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:11,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:11,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:11,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:11,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:11,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:11,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:11,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:11,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:11,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:11,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:11,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:11,407 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:12,662 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:00:12,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:12,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:12,663 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:00:12,663 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:00:12,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:00:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 16:00:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:00:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:00:13,287 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:00:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:13,287 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:00:13,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:00:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:13,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:13,287 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:13,288 INFO L423 AbstractCegarLoop]: === Iteration 454 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:13,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash 58630656, now seen corresponding path program 438 times [2018-12-03 16:00:13,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:13,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:13,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:13,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:13,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:13,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:13,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:13,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:13,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:13,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:13,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:13,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:13,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:13,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:13,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:13,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:13,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:13,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:13,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:13,701 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:00:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:14,940 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:00:14,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:14,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:14,941 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:00:14,941 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:00:14,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:00:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 16:00:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:15,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:15,582 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:15,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:15,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:15,582 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:15,583 INFO L423 AbstractCegarLoop]: === Iteration 455 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:15,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:15,583 INFO L82 PathProgramCache]: Analyzing trace with hash 58632578, now seen corresponding path program 439 times [2018-12-03 16:00:15,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:15,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:15,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:15,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:15,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:15,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:15,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:15,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:15,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:15,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:15,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:15,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:15,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:15,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:15,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:15,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:15,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:15,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:15,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:15,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:15,811 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:16,987 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:00:16,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:16,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:16,987 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:00:16,987 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:00:16,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:00:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 16:00:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:00:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:00:17,547 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:00:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:17,548 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:00:17,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:00:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:17,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:17,548 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:17,548 INFO L423 AbstractCegarLoop]: === Iteration 456 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:17,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 113982334, now seen corresponding path program 440 times [2018-12-03 16:00:17,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:17,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:17,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:17,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:17,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:17,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:17,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:17,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:17,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:17,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:17,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:17,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:17,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:17,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:17,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:17,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:17,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:17,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:17,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:17,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:17,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:17,772 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:00:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:18,940 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:00:18,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:18,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:18,941 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:00:18,941 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:00:18,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:00:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 16:00:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:19,578 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:19,579 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:19,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:19,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:19,579 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:19,579 INFO L423 AbstractCegarLoop]: === Iteration 457 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:19,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash 113984256, now seen corresponding path program 441 times [2018-12-03 16:00:19,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:19,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:19,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:19,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:19,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:19,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:19,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:19,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:19,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:19,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:19,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:19,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:19,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:19,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:19,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:19,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:19,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:19,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:19,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:19,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:19,807 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:20,936 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:00:20,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:20,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:20,937 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:00:20,937 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:00:20,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:00:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:00:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:00:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:00:21,574 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:00:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:21,574 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:00:21,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:00:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:21,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:21,575 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:21,575 INFO L423 AbstractCegarLoop]: === Iteration 458 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:21,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash 114041916, now seen corresponding path program 442 times [2018-12-03 16:00:21,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:21,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:21,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:21,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:21,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:21,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:21,656 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:21,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:21,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:21,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:21,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:21,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:21,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:21,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:21,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:21,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:21,807 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:21,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:21,808 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:00:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:22,963 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:00:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:22,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:22,964 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:00:22,964 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:00:22,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:00:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 16:00:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:23,607 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:23,607 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:23,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:23,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:23,607 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:23,607 INFO L423 AbstractCegarLoop]: === Iteration 459 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:23,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash 114043838, now seen corresponding path program 443 times [2018-12-03 16:00:23,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:23,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:23,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:23,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:23,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:23,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:23,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:23,708 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:23,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:23,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:23,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:23,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:23,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:23,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:23,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:23,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:23,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:23,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:23,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:23,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:23,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:23,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:23,919 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:25,084 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:00:25,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:25,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:25,084 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:00:25,084 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:00:25,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:00:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 16:00:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:00:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:00:25,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:00:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:25,705 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:00:25,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:00:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:25,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:25,706 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:25,706 INFO L423 AbstractCegarLoop]: === Iteration 460 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:25,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:25,706 INFO L82 PathProgramCache]: Analyzing trace with hash 115829376, now seen corresponding path program 444 times [2018-12-03 16:00:25,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:25,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:25,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:25,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:25,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:25,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:25,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:25,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:25,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:25,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:25,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:25,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:25,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:25,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:25,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:25,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:25,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:25,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:25,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:25,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:25,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:25,957 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:00:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:27,036 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:00:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:27,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:27,037 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:00:27,037 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:00:27,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:00:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-12-03 16:00:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:27,690 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:27,690 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:27,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:27,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:27,691 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:27,691 INFO L423 AbstractCegarLoop]: === Iteration 461 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:27,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash 115831298, now seen corresponding path program 445 times [2018-12-03 16:00:27,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:27,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:27,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:27,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:27,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:27,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:27,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:27,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:27,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:27,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:27,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:27,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:27,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:27,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:27,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:27,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:27,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:27,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:27,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:27,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:27,926 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:29,008 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:00:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:29,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:29,008 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:00:29,008 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:00:29,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:00:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:00:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:00:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:00:29,645 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:00:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:29,645 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:00:29,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:00:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:29,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:29,645 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:29,645 INFO L423 AbstractCegarLoop]: === Iteration 462 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:29,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash 115888958, now seen corresponding path program 446 times [2018-12-03 16:00:29,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:29,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:29,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:29,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:29,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:29,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:29,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:29,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:29,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:29,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:29,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:29,720 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:29,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:29,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:29,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:29,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:29,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:29,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:29,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:29,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:29,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:29,859 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:00:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:30,908 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:00:30,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:30,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:30,908 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:00:30,908 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:00:30,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:00:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-03 16:00:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:31,577 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:31,577 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:31,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:31,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:31,578 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:00:31,578 INFO L423 AbstractCegarLoop]: === Iteration 463 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:31,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash 115890880, now seen corresponding path program 447 times [2018-12-03 16:00:31,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:31,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:31,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:31,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:31,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:31,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:31,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:31,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:31,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:31,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:31,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:31,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:31,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:31,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:31,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:31,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:31,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:32,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:32,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:32,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:32,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:32,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:32,085 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:33,110 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:00:33,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:33,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:33,111 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:00:33,111 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:00:33,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:00:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-12-03 16:00:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:00:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:00:33,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:00:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:33,627 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:00:33,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:00:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:33,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:33,627 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:33,627 INFO L423 AbstractCegarLoop]: === Iteration 464 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:33,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1831731394, now seen corresponding path program 448 times [2018-12-03 16:00:33,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:33,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:33,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:33,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:33,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:33,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:33,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:33,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:33,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:33,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:33,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:33,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:33,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:33,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:33,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:33,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:33,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:33,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:33,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:33,855 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:00:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:35,164 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:00:35,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:35,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:35,164 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:00:35,164 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:00:35,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:00:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 16:00:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:35,833 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:35,834 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:35,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:35,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:35,834 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:35,834 INFO L423 AbstractCegarLoop]: === Iteration 465 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:35,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1831733316, now seen corresponding path program 449 times [2018-12-03 16:00:35,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:35,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:35,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:35,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:35,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:35,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:35,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:35,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:35,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:35,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:35,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:35,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:35,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:35,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:36,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:36,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:36,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:36,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:36,044 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:37,380 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:00:37,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:37,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:37,381 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:00:37,381 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:00:37,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:00:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 16:00:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:00:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:00:38,021 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:00:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:38,021 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:00:38,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:00:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:38,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:38,021 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:38,021 INFO L423 AbstractCegarLoop]: === Iteration 466 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:38,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1831790976, now seen corresponding path program 450 times [2018-12-03 16:00:38,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:38,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:38,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:38,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:38,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:38,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:38,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:38,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:38,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:38,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:38,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:38,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:38,101 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:38,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:38,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:38,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:38,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:38,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:38,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:38,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:38,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:38,244 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:00:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:39,504 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:00:39,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:39,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:39,505 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:00:39,505 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:00:39,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:00:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 16:00:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:40,162 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:40,162 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:40,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:40,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:40,163 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:40,163 INFO L423 AbstractCegarLoop]: === Iteration 467 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:40,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:40,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1831792898, now seen corresponding path program 451 times [2018-12-03 16:00:40,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:40,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:40,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:40,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:40,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:40,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:40,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:40,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:40,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:40,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:40,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:40,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:40,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:40,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:40,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:40,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:40,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:40,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:40,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:40,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:40,377 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:41,621 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:00:41,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:41,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:41,621 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:00:41,622 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:00:41,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:00:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 16:00:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:00:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:00:42,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:00:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:42,231 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:00:42,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:00:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:42,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:42,231 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:42,231 INFO L423 AbstractCegarLoop]: === Iteration 468 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:42,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1833578436, now seen corresponding path program 452 times [2018-12-03 16:00:42,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:42,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:42,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:42,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:42,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:42,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:42,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:42,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:42,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:42,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:42,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:42,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:42,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:42,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:42,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:42,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:42,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:42,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:42,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:42,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:42,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:42,441 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:00:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:43,734 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:00:43,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:43,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:43,734 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:00:43,734 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:00:43,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:00:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 16:00:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:44,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:44,393 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:44,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:44,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:44,393 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:44,393 INFO L423 AbstractCegarLoop]: === Iteration 469 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:44,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1833580358, now seen corresponding path program 453 times [2018-12-03 16:00:44,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:44,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:44,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:44,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:44,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:44,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:44,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:44,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:44,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:44,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:44,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:44,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:44,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:44,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:44,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:44,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:44,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:44,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:44,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:44,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:44,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:44,698 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:45,996 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:00:45,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:45,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:45,996 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:00:45,996 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:00:45,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:00:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 16:00:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:00:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:00:46,638 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:00:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:46,638 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:00:46,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:00:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:46,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:46,638 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:46,638 INFO L423 AbstractCegarLoop]: === Iteration 470 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:46,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:46,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1833638018, now seen corresponding path program 454 times [2018-12-03 16:00:46,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:46,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:46,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:46,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:46,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:46,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:46,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:46,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:46,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:46,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:46,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:46,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:46,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:46,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:46,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:46,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:46,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:46,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:46,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:46,869 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:00:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:48,134 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:00:48,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:48,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:48,134 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:00:48,134 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:00:48,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:00:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 16:00:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:48,791 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:48,791 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:48,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:48,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:48,791 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:00:48,791 INFO L423 AbstractCegarLoop]: === Iteration 471 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:48,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1833639940, now seen corresponding path program 455 times [2018-12-03 16:00:48,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:48,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:48,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:48,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:48,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:48,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:48,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:48,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:48,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:48,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:48,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:48,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:48,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:48,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:49,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:49,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:49,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:49,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:49,034 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:50,250 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:00:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:50,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:50,251 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:00:50,251 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:00:50,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:00:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 16:00:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:00:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:00:50,816 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:00:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:50,816 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:00:50,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:00:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:50,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:50,816 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:00:50,816 INFO L423 AbstractCegarLoop]: === Iteration 472 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:50,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1888989696, now seen corresponding path program 456 times [2018-12-03 16:00:50,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:50,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:50,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:50,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:50,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:50,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:50,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:50,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:50,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:50,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:50,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:50,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:50,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:50,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:50,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:50,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:50,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:51,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:51,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:51,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:51,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:51,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:51,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:51,068 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:00:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:52,279 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:00:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:52,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:52,279 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:00:52,279 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:00:52,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:00:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 16:00:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:52,940 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:52,940 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:52,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:52,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:52,941 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:52,941 INFO L423 AbstractCegarLoop]: === Iteration 473 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:52,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:52,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1888991618, now seen corresponding path program 457 times [2018-12-03 16:00:52,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:52,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:52,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:53,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:53,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:53,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:53,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:53,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:53,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:53,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:53,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:53,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:53,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:53,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:53,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:53,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:53,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:53,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:53,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:53,169 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:54,327 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:00:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:54,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:54,327 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:00:54,327 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:00:54,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:00:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:00:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:00:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:00:54,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:00:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:54,980 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:00:54,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:00:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:54,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:54,980 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:54,980 INFO L423 AbstractCegarLoop]: === Iteration 474 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:54,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1889049278, now seen corresponding path program 458 times [2018-12-03 16:00:54,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:54,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:54,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:55,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:55,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:55,046 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:55,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:55,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:55,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:55,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:55,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:55,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:00:55,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:55,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:55,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:55,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:55,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:55,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:55,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:55,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:55,213 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:00:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:56,434 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:00:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:56,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:56,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:56,434 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:00:56,435 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:00:56,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:00:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 16:00:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:00:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:00:57,106 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:00:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:57,106 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:00:57,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:00:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:57,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:57,106 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:00:57,106 INFO L423 AbstractCegarLoop]: === Iteration 475 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:57,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1889051200, now seen corresponding path program 459 times [2018-12-03 16:00:57,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:57,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:57,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:57,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:57,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:57,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:57,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:57,173 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:57,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:57,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:57,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:57,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:57,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:57,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:57,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:57,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:57,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:57,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:57,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:57,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:57,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:57,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:57,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:57,324 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:00:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:58,485 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:00:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:00:58,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:00:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:58,486 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:00:58,486 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:00:58,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:00:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 16:00:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:00:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:00:59,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:00:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:59,100 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:00:59,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:00:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:00:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:00:59,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:59,101 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:00:59,101 INFO L423 AbstractCegarLoop]: === Iteration 476 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:59,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:59,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1890836738, now seen corresponding path program 460 times [2018-12-03 16:00:59,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:59,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:59,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:59,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:59,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:59,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:59,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:59,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:59,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:59,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:59,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:59,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:59,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:59,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:59,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:59,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:59,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:00:59,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:59,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:00:59,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:00:59,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:00:59,340 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:01:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:00,429 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:01:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:00,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:00,430 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:01:00,430 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:01:00,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:01:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-12-03 16:01:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:01,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:01,099 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:01,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:01,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:01,100 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:01,100 INFO L423 AbstractCegarLoop]: === Iteration 477 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:01,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1890838660, now seen corresponding path program 461 times [2018-12-03 16:01:01,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:01,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:01,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:01,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:01,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:01,165 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:01,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:01,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:01,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:01,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:01,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:01,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:01,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:01,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:01,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:01,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:01,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:01,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:01,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:01,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:01,353 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:02,490 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:01:02,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:02,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:02,490 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:01:02,490 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:01:02,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:01:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:01:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:01:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:01:03,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:01:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:03,144 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:01:03,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:01:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:03,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:03,145 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:03,145 INFO L423 AbstractCegarLoop]: === Iteration 478 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:03,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1890896320, now seen corresponding path program 462 times [2018-12-03 16:01:03,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:03,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:03,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:03,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:03,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:03,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:03,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:03,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:03,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:03,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:03,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:03,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:03,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:03,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:03,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:03,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:03,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:03,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:03,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:03,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:03,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:03,384 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:01:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:04,507 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:01:04,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:04,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:04,507 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:01:04,507 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:01:04,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:01:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-03 16:01:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:05,196 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:05,196 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:05,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:05,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:05,196 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:01:05,197 INFO L423 AbstractCegarLoop]: === Iteration 479 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:05,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1890898242, now seen corresponding path program 463 times [2018-12-03 16:01:05,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:05,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:05,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:05,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:05,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:05,266 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:05,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:05,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:05,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:05,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:05,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:05,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:05,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:05,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:05,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:05,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:05,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:05,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:05,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:05,421 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:06,470 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:01:06,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:06,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:06,470 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:01:06,471 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:01:06,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:01:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-12-03 16:01:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:01:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:01:06,931 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 16:01:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:06,931 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:01:06,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:01:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:06,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:06,932 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:06,932 INFO L423 AbstractCegarLoop]: === Iteration 480 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:06,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:06,932 INFO L82 PathProgramCache]: Analyzing trace with hash -752622594, now seen corresponding path program 464 times [2018-12-03 16:01:06,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:06,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:06,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:06,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:06,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:06,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:06,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:06,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:06,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:06,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:07,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:07,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:07,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:07,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:07,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:07,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:07,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:07,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:07,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:07,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:07,148 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 16:01:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:08,305 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:01:08,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:08,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:08,306 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:01:08,306 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:01:08,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:01:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 16:01:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:09,012 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:09,012 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:09,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:09,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:09,012 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:01:09,012 INFO L423 AbstractCegarLoop]: === Iteration 481 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:09,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash -752620672, now seen corresponding path program 465 times [2018-12-03 16:01:09,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:09,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:09,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:09,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:09,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:09,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:09,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:09,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:09,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:09,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:09,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:09,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:09,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:09,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:09,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:09,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:09,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:09,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:09,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:09,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:09,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:09,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:09,346 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:10,513 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:01:10,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:10,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:10,513 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:01:10,513 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:01:10,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:01:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:01:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:01:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:01:11,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:01:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:11,218 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:01:11,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:01:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:11,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:11,218 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:01:11,218 INFO L423 AbstractCegarLoop]: === Iteration 482 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:11,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash -752563012, now seen corresponding path program 466 times [2018-12-03 16:01:11,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:11,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:11,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:11,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:11,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:11,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:11,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:11,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:11,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:11,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:11,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:11,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:11,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:11,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:11,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:11,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:11,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:11,450 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:01:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:12,643 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:01:12,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:12,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:12,644 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:01:12,644 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:01:12,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:01:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 16:01:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:13,339 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:13,339 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:13,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:13,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:13,339 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:13,339 INFO L423 AbstractCegarLoop]: === Iteration 483 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:13,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash -752561090, now seen corresponding path program 467 times [2018-12-03 16:01:13,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:13,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:13,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:13,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:13,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:13,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:13,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:13,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:13,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:13,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:13,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:13,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:13,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:13,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:13,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:13,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:13,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:13,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:13,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:13,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:13,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:13,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:13,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:13,582 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:14,778 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:01:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:14,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:14,779 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:01:14,779 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:01:14,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:01:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:01:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:01:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:01:15,430 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:01:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:15,430 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:01:15,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:01:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:15,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:15,431 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:01:15,431 INFO L423 AbstractCegarLoop]: === Iteration 484 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:15,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash -750775552, now seen corresponding path program 468 times [2018-12-03 16:01:15,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:15,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:15,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:15,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:15,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:15,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:15,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:15,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:15,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:15,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:15,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:15,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:15,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:15,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:15,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:15,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:15,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:15,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:15,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:15,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:15,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:15,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:15,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:15,658 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:01:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:16,791 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:01:16,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:16,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:16,792 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:01:16,792 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:01:16,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:01:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-03 16:01:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:17,496 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:17,496 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:17,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:17,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:17,496 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:17,496 INFO L423 AbstractCegarLoop]: === Iteration 485 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:17,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:17,496 INFO L82 PathProgramCache]: Analyzing trace with hash -750773630, now seen corresponding path program 469 times [2018-12-03 16:01:17,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:17,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:17,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:17,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:17,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:17,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:17,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:17,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:17,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:17,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:17,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:17,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:17,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:17,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:17,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:17,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:17,730 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:18,882 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:01:18,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:18,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:18,882 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:01:18,882 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:01:18,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:01:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 16:01:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:01:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:01:19,579 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:01:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:19,579 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:01:19,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:01:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:19,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:19,579 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:19,580 INFO L423 AbstractCegarLoop]: === Iteration 486 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:19,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash -750715970, now seen corresponding path program 470 times [2018-12-03 16:01:19,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:19,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:19,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:19,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:19,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:19,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:19,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:19,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:19,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:19,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:19,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:19,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:19,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:19,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:19,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:19,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:19,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:19,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:19,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:19,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:19,801 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:01:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:20,872 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:01:20,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:20,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:20,873 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:01:20,873 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:01:20,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:01:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-03 16:01:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:21,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:21,582 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:21,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:21,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:21,583 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:21,583 INFO L423 AbstractCegarLoop]: === Iteration 487 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:21,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash -750714048, now seen corresponding path program 471 times [2018-12-03 16:01:21,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:21,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:21,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:21,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:21,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:21,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:21,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:21,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:21,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:21,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:21,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:21,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:21,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:21,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:21,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:21,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:21,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:21,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:21,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:21,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:21,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:21,819 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:22,829 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:01:22,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:22,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:22,830 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:01:22,830 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:01:22,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:01:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2018-12-03 16:01:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:01:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:01:23,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:01:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:23,434 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:01:23,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:01:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:23,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:23,434 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:01:23,434 INFO L423 AbstractCegarLoop]: === Iteration 488 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:23,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash -695364292, now seen corresponding path program 472 times [2018-12-03 16:01:23,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:23,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:23,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:23,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:23,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:23,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:23,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:23,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:23,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:23,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:23,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:23,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:23,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:23,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:23,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:23,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:23,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:23,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:23,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:23,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:23,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:23,664 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:01:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:24,860 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:01:24,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:24,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:24,861 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:01:24,861 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:01:24,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:01:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 16:01:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:25,576 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:25,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:25,577 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:25,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:25,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:25,577 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:25,577 INFO L423 AbstractCegarLoop]: === Iteration 489 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:25,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash -695362370, now seen corresponding path program 473 times [2018-12-03 16:01:25,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:25,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:25,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:25,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:25,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:25,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:25,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:25,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:25,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:25,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:25,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:25,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:25,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:25,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:25,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:25,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:25,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:25,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:25,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:25,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:25,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:25,790 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:27,003 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:01:27,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:27,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:27,004 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:01:27,004 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:01:27,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:01:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:01:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:01:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:01:27,685 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:01:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:27,685 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:01:27,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:01:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:27,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:27,686 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:27,686 INFO L423 AbstractCegarLoop]: === Iteration 490 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:27,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash -695304710, now seen corresponding path program 474 times [2018-12-03 16:01:27,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:27,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:27,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:27,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:27,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:27,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:27,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:27,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:27,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:27,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:27,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:27,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:27,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:27,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:27,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:27,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:27,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:27,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:27,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:27,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:27,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:27,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:27,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:27,922 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:01:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:29,116 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:01:29,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:29,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:29,116 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:01:29,117 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:01:29,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:01:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 16:01:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:29,815 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:29,815 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:29,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:29,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:29,815 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:29,816 INFO L423 AbstractCegarLoop]: === Iteration 491 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:29,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:29,816 INFO L82 PathProgramCache]: Analyzing trace with hash -695302788, now seen corresponding path program 475 times [2018-12-03 16:01:29,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:29,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:29,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:29,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:29,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:29,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:29,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:29,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:29,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:29,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:29,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:29,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:29,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:30,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:30,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:30,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:30,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:30,024 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:31,168 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:01:31,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:31,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:31,168 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:01:31,169 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:01:31,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:01:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:01:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:01:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:01:31,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:01:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:31,816 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:01:31,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:01:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:31,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:31,817 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:31,817 INFO L423 AbstractCegarLoop]: === Iteration 492 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:31,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash -693517250, now seen corresponding path program 476 times [2018-12-03 16:01:31,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:31,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:31,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:31,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:31,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:31,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:31,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:31,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:31,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:31,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:31,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:31,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:31,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:31,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:31,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:31,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:32,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:32,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:32,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:32,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:32,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:32,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:32,037 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:01:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:33,137 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:01:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:33,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:33,137 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:01:33,137 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:01:33,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:01:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-03 16:01:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:33,844 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:33,844 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:33,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:33,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:33,845 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:33,845 INFO L423 AbstractCegarLoop]: === Iteration 493 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:33,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash -693515328, now seen corresponding path program 477 times [2018-12-03 16:01:33,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:33,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:33,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:33,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:33,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:33,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:33,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:33,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:33,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:33,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:33,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:33,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:33,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:33,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:33,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:34,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:34,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:34,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:34,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:34,074 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:35,177 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:01:35,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:35,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:35,178 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:01:35,178 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:01:35,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:01:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 16:01:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:01:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:01:35,943 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:01:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:35,943 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:01:35,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:01:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:35,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:35,943 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:35,943 INFO L423 AbstractCegarLoop]: === Iteration 494 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:35,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash -693457668, now seen corresponding path program 478 times [2018-12-03 16:01:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:35,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:35,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:36,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:36,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:36,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:36,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:36,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:36,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:36,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:36,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:36,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:36,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:36,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:36,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:36,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:36,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:36,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:36,156 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:01:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:37,237 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:01:37,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:37,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:37,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:37,237 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:01:37,238 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:01:37,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:01:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-03 16:01:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:37,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:37,939 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:37,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:37,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:37,939 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:01:37,939 INFO L423 AbstractCegarLoop]: === Iteration 495 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:37,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash -693455746, now seen corresponding path program 479 times [2018-12-03 16:01:37,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:37,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:38,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:38,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:38,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:38,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:38,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:38,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:38,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:38,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:38,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:38,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:38,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:38,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:38,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:38,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:38,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:38,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:38,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:38,155 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:39,168 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:01:39,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:39,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:39,169 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:01:39,169 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:01:39,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:01:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:01:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:01:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:01:39,707 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:01:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:39,707 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:01:39,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:01:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:39,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:39,708 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:01:39,708 INFO L423 AbstractCegarLoop]: === Iteration 496 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:39,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1022384768, now seen corresponding path program 480 times [2018-12-03 16:01:39,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:39,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:39,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:39,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:39,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:39,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:39,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:39,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:39,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:39,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:39,782 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:39,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:39,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:39,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:39,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:40,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:40,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:40,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:40,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:40,090 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:01:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:41,170 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:01:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:41,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:41,171 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:01:41,171 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:01:41,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:01:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-03 16:01:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:41,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:41,891 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:41,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:41,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:41,891 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:41,891 INFO L423 AbstractCegarLoop]: === Iteration 497 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:41,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:41,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1022386690, now seen corresponding path program 481 times [2018-12-03 16:01:41,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:41,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:41,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:41,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:41,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:41,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:41,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:41,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:41,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:41,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:41,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:41,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:41,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:42,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:42,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:42,108 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:42,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:42,109 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:43,203 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:01:43,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:43,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:43,203 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:01:43,203 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:01:43,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:01:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:01:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:01:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:01:43,941 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:01:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:43,941 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:01:43,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:01:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:43,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:43,942 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:43,942 INFO L423 AbstractCegarLoop]: === Iteration 498 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:43,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1022444350, now seen corresponding path program 482 times [2018-12-03 16:01:43,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:43,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:43,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:43,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:43,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:44,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:44,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:44,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:44,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:44,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:44,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:44,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:44,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:44,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:44,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:44,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:44,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:44,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:44,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:44,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:44,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:44,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:44,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:44,172 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:01:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:45,187 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:01:45,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:45,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:45,188 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:01:45,188 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:01:45,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:01:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-12-03 16:01:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:45,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:45,960 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:45,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:45,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:45,961 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:45,961 INFO L423 AbstractCegarLoop]: === Iteration 499 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:45,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1022446272, now seen corresponding path program 483 times [2018-12-03 16:01:45,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:45,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:45,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:46,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:46,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:46,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:46,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:46,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:46,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:46,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:46,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:46,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:46,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:46,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:46,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:46,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:46,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:46,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:46,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:46,205 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:47,186 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:01:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:47,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:47,187 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:01:47,187 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:01:47,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:01:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 16:01:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:01:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:01:47,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:01:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:47,862 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:01:47,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:01:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:47,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:47,862 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:47,862 INFO L423 AbstractCegarLoop]: === Iteration 500 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:47,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1024231810, now seen corresponding path program 484 times [2018-12-03 16:01:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:47,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:47,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:47,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:47,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:47,963 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:47,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:47,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:47,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:47,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:47,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:47,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:47,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:48,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:48,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:48,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:48,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:48,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:48,119 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:01:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:49,164 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:01:49,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:49,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:49,165 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:01:49,165 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:01:49,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:01:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-03 16:01:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:49,879 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:49,879 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:49,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:49,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:49,879 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:49,880 INFO L423 AbstractCegarLoop]: === Iteration 501 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:49,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1024233732, now seen corresponding path program 485 times [2018-12-03 16:01:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:49,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:49,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:49,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:49,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:49,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:49,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:49,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:49,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:49,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:49,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:49,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:49,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:49,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:49,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:50,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:50,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:50,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:50,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:50,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:50,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:50,104 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:51,166 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:01:51,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:51,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:51,166 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:01:51,166 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:01:51,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:01:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:01:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:01:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:01:51,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:01:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:51,864 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:01:51,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:01:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:51,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:51,865 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:51,865 INFO L423 AbstractCegarLoop]: === Iteration 502 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:51,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1024291392, now seen corresponding path program 486 times [2018-12-03 16:01:51,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:51,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:51,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:51,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:51,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:51,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:51,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:51,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:51,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:51,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:51,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:51,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:51,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:51,947 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:51,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:51,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:51,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:52,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:52,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:52,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:52,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:52,087 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:01:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:53,100 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:01:53,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:53,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:53,101 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:01:53,101 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:01:53,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:01:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-12-03 16:01:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:53,818 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:53,818 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:53,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:53,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:53,819 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:01:53,819 INFO L423 AbstractCegarLoop]: === Iteration 503 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:53,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1024293314, now seen corresponding path program 487 times [2018-12-03 16:01:53,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:53,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:53,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:53,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:53,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:53,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:53,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:53,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:53,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:53,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:53,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:53,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:53,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:53,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:54,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:54,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:54,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:54,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:54,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:54,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:54,047 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:55,038 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:01:55,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:55,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:55,038 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:01:55,038 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:01:55,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:01:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 16:01:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:01:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:01:55,665 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:01:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:55,665 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:01:55,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:01:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:55,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:55,665 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:01:55,666 INFO L423 AbstractCegarLoop]: === Iteration 504 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:55,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1079643070, now seen corresponding path program 488 times [2018-12-03 16:01:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:55,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:55,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:55,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:55,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:55,735 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:55,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:55,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:55,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:55,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:55,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:55,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:01:55,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:55,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:55,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:56,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:56,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:56,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:56,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:56,020 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:01:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:56,967 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:01:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:56,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:56,968 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:01:56,968 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:01:56,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:01:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-12-03 16:01:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:01:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:01:57,682 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:01:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:57,682 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:01:57,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:01:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:57,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:57,682 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:57,683 INFO L423 AbstractCegarLoop]: === Iteration 505 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:57,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:57,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1079644992, now seen corresponding path program 489 times [2018-12-03 16:01:57,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:57,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:57,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:57,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:57,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:57,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:57,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:57,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:57,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:57,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:57,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:57,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:57,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:57,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:57,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:57,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:57,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:57,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:57,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:57,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:57,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:57,899 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:01:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:58,851 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:01:58,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:01:58,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:01:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:58,852 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:01:58,852 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:01:58,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:01:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 16:01:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:01:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:01:59,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:01:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:59,560 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:01:59,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:01:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:01:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:01:59,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:59,561 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:01:59,561 INFO L423 AbstractCegarLoop]: === Iteration 506 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:59,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1079702652, now seen corresponding path program 490 times [2018-12-03 16:01:59,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:59,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:59,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:59,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:59,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:59,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:59,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:59,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:59,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:59,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:59,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:59,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:59,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:59,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:01:59,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:59,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:01:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:01:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:01:59,774 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:02:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:00,755 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:02:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:02:00,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:02:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:00,755 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:02:00,756 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:02:00,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:02:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-12-03 16:02:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:02:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:02:01,501 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:02:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:01,501 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:02:01,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:02:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:02:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:02:01,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:01,501 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:02:01,501 INFO L423 AbstractCegarLoop]: === Iteration 507 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:01,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1079704574, now seen corresponding path program 491 times [2018-12-03 16:02:01,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:01,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:01,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:01,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:01,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:01,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:01,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:01,569 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:01,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:01,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:01,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:01,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:01,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:01,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:02:01,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:01,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:01,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:01,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:01,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:02:01,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:01,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:02:01,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:02:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:01,722 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:02:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:02,631 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:02:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:02:02,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:02:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:02,631 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:02:02,631 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:02:02,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:02:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-12-03 16:02:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:02:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:02:03,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:02:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:03,297 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:02:03,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:02:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:02:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:02:03,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:03,298 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:02:03,298 INFO L423 AbstractCegarLoop]: === Iteration 508 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:03,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1081490112, now seen corresponding path program 492 times [2018-12-03 16:02:03,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:03,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:03,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:03,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:03,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:03,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:03,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:03,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:03,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:03,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:03,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:03,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:03,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:03,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:03,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:03,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:03,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:03,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:03,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:02:03,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:03,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:02:03,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:02:03,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:03,519 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:02:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:04,429 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:02:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:02:04,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:02:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:04,429 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:02:04,429 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:02:04,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:02:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-12-03 16:02:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:02:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:02:05,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:02:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:05,151 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:02:05,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:02:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:02:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:02:05,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:05,151 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:02:05,151 INFO L423 AbstractCegarLoop]: === Iteration 509 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:05,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:05,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1081492034, now seen corresponding path program 493 times [2018-12-03 16:02:05,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:05,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:05,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:05,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:05,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:05,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:05,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:05,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:05,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:05,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:05,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:05,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:05,230 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:05,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:05,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:05,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:05,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:02:05,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:05,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:02:05,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:02:05,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:05,377 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:02:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:06,245 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:02:06,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:02:06,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:02:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:06,246 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:02:06,246 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:02:06,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:06,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:02:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-12-03 16:02:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:02:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:02:06,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:02:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:06,953 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:02:06,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:02:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:02:06,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:02:06,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:06,953 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:02:06,954 INFO L423 AbstractCegarLoop]: === Iteration 510 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:06,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:06,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1081549694, now seen corresponding path program 494 times [2018-12-03 16:02:06,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:06,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:06,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:07,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:07,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:07,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:07,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:07,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:07,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:07,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:07,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:07,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:02:07,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:07,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:07,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:07,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:07,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:02:07,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:07,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:02:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:02:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:07,166 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:02:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:08,034 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:02:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:02:08,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:02:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:08,034 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:02:08,034 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:02:08,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:02:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-03 16:02:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:02:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:02:08,753 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:02:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:08,753 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:02:08,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:02:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:02:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:02:08,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:08,754 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:02:08,754 INFO L423 AbstractCegarLoop]: === Iteration 511 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:08,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:08,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1081551616, now seen corresponding path program 8 times [2018-12-03 16:02:08,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:08,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:08,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:08,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:08,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:08,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:08,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:08,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:08,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:08,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:08,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:08,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:08,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:02:08,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:08,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:08,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:08,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:08,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:02:08,973 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:08,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:02:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:02:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:08,973 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:02:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:09,821 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:02:09,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:02:09,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:02:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:09,822 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:02:09,822 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:02:09,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:02:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:02:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-12-03 16:02:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:02:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:02:10,250 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 11 [2018-12-03 16:02:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:10,250 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:02:10,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:02:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:02:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:10,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:10,251 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 16:02:10,251 INFO L423 AbstractCegarLoop]: === Iteration 512 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:10,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1450400680, now seen corresponding path program 9 times [2018-12-03 16:02:10,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:10,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:10,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:10,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:10,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:10,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:10,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:10,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:10,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:10,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:10,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:10,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:10,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:10,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:10,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:10,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:10,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:10,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:10,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:10,558 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 12 states. [2018-12-03 16:02:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:12,478 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 16:02:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:12,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:12,479 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:02:12,479 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:02:12,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:02:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 16:02:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:13,333 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:13,333 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:13,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:13,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:13,333 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 16:02:13,334 INFO L423 AbstractCegarLoop]: === Iteration 513 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:13,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:13,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1450402602, now seen corresponding path program 495 times [2018-12-03 16:02:13,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:13,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:13,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:13,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:13,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:13,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:13,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:13,411 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:13,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:13,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:13,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:13,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:13,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:13,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:13,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:13,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:13,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:13,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:13,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:13,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:13,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:13,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:13,584 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:02:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:15,380 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:02:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:15,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:15,380 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:02:15,380 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:02:15,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:02:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:02:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:02:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:02:16,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:02:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:16,269 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:02:16,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:02:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:16,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:16,269 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 16:02:16,269 INFO L423 AbstractCegarLoop]: === Iteration 514 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:16,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1450460262, now seen corresponding path program 496 times [2018-12-03 16:02:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:16,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:16,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:16,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:16,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:16,445 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:16,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:16,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:16,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:16,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:16,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:16,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:16,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:16,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:16,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:16,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:16,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:16,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:16,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:16,737 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:02:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:18,592 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 16:02:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:18,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:18,592 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:02:18,592 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:02:18,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:02:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 16:02:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:19,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:19,457 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:19,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:19,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:19,457 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:02:19,457 INFO L423 AbstractCegarLoop]: === Iteration 515 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:19,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1450462184, now seen corresponding path program 497 times [2018-12-03 16:02:19,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:19,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:19,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:19,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:19,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:19,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:19,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:19,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:19,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:19,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:19,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:19,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:02:19,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:19,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:19,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:19,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:19,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:19,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:19,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:19,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:19,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:19,804 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:02:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:21,572 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:02:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:21,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:21,573 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:02:21,573 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:02:21,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:02:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-12-03 16:02:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:02:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:02:22,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:02:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:22,378 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:02:22,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:02:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:22,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:22,378 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 16:02:22,379 INFO L423 AbstractCegarLoop]: === Iteration 516 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:22,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1452247722, now seen corresponding path program 498 times [2018-12-03 16:02:22,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:22,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:22,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:22,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:22,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:22,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:22,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:22,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:22,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:22,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:22,462 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:22,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:22,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:22,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:22,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:22,631 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:22,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:22,632 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:02:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:24,422 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:02:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:24,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:24,422 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:02:24,422 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:02:24,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:02:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-12-03 16:02:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:25,283 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:25,284 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:25,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:25,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:25,284 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:02:25,284 INFO L423 AbstractCegarLoop]: === Iteration 517 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:25,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1452249644, now seen corresponding path program 499 times [2018-12-03 16:02:25,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:25,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:25,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:25,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:25,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:25,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:25,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:25,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:25,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:25,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:25,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:25,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:25,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:25,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:25,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:25,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:25,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:25,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:25,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:25,534 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:02:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:27,267 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:02:27,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:27,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:27,267 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:02:27,267 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:02:27,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:02:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-03 16:02:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:02:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:02:28,125 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:02:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:28,126 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:02:28,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:02:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:28,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:28,126 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:02:28,126 INFO L423 AbstractCegarLoop]: === Iteration 518 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:28,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1452307304, now seen corresponding path program 500 times [2018-12-03 16:02:28,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:28,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:28,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:28,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:28,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:28,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:28,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:28,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:28,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 518 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 518 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:28,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:28,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:28,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:02:28,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:28,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:28,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:28,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:28,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:28,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:28,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:28,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:28,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:28,397 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:02:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:30,080 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:02:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:30,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:30,081 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:02:30,081 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:02:30,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:02:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 16:02:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:30,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:30,944 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:30,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:30,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:30,945 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:02:30,945 INFO L423 AbstractCegarLoop]: === Iteration 519 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:30,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1452309226, now seen corresponding path program 501 times [2018-12-03 16:02:30,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:30,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:30,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:30,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:30,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:31,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:31,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:31,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:31,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:31,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:31,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 519 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 519 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:31,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:31,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:31,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:31,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:31,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:31,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:31,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:31,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:31,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:31,189 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:02:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:32,793 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:02:32,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:32,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:32,794 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:02:32,794 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:02:32,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:02:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2018-12-03 16:02:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:02:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:02:33,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 16:02:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:33,584 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:02:33,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:02:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:33,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:33,584 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 16:02:33,585 INFO L423 AbstractCegarLoop]: === Iteration 520 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:33,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1507658982, now seen corresponding path program 502 times [2018-12-03 16:02:33,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:33,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:33,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:33,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:33,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:33,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:33,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:33,659 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:33,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:33,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:33,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 520 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 520 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:33,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:33,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:33,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:33,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:33,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:33,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:33,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:33,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:33,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:33,817 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 16:02:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:35,681 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 16:02:35,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:35,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:35,682 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:02:35,682 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:02:35,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:02:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 16:02:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:36,552 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:36,552 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:36,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:36,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:36,552 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:02:36,552 INFO L423 AbstractCegarLoop]: === Iteration 521 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:36,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:36,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1507660904, now seen corresponding path program 503 times [2018-12-03 16:02:36,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:36,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:36,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:36,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:36,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:36,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:36,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:36,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:36,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 521 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 521 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:36,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:36,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:36,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:02:36,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:36,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:36,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:36,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:36,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:36,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:36,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:36,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:36,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:36,794 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:02:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:38,576 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:02:38,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:38,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:38,576 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:02:38,576 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:02:38,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:02:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:02:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:02:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:02:39,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:02:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:39,426 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:02:39,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:02:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:39,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:39,426 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:02:39,426 INFO L423 AbstractCegarLoop]: === Iteration 522 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:39,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:39,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1507718564, now seen corresponding path program 504 times [2018-12-03 16:02:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:39,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:39,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:39,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:39,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:39,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:39,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:39,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:39,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 522 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 522 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:39,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:39,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:39,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:39,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:39,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:39,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:39,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:39,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:39,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:39,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:39,666 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:02:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:41,597 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 16:02:41,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:41,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:41,598 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:02:41,598 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:02:41,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:02:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 16:02:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:42,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:42,470 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:42,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:42,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:42,471 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:02:42,471 INFO L423 AbstractCegarLoop]: === Iteration 523 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:42,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:42,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1507720486, now seen corresponding path program 505 times [2018-12-03 16:02:42,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:42,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:42,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:42,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:42,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:42,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:42,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:42,578 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:42,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:42,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:42,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 523 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 523 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:42,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:42,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:42,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:42,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:42,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:42,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:42,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:42,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:42,740 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:02:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:44,538 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:02:44,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:44,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:44,538 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:02:44,538 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:02:44,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:02:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-12-03 16:02:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:02:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:02:45,354 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:02:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:45,354 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:02:45,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:02:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:45,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:45,354 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:02:45,354 INFO L423 AbstractCegarLoop]: === Iteration 524 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:45,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:45,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1509506024, now seen corresponding path program 506 times [2018-12-03 16:02:45,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:45,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:45,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:45,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:45,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:45,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:45,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:45,434 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:45,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:45,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:45,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 524 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 524 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:45,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:45,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:45,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:02:45,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:45,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:45,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:45,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:45,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:45,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:45,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:45,601 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:02:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:47,378 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:02:47,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:47,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:47,378 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:02:47,379 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:02:47,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:02:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-12-03 16:02:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:48,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:48,245 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:48,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:48,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:48,246 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:02:48,246 INFO L423 AbstractCegarLoop]: === Iteration 525 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:48,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1509507946, now seen corresponding path program 507 times [2018-12-03 16:02:48,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:48,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:48,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:48,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:48,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:48,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:48,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:48,324 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:48,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:48,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:48,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 525 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 525 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:48,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:48,334 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:48,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:48,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:48,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:48,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:48,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:48,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:48,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:48,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:48,491 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:02:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:50,225 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:02:50,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:50,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:50,225 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:02:50,225 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:02:50,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:02:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-03 16:02:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:02:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:02:51,075 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:02:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:51,076 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:02:51,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:02:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:51,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:51,076 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:02:51,076 INFO L423 AbstractCegarLoop]: === Iteration 526 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:51,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1509565606, now seen corresponding path program 508 times [2018-12-03 16:02:51,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:51,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:51,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:51,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:51,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:51,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:51,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:51,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:51,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 526 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 526 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:51,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:51,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:51,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:51,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:51,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:51,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:51,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:51,322 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:02:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:52,993 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:02:52,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:52,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:52,993 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:02:52,993 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:02:52,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:02:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 16:02:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:53,882 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:53,882 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:53,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:53,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:53,883 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:02:53,883 INFO L423 AbstractCegarLoop]: === Iteration 527 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:53,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1509567528, now seen corresponding path program 509 times [2018-12-03 16:02:53,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:53,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:53,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:53,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:53,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:53,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:53,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:53,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:53,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:53,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:53,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 527 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 527 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:53,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:53,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:53,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:02:53,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:53,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:53,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:54,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:54,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:54,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:54,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:54,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:54,142 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:02:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:55,758 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:02:55,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:55,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:55,759 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:02:55,759 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:02:55,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:02:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 17. [2018-12-03 16:02:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:02:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:02:56,456 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 12 [2018-12-03 16:02:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:56,456 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:02:56,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:02:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:56,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:56,457 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 16:02:56,457 INFO L423 AbstractCegarLoop]: === Iteration 528 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:56,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1069559254, now seen corresponding path program 510 times [2018-12-03 16:02:56,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:56,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:56,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:56,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:56,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:56,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:56,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:56,537 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:56,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:56,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:56,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 528 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 528 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:56,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:56,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:56,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:56,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:56,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:56,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:56,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:56,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:56,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:56,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:56,709 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 12 states. [2018-12-03 16:02:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:58,396 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:02:58,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:02:58,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:02:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:58,396 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:02:58,397 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:02:58,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:02:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 16:02:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:02:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:02:59,369 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:02:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:59,370 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:02:59,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:02:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:02:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:02:59,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:59,370 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:02:59,370 INFO L423 AbstractCegarLoop]: === Iteration 529 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:59,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1069557332, now seen corresponding path program 511 times [2018-12-03 16:02:59,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:59,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:59,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:59,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:59,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:59,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:59,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:59,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:59,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:59,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:59,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 529 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 529 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:59,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:59,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:59,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:59,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:59,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:59,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:02:59,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:59,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:02:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:02:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:02:59,620 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:01,274 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:03:01,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:01,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:01,275 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:03:01,275 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:03:01,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:03:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 16:03:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:03:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:03:02,134 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:03:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:02,134 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:03:02,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:03:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:02,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:02,134 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:03:02,134 INFO L423 AbstractCegarLoop]: === Iteration 530 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:02,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1069499672, now seen corresponding path program 512 times [2018-12-03 16:03:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:02,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:02,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:02,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:02,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:02,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:02,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:02,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:02,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 530 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 530 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:02,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:02,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:03:02,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:02,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:02,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:02,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:02,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:02,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:02,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:02,388 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:03:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:04,001 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:03:04,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:04,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:04,002 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:03:04,002 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:03:04,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:03:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 16:03:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:04,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:04,886 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:04,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:04,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:04,886 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:04,886 INFO L423 AbstractCegarLoop]: === Iteration 531 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:04,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1069497750, now seen corresponding path program 513 times [2018-12-03 16:03:04,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:04,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:04,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:04,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:04,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:04,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:04,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:04,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:04,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:04,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:04,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 531 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 531 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:04,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:04,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:04,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:04,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:04,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:04,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:05,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:05,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:05,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:05,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:05,126 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:06,694 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:03:06,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:06,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:06,695 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:03:06,695 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:03:06,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:03:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 16:03:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:03:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:03:07,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:03:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:07,521 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:03:07,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:03:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:07,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:07,521 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:03:07,521 INFO L423 AbstractCegarLoop]: === Iteration 532 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:07,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:07,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1067712212, now seen corresponding path program 514 times [2018-12-03 16:03:07,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:07,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:07,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:07,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:07,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:07,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:07,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:07,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:07,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:07,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:07,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 532 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 532 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:07,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:07,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:07,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:07,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:07,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:07,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:07,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:07,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:07,852 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:03:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:09,543 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:03:09,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:09,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:09,543 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:03:09,544 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:03:09,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:03:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 16:03:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:10,419 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:10,419 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:10,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:10,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:10,420 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:10,420 INFO L423 AbstractCegarLoop]: === Iteration 533 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:10,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1067710290, now seen corresponding path program 515 times [2018-12-03 16:03:10,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:10,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:10,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:10,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:10,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:10,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:10,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:10,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:10,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 533 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 533 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:10,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:10,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:10,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:03:10,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:10,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:10,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:10,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:10,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:10,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:10,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:10,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:10,682 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:12,329 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:03:12,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:12,329 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:12,330 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:03:12,330 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:03:12,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:12,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:03:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 16:03:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:03:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:03:13,206 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:03:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:13,206 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:03:13,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:03:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:13,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:13,207 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:13,207 INFO L423 AbstractCegarLoop]: === Iteration 534 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:13,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1067652630, now seen corresponding path program 516 times [2018-12-03 16:03:13,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:13,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:13,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:13,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:13,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:13,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:13,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:13,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:13,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 534 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 534 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:13,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:13,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:13,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:13,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:13,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:13,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:13,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:13,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:13,445 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:13,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:13,445 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:03:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:15,030 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:03:15,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:15,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:15,031 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:03:15,031 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:03:15,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:03:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 16:03:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:15,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:15,909 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:15,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:15,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:15,910 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:03:15,910 INFO L423 AbstractCegarLoop]: === Iteration 535 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:15,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:15,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1067650708, now seen corresponding path program 517 times [2018-12-03 16:03:15,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:15,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:15,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:15,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:16,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:16,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:16,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:16,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:16,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:16,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 535 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 535 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:16,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:16,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:16,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:16,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:16,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:16,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:16,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:16,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:16,302 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:17,858 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:03:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:17,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:17,859 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:03:17,859 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:03:17,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:03:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 18. [2018-12-03 16:03:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:03:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:03:18,632 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 16:03:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:18,632 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:03:18,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:03:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:18,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:18,633 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:03:18,633 INFO L423 AbstractCegarLoop]: === Iteration 536 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:18,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:18,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1012300952, now seen corresponding path program 518 times [2018-12-03 16:03:18,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:18,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:18,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:18,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:18,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:18,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:18,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:18,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:18,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:18,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:18,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 536 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 536 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:18,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:18,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:18,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:03:18,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:18,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:18,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:18,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:18,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:18,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:18,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:18,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:18,921 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 16:03:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:20,470 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:03:20,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:20,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:20,470 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:03:20,470 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:03:20,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:03:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 16:03:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:21,356 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:21,356 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:21,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:21,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:21,356 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:21,357 INFO L423 AbstractCegarLoop]: === Iteration 537 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:21,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:21,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1012299030, now seen corresponding path program 519 times [2018-12-03 16:03:21,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:21,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:21,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:21,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:21,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:21,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:21,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:21,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:21,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:21,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:21,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 537 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 537 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:21,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:21,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:21,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:21,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:21,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:21,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:21,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:21,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:21,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:21,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:21,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:21,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:21,592 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:23,069 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:03:23,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:23,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:23,070 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:03:23,070 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:03:23,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:03:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 16:03:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:03:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:03:24,073 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:03:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:24,073 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:03:24,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:03:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:24,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:24,073 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:24,073 INFO L423 AbstractCegarLoop]: === Iteration 538 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:24,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1012241370, now seen corresponding path program 520 times [2018-12-03 16:03:24,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:24,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:24,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:24,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:24,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:24,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:24,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:24,148 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:24,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:24,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:24,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 538 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 538 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:24,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:24,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:24,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:24,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:24,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:24,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:24,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:24,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:24,339 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:03:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:25,891 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:03:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:25,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:25,892 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:03:25,892 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:03:25,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:03:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 16:03:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:26,779 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:26,779 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:26,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:26,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:26,780 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:03:26,780 INFO L423 AbstractCegarLoop]: === Iteration 539 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:26,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1012239448, now seen corresponding path program 521 times [2018-12-03 16:03:26,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:26,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:26,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:26,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:26,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:26,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:26,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:26,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:26,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:26,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:26,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 539 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 539 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:26,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:26,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:26,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:03:26,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:26,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:26,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:27,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:27,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:27,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:27,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:27,026 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:28,566 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:03:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:28,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:28,566 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:03:28,566 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:03:28,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:03:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:03:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:03:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:03:29,399 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:03:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:29,399 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:03:29,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:03:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:29,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:29,399 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:29,400 INFO L423 AbstractCegarLoop]: === Iteration 540 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:29,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1010453910, now seen corresponding path program 522 times [2018-12-03 16:03:29,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:29,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:29,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:29,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:29,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:29,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:29,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:29,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:29,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 540 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 540 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:29,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:29,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:29,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:29,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:29,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:29,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:29,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:29,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:29,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:29,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:29,636 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:03:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:31,073 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:03:31,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:31,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:31,074 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:03:31,074 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:03:31,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:03:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-12-03 16:03:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:31,961 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:31,961 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:31,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:31,961 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:31,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:31,961 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:03:31,962 INFO L423 AbstractCegarLoop]: === Iteration 541 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:31,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:31,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1010451988, now seen corresponding path program 523 times [2018-12-03 16:03:31,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:31,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:31,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:32,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:32,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:32,038 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:32,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:32,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:32,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 541 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 541 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:32,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:32,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:32,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:32,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:32,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:32,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:32,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:32,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:32,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:32,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:32,212 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:33,683 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:03:33,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:33,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:33,683 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:03:33,683 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:03:33,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:03:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 16:03:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:03:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:03:34,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:03:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:34,552 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:03:34,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:03:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:34,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:34,553 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:03:34,553 INFO L423 AbstractCegarLoop]: === Iteration 542 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:34,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1010394328, now seen corresponding path program 524 times [2018-12-03 16:03:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:34,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:34,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:34,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:34,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:34,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:34,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:34,629 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:34,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:34,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:34,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 542 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 542 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:34,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:34,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:34,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:03:34,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:34,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:34,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:34,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:34,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:34,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:34,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:34,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:34,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:34,794 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:03:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:36,221 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:03:36,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:36,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:36,222 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:03:36,222 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:03:36,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:03:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-12-03 16:03:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:37,107 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:37,107 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:37,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:37,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:37,108 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:03:37,108 INFO L423 AbstractCegarLoop]: === Iteration 543 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:37,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1010392406, now seen corresponding path program 525 times [2018-12-03 16:03:37,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:37,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:37,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:37,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:37,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:37,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:37,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:37,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:37,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 543 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 543 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:37,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:37,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:37,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:37,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:37,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:37,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:37,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:37,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:37,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:37,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:37,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:37,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:37,359 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:38,715 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:03:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:38,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:38,716 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:03:38,716 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:03:38,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:03:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 16. [2018-12-03 16:03:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:03:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:03:39,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 12 [2018-12-03 16:03:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:39,362 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:03:39,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:03:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:39,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:39,363 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 16:03:39,363 INFO L423 AbstractCegarLoop]: === Iteration 544 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:39,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:39,363 INFO L82 PathProgramCache]: Analyzing trace with hash 641054054, now seen corresponding path program 526 times [2018-12-03 16:03:39,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:39,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:39,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:39,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:39,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:39,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:39,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:39,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:39,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:39,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:39,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 544 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 544 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:39,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:39,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:39,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:39,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:39,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:39,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:39,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:39,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:39,630 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 12 states. [2018-12-03 16:03:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:41,634 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 16:03:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:41,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:41,635 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:03:41,635 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:03:41,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:03:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 16:03:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:42,572 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:42,572 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:42,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:42,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:42,573 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:03:42,573 INFO L423 AbstractCegarLoop]: === Iteration 545 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:42,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash 641055976, now seen corresponding path program 527 times [2018-12-03 16:03:42,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:42,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:42,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:42,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:42,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:42,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:42,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:42,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:42,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 545 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 545 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:42,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:42,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:42,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:03:42,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:42,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:42,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:42,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:42,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:42,826 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:42,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:42,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:42,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:42,827 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:44,666 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:03:44,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:44,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:44,666 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:03:44,666 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:03:44,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:03:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:03:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:03:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:03:45,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:03:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:45,559 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:03:45,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:03:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:45,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:45,560 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:03:45,560 INFO L423 AbstractCegarLoop]: === Iteration 546 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:45,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:45,560 INFO L82 PathProgramCache]: Analyzing trace with hash 641113636, now seen corresponding path program 528 times [2018-12-03 16:03:45,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:45,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:45,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:45,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:45,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:45,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:45,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:45,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:45,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:45,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:45,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 546 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 546 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:45,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:45,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:45,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:45,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:45,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:45,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:45,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:45,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:45,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:45,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:45,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:45,807 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:03:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:47,745 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 16:03:47,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:47,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:47,746 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:03:47,746 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:03:47,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:03:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 16:03:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:48,660 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:48,660 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:48,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:48,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:48,660 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:48,660 INFO L423 AbstractCegarLoop]: === Iteration 547 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:48,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash 641115558, now seen corresponding path program 529 times [2018-12-03 16:03:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:48,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:48,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:48,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:48,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:48,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:48,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:48,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:48,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:48,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:48,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 547 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 547 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:48,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:48,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:48,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:48,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:48,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:48,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:48,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:48,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:48,945 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:50,802 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:03:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:50,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:50,802 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:03:50,802 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:03:50,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:03:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-12-03 16:03:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:03:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:03:51,653 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:03:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:51,653 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:03:51,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:03:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:51,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:51,654 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:03:51,654 INFO L423 AbstractCegarLoop]: === Iteration 548 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:51,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:51,654 INFO L82 PathProgramCache]: Analyzing trace with hash 642901096, now seen corresponding path program 530 times [2018-12-03 16:03:51,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:51,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:51,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:51,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:51,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:51,728 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:51,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:51,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:51,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 548 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 548 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:51,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:51,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:51,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:03:51,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:51,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:51,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:51,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:51,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:51,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:51,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:51,901 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:03:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:53,712 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:03:53,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:53,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:53,713 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:03:53,713 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:03:53,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:03:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-12-03 16:03:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:03:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:03:54,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:03:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:54,628 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:03:54,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:03:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:54,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:54,628 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:54,628 INFO L423 AbstractCegarLoop]: === Iteration 549 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:54,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash 642903018, now seen corresponding path program 531 times [2018-12-03 16:03:54,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:54,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:54,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:54,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:54,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:54,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:54,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:54,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:54,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:54,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 549 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 549 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:54,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:54,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:54,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:54,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:54,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:54,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:54,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:54,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:54,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:54,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:54,872 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:03:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:56,660 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:03:56,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:56,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:56,661 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:03:56,661 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:03:56,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:03:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-03 16:03:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:03:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:03:57,571 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:03:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:57,572 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:03:57,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:03:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:03:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:03:57,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:57,572 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:03:57,572 INFO L423 AbstractCegarLoop]: === Iteration 550 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:57,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash 642960678, now seen corresponding path program 532 times [2018-12-03 16:03:57,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:57,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:57,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:57,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:57,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:57,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:57,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:57,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:57,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:57,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:57,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 550 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 550 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:57,754 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:57,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:57,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:57,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:57,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:03:57,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:57,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:03:57,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:03:57,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:57,914 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:03:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:59,746 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:03:59,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:03:59,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:03:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:59,746 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:03:59,746 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:03:59,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:03:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:04:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 16:04:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:00,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:00,663 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:00,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:00,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:00,664 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:00,664 INFO L423 AbstractCegarLoop]: === Iteration 551 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:00,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 642962600, now seen corresponding path program 533 times [2018-12-03 16:04:00,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:00,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:00,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:00,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:00,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:00,740 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:00,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:00,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:00,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 551 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 551 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:00,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:00,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:00,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:04:00,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:00,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:00,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:00,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:00,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:00,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:00,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:00,904 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:02,566 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:04:02,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:02,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:02,567 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:04:02,567 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:04:02,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:04:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2018-12-03 16:04:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:04:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:04:03,390 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 16:04:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:03,390 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:04:03,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:04:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:03,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:03,391 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:04:03,391 INFO L423 AbstractCegarLoop]: === Iteration 552 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:03,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:03,391 INFO L82 PathProgramCache]: Analyzing trace with hash 698312356, now seen corresponding path program 534 times [2018-12-03 16:04:03,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:03,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:03,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:03,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:03,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:03,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:03,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:03,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:03,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:03,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:03,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 552 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 552 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:03,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:03,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:03,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:03,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:03,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:03,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:03,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:03,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:03,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:03,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:03,647 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 16:04:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:05,589 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 16:04:05,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:05,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:05,589 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:04:05,589 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:04:05,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:04:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 16:04:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:06,554 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:06,554 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:06,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:06,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:06,554 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:04:06,554 INFO L423 AbstractCegarLoop]: === Iteration 553 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:06,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 698314278, now seen corresponding path program 535 times [2018-12-03 16:04:06,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:06,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:06,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:06,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:06,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:06,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:06,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:06,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:06,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 553 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 553 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:06,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:06,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:06,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:06,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:06,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:06,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:06,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:06,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:06,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:06,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:06,806 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:08,715 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:04:08,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:08,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:08,716 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:04:08,716 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:04:08,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:04:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:04:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:04:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:04:09,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:04:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:09,617 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:04:09,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:04:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:09,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:09,617 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:04:09,617 INFO L423 AbstractCegarLoop]: === Iteration 554 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:09,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash 698371938, now seen corresponding path program 536 times [2018-12-03 16:04:09,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:09,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:09,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:09,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:09,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:09,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:09,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:09,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:09,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 554 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 554 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:09,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:09,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:09,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:04:09,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:09,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:09,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:09,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:09,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:09,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:09,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:09,873 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:04:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:11,857 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 16:04:11,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:11,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:11,857 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:04:11,857 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:04:11,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:04:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 16:04:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:12,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:12,776 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:12,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:12,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:12,777 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:12,777 INFO L423 AbstractCegarLoop]: === Iteration 555 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:12,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash 698373860, now seen corresponding path program 537 times [2018-12-03 16:04:12,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:12,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:12,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:12,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:12,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:12,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:12,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:12,851 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:12,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:12,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:12,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 555 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 555 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:12,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:12,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:12,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:12,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:12,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:12,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:13,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:13,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:13,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:13,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:13,026 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:14,928 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:04:14,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:14,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:14,929 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:04:14,929 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:04:14,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:04:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-12-03 16:04:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:04:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:04:15,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:04:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:15,788 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:04:15,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:04:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:15,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:15,788 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:04:15,788 INFO L423 AbstractCegarLoop]: === Iteration 556 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:15,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:15,788 INFO L82 PathProgramCache]: Analyzing trace with hash 700159398, now seen corresponding path program 538 times [2018-12-03 16:04:15,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:15,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:15,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:15,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:15,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:15,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:15,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:15,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:15,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:15,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:15,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 556 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 556 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:15,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:15,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:15,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:15,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:16,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:16,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:16,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:16,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:16,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:16,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:16,048 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:04:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:17,921 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:04:17,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:17,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:17,921 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:04:17,921 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:04:17,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:04:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-12-03 16:04:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:18,836 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:18,836 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:18,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:18,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:18,837 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:18,837 INFO L423 AbstractCegarLoop]: === Iteration 557 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:18,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash 700161320, now seen corresponding path program 539 times [2018-12-03 16:04:18,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:18,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:18,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:18,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:18,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:18,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:18,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:18,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:18,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:18,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 557 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 557 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:18,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:18,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:18,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:04:18,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:18,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:18,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:19,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:19,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:19,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:19,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:19,076 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:20,938 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:04:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:20,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:20,939 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:04:20,939 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:04:20,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:04:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-03 16:04:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:04:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:04:21,839 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:04:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:21,839 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:04:21,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:04:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:21,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:21,839 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:21,840 INFO L423 AbstractCegarLoop]: === Iteration 558 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:21,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash 700218980, now seen corresponding path program 540 times [2018-12-03 16:04:21,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:21,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:21,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:21,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:21,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:21,912 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:21,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:21,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:21,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 558 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 558 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:21,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:21,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:21,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:21,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:21,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:21,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:22,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:22,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:22,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:22,109 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:04:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:23,869 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:04:23,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:23,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:23,869 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:04:23,869 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:04:23,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:04:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 16:04:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:24,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:24,796 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:24,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:24,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:24,796 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:24,797 INFO L423 AbstractCegarLoop]: === Iteration 559 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:24,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:24,797 INFO L82 PathProgramCache]: Analyzing trace with hash 700220902, now seen corresponding path program 541 times [2018-12-03 16:04:24,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:24,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:24,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:24,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:24,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:24,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:24,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:24,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:24,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:24,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:24,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 559 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 559 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:24,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:24,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:24,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:24,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:25,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:25,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:25,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:25,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:25,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:25,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:25,036 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:26,772 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:04:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:26,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:26,773 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:04:26,773 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:04:26,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:04:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 17. [2018-12-03 16:04:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:04:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:04:27,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 12 [2018-12-03 16:04:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:27,505 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:04:27,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:04:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:27,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:27,505 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:04:27,505 INFO L423 AbstractCegarLoop]: === Iteration 560 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:27,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1878905880, now seen corresponding path program 542 times [2018-12-03 16:04:27,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:27,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:27,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:27,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:27,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:27,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:27,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:27,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:27,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 560 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 560 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:27,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:27,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:27,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:04:27,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:27,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:27,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:27,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:27,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:27,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:27,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:27,767 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 12 states. [2018-12-03 16:04:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:29,541 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:04:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:29,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:29,541 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:04:29,541 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:04:29,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:04:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 16:04:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:30,474 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:30,474 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:30,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:30,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:30,475 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:04:30,475 INFO L423 AbstractCegarLoop]: === Iteration 561 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:30,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:30,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1878903958, now seen corresponding path program 543 times [2018-12-03 16:04:30,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:30,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:30,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:30,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:30,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:30,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:30,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:30,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:30,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:30,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 561 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 561 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:30,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:30,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:30,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:30,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:30,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:30,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:30,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:30,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:30,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:30,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:30,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:30,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:30,710 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:32,456 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:04:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:32,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:32,457 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:04:32,457 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:04:32,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:32,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:04:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 16:04:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:04:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:04:33,366 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:04:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:33,366 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:04:33,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:04:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:33,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:33,367 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:04:33,367 INFO L423 AbstractCegarLoop]: === Iteration 562 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:33,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1878846298, now seen corresponding path program 544 times [2018-12-03 16:04:33,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:33,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:33,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:33,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:33,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:33,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:33,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:33,445 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:33,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:33,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:33,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 562 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 562 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:33,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:33,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:33,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:33,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:33,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:33,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:33,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:33,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:33,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:33,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:33,616 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:04:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:35,306 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:04:35,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:35,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:35,307 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:04:35,307 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:04:35,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:04:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 16:04:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:36,262 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:36,263 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:36,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:36,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:36,263 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:36,263 INFO L423 AbstractCegarLoop]: === Iteration 563 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:36,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1878844376, now seen corresponding path program 545 times [2018-12-03 16:04:36,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:36,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:36,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:36,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:36,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:36,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:36,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:36,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:36,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:36,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:36,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 563 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 563 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:36,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:36,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:36,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:04:36,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:36,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:36,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:36,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:36,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:36,504 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:36,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:36,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:36,505 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:38,195 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:04:38,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:38,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:38,195 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:04:38,195 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:04:38,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:04:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 16:04:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:04:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:04:39,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:04:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:39,074 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:04:39,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:04:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:39,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:39,074 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:04:39,074 INFO L423 AbstractCegarLoop]: === Iteration 564 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:39,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1877058838, now seen corresponding path program 546 times [2018-12-03 16:04:39,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:39,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:39,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:39,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:39,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:39,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:39,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:39,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:39,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:39,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:39,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 564 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 564 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:39,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:39,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:39,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:39,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:39,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:39,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:39,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:39,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:39,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:39,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:39,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:39,320 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:04:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:41,163 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:04:41,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:41,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:41,164 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:04:41,164 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:04:41,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:04:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 16:04:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:42,100 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:42,100 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:42,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:42,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:42,101 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:42,101 INFO L423 AbstractCegarLoop]: === Iteration 565 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:42,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1877056916, now seen corresponding path program 547 times [2018-12-03 16:04:42,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:42,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:42,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:42,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:42,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:42,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:42,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:42,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:42,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 565 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 565 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:42,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:42,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:42,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:42,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:42,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:42,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:42,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:42,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:42,358 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:44,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:44,097 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:04:44,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:44,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:44,097 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:04:44,097 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:04:44,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:04:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 16:04:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:04:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:04:45,013 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:04:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:45,013 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:04:45,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:04:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:45,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:45,013 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:45,013 INFO L423 AbstractCegarLoop]: === Iteration 566 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:45,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1876999256, now seen corresponding path program 548 times [2018-12-03 16:04:45,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:45,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:45,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:45,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:45,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:45,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:45,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:45,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:45,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 566 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 566 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:45,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:45,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:45,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:04:45,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:45,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:45,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:45,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:45,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:45,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:45,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:45,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:45,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:45,283 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:04:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:46,969 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:04:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:46,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:46,969 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:04:46,969 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:04:46,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:04:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 16:04:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:47,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:47,899 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:47,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:47,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:47,899 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:47,899 INFO L423 AbstractCegarLoop]: === Iteration 567 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:47,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1876997334, now seen corresponding path program 549 times [2018-12-03 16:04:47,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:47,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:47,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:47,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:47,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:47,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:47,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:47,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:47,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 567 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 567 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:47,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:47,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:47,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:47,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:47,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:48,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:48,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:48,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:48,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:48,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:48,135 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:49,838 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:04:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:49,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:49,838 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:04:49,838 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:04:49,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:04:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 18. [2018-12-03 16:04:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:04:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:04:50,659 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 16:04:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:50,659 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:04:50,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:04:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:50,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:50,659 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:04:50,659 INFO L423 AbstractCegarLoop]: === Iteration 568 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:50,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1821647578, now seen corresponding path program 550 times [2018-12-03 16:04:50,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:50,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:50,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:50,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:50,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:50,737 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:50,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:50,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:50,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 568 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 568 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:50,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:50,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:50,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:50,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:50,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:50,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:50,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:50,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:50,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:50,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:50,899 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 16:04:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:52,546 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:04:52,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:52,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:52,546 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:04:52,546 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:04:52,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:04:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 16:04:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:53,484 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:53,485 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:53,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:53,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:53,485 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:53,485 INFO L423 AbstractCegarLoop]: === Iteration 569 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:53,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:53,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1821645656, now seen corresponding path program 551 times [2018-12-03 16:04:53,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:53,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:53,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:53,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:53,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:53,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:53,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:53,558 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:53,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:53,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:53,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 569 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 569 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:53,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:53,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:53,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:04:53,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:53,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:53,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:53,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:53,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:53,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:53,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:53,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:53,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:53,719 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:04:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:55,304 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:04:55,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:55,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:55,305 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:04:55,305 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:04:55,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:04:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 16:04:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:04:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:04:56,219 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:04:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:56,220 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:04:56,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:04:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:56,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:56,220 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:56,220 INFO L423 AbstractCegarLoop]: === Iteration 570 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:56,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1821587996, now seen corresponding path program 552 times [2018-12-03 16:04:56,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:56,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:56,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:56,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:56,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:56,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:56,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:56,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:56,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 570 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 570 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:56,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:56,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:56,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:56,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:56,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:56,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:56,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:56,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:56,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:56,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:56,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:56,479 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:04:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:58,187 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:04:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:04:58,187 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:04:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:58,188 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:04:58,188 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:04:58,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:04:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 16:04:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:04:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:04:59,127 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:04:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:59,127 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:04:59,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:04:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:04:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:04:59,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:59,127 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:04:59,127 INFO L423 AbstractCegarLoop]: === Iteration 571 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:59,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1821586074, now seen corresponding path program 553 times [2018-12-03 16:04:59,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:59,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:59,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:59,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:59,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:59,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:59,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:59,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:59,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 571 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 571 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:59,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:59,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:59,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:59,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:59,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:04:59,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:59,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:04:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:04:59,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:04:59,378 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:00,941 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:05:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:00,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:00,942 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:05:00,942 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:05:00,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:05:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:05:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:05:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:05:01,815 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:05:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:01,815 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:05:01,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:05:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:01,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:01,816 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:05:01,816 INFO L423 AbstractCegarLoop]: === Iteration 572 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:01,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1819800536, now seen corresponding path program 554 times [2018-12-03 16:05:01,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:01,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:01,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:01,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:01,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:01,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:01,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:01,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:01,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 572 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 572 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:01,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:01,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:01,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:05:01,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:01,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:01,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:02,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:02,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:02,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:02,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:02,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:02,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:02,068 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:05:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:03,585 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:05:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:03,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:03,585 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:05:03,585 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:05:03,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:05:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-12-03 16:05:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:04,525 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:04,525 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:04,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:04,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:04,526 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:05:04,526 INFO L423 AbstractCegarLoop]: === Iteration 573 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:04,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1819798614, now seen corresponding path program 555 times [2018-12-03 16:05:04,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:04,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:04,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:04,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:04,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:04,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:04,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:04,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:04,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 573 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 573 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:04,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:04,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:04,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:04,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:04,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:04,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:04,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:04,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:04,757 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:04,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:04,758 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:06,317 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:05:06,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:06,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:06,317 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:05:06,317 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:05:06,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:05:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 16:05:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:05:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:05:07,267 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:05:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:07,267 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:05:07,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:05:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:07,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:07,267 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:05:07,267 INFO L423 AbstractCegarLoop]: === Iteration 574 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:07,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1819740954, now seen corresponding path program 556 times [2018-12-03 16:05:07,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:07,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:07,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:07,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:07,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:07,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:07,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:07,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:07,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:07,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:07,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 574 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 574 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:07,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:07,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:07,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:07,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:07,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:07,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:07,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:07,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:07,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:07,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:07,513 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:05:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:08,963 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:05:08,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:08,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:08,963 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:05:08,963 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:05:08,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:05:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-12-03 16:05:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:09,902 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:09,902 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:09,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:09,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:09,903 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:05:09,903 INFO L423 AbstractCegarLoop]: === Iteration 575 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:09,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1819739032, now seen corresponding path program 557 times [2018-12-03 16:05:09,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:09,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:09,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:09,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:09,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:09,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:09,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:09,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:09,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:09,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:09,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 575 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 575 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:09,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:09,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:09,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:05:09,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:09,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:09,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:10,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:10,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:10,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:10,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:10,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:10,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:10,163 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:11,542 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:05:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:11,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:11,543 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:05:11,543 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:05:11,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:11,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:05:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. [2018-12-03 16:05:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:05:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:05:12,161 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 12 [2018-12-03 16:05:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:12,161 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:05:12,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:05:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:12,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:12,161 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 16:05:12,161 INFO L423 AbstractCegarLoop]: === Iteration 576 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:12,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:12,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2130459050, now seen corresponding path program 558 times [2018-12-03 16:05:12,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:12,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:12,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:12,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:12,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:12,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:12,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:12,241 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:12,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:12,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:12,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 576 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 576 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:12,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:12,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:12,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:12,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:12,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:12,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:12,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:12,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:12,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:12,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:12,409 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 12 states. [2018-12-03 16:05:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:14,210 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:05:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:14,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:14,210 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:05:14,210 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:05:14,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:05:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 16:05:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:15,215 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:15,215 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:15,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:15,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:15,215 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:05:15,215 INFO L423 AbstractCegarLoop]: === Iteration 577 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:15,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2130460972, now seen corresponding path program 559 times [2018-12-03 16:05:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:15,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:15,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:15,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:15,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:15,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:15,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:15,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:15,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:15,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:15,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 577 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 577 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:15,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:15,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:15,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:15,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:15,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:15,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:15,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:15,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:15,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:15,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:15,454 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:17,257 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:05:17,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:17,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:17,257 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:05:17,258 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:05:17,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:05:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:05:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:05:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:05:18,234 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:05:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:18,234 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:05:18,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:05:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:18,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:18,235 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:05:18,235 INFO L423 AbstractCegarLoop]: === Iteration 578 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:18,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2130518632, now seen corresponding path program 560 times [2018-12-03 16:05:18,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:18,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:18,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:18,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:18,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:18,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:18,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:18,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:18,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 578 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 578 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:18,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:18,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:18,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:05:18,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:18,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:18,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:18,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:18,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:18,495 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:18,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:18,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:18,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:18,496 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:05:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:20,250 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:05:20,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:20,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:20,250 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:05:20,250 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:05:20,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:05:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 16:05:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:21,246 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:21,246 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:21,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:21,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:21,247 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:05:21,247 INFO L423 AbstractCegarLoop]: === Iteration 579 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:21,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2130520554, now seen corresponding path program 561 times [2018-12-03 16:05:21,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:21,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:21,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:21,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:21,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:21,323 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:21,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:21,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:21,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 579 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 579 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:21,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:21,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:21,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:21,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:21,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:21,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:21,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:21,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:21,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:21,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:21,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:21,491 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:23,189 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:05:23,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:23,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:23,189 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:05:23,189 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:05:23,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:05:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:05:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:05:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:05:24,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:05:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:24,113 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:05:24,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:05:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:24,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:24,114 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:05:24,114 INFO L423 AbstractCegarLoop]: === Iteration 580 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:24,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2132306092, now seen corresponding path program 562 times [2018-12-03 16:05:24,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:24,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:24,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:24,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:24,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:24,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:24,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:24,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:24,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:24,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 580 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 580 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:24,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:24,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:24,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:24,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:24,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:24,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:24,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:24,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:24,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:24,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:24,352 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:05:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:26,128 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:05:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:26,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:26,129 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:05:26,129 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:05:26,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:05:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 16:05:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:27,124 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:27,124 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:27,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:27,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:27,125 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:05:27,125 INFO L423 AbstractCegarLoop]: === Iteration 581 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:27,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2132308014, now seen corresponding path program 563 times [2018-12-03 16:05:27,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:27,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:27,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:27,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:27,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:27,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:27,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:27,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:27,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:27,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:27,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 581 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 581 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:27,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:27,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:27,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:05:27,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:27,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:27,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:27,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:27,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:27,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:27,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:27,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:27,459 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:29,243 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:05:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:29,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:29,244 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:05:29,244 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:05:29,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:05:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:05:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:05:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:05:30,225 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:05:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:30,225 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:05:30,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:05:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:30,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:30,225 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:05:30,225 INFO L423 AbstractCegarLoop]: === Iteration 582 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:30,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2132365674, now seen corresponding path program 564 times [2018-12-03 16:05:30,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:30,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:30,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:30,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:30,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:30,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:30,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:30,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:30,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:30,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:30,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 582 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 582 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:30,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:30,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:30,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:30,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:30,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:30,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:30,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:30,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:30,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:30,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:30,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:30,471 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:05:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:32,237 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:05:32,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:32,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:32,238 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:05:32,238 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:05:32,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:05:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 16:05:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:33,236 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:33,236 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:33,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:33,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:33,237 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:05:33,237 INFO L423 AbstractCegarLoop]: === Iteration 583 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:33,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2132367596, now seen corresponding path program 565 times [2018-12-03 16:05:33,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:33,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:33,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:33,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:33,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:33,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:33,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:33,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:33,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 583 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 583 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:33,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:33,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:33,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:33,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:33,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:33,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:33,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:33,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:33,486 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:35,179 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:05:35,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:35,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:35,179 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:05:35,180 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:05:35,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:05:36,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:05:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:05:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:05:36,060 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 16:05:36,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:36,060 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:05:36,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:05:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:36,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:36,060 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:05:36,060 INFO L423 AbstractCegarLoop]: === Iteration 584 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:36,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:36,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2107249944, now seen corresponding path program 566 times [2018-12-03 16:05:36,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:36,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:36,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:36,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:36,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:36,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:36,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:36,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:36,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:36,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:36,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 584 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 584 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:36,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:36,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:36,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:05:36,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:36,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:36,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:36,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:36,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:36,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:36,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:36,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:36,346 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 16:05:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:37,995 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:05:37,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:37,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:37,996 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:05:37,996 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:05:37,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:05:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-12-03 16:05:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:38,994 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:38,994 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:38,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:38,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:38,995 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:05:38,995 INFO L423 AbstractCegarLoop]: === Iteration 585 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:38,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2107248022, now seen corresponding path program 567 times [2018-12-03 16:05:38,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:38,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:38,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:39,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:39,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:39,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:39,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:39,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:39,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 585 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 585 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:39,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:39,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:39,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:39,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:39,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:39,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:39,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:39,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:39,253 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:39,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:39,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:39,254 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:40,889 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:05:40,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:40,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:40,894 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:05:40,894 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:05:40,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:05:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 16:05:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:05:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:05:41,880 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:05:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:41,880 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:05:41,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:05:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:41,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:41,880 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:05:41,880 INFO L423 AbstractCegarLoop]: === Iteration 586 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:41,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2107190362, now seen corresponding path program 568 times [2018-12-03 16:05:41,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:41,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:41,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:41,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:41,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:41,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:41,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:41,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:41,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:41,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:41,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 586 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 586 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:41,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:41,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:41,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:41,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:42,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:42,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:42,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:42,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:42,115 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:05:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:43,804 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:05:43,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:43,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:43,804 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:05:43,804 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:05:43,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:05:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-12-03 16:05:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:44,801 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:44,801 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:44,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:44,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:44,802 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:05:44,802 INFO L423 AbstractCegarLoop]: === Iteration 587 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:44,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2107188440, now seen corresponding path program 569 times [2018-12-03 16:05:44,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:44,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:44,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:44,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:44,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:44,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:44,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:44,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:44,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:44,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:44,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 587 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 587 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:44,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:44,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:44,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:05:44,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:44,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:44,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:45,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:45,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:45,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:45,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:45,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:45,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:45,039 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:46,708 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:05:46,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:46,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:46,709 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:05:46,709 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:05:46,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:05:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:05:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:05:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:05:47,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:05:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:47,681 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:05:47,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:05:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:47,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:47,681 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:05:47,681 INFO L423 AbstractCegarLoop]: === Iteration 588 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:47,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2105402902, now seen corresponding path program 570 times [2018-12-03 16:05:47,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:47,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:47,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:47,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:47,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:47,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:47,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:47,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:47,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:47,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:47,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 588 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 588 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:47,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:47,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:47,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:47,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:47,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:47,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:47,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:47,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:47,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:47,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:47,916 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:05:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:49,447 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:05:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:49,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:49,448 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:05:49,448 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:05:49,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:05:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-12-03 16:05:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:50,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:50,449 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:50,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:50,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:50,449 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:05:50,450 INFO L423 AbstractCegarLoop]: === Iteration 589 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:50,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2105400980, now seen corresponding path program 571 times [2018-12-03 16:05:50,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:50,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:50,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:50,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:50,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:50,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:50,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:50,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:50,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 589 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 589 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:50,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:50,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:50,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:50,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:50,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:50,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:50,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:50,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:50,695 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:52,242 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:05:52,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:52,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:52,243 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:05:52,243 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:05:52,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:05:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 16:05:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:05:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:05:53,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:05:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:53,228 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:05:53,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:05:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:53,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:53,229 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:05:53,229 INFO L423 AbstractCegarLoop]: === Iteration 590 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:53,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2105343320, now seen corresponding path program 572 times [2018-12-03 16:05:53,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:53,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:53,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:53,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:53,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:53,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:53,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:53,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:53,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:53,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:53,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 590 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 590 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:53,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:53,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:53,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:05:53,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:53,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:53,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:53,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:53,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:53,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:53,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:53,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:53,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:53,502 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:05:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:55,022 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:05:55,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:55,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:55,023 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:05:55,023 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:05:55,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:05:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-12-03 16:05:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:05:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:05:56,030 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:05:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:56,030 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:05:56,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:05:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:56,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:56,030 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:05:56,030 INFO L423 AbstractCegarLoop]: === Iteration 591 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:56,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:56,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2105341398, now seen corresponding path program 573 times [2018-12-03 16:05:56,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:56,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:56,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:56,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:56,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:56,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:56,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:56,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:56,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:56,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:56,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 591 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 591 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:56,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:56,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:56,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:56,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:56,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:56,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:56,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:56,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:56,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:56,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:56,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:56,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:56,262 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:05:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:57,694 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:05:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:05:57,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:05:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:57,694 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:05:57,694 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:05:57,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:05:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 16:05:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:05:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:05:58,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 12 [2018-12-03 16:05:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:58,498 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:05:58,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:05:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:05:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:05:58,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:58,499 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:05:58,499 INFO L423 AbstractCegarLoop]: === Iteration 592 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:58,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash -389500884, now seen corresponding path program 574 times [2018-12-03 16:05:58,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:58,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:58,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:58,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:58,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:58,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:58,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:58,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:58,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:58,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:58,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 592 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 592 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:58,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:58,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:58,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:58,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:05:58,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:58,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:05:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:05:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:05:58,738 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 12 states. [2018-12-03 16:06:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:00,556 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:06:00,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:00,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:00,556 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:06:00,556 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:06:00,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:06:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 16:06:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:01,570 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:01,570 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:01,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:01,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:01,570 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:06:01,570 INFO L423 AbstractCegarLoop]: === Iteration 593 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:01,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:01,571 INFO L82 PathProgramCache]: Analyzing trace with hash -389498962, now seen corresponding path program 575 times [2018-12-03 16:06:01,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:01,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:01,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:01,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:01,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:01,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:01,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:01,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:01,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:01,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:01,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 593 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 593 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:01,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:01,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:01,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:06:01,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:01,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:01,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:01,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:01,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:01,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:01,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:01,865 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:03,674 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:06:03,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:03,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:03,674 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:06:03,674 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:06:03,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:03,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:06:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:06:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:06:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:06:04,659 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:06:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:04,660 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:06:04,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:06:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:04,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:04,662 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:06:04,663 INFO L423 AbstractCegarLoop]: === Iteration 594 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:04,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash -389441302, now seen corresponding path program 576 times [2018-12-03 16:06:04,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:04,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:04,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:04,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:04,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:04,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:04,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:04,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:04,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 594 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 594 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:04,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:04,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:04,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:04,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:04,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:04,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:04,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:04,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:04,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:04,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:04,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:04,927 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:06:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:06,725 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:06:06,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:06,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:06,725 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:06:06,725 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:06:06,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:06:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 16:06:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:07,734 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:07,734 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:07,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:07,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:07,734 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:07,734 INFO L423 AbstractCegarLoop]: === Iteration 595 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:07,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash -389439380, now seen corresponding path program 577 times [2018-12-03 16:06:07,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:07,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:07,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:07,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:07,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:07,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:07,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:07,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:07,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 595 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 595 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:07,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:07,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:07,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:07,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:07,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:07,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:07,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:07,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:07,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:07,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:07,978 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:09,701 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:06:09,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:09,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:09,701 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:06:09,701 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:06:09,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:06:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:06:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:06:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:06:10,651 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:06:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:10,652 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:06:10,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:06:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:10,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:10,652 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:06:10,652 INFO L423 AbstractCegarLoop]: === Iteration 596 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:10,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash -387653842, now seen corresponding path program 578 times [2018-12-03 16:06:10,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:10,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:10,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:10,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:10,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:10,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:10,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:10,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:10,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 596 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 596 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:10,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:10,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:10,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:06:10,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:10,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:10,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:10,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:10,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:10,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:10,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:10,893 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:06:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:12,747 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:06:12,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:12,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:12,748 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:06:12,748 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:06:12,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:06:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 16:06:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:13,770 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:13,771 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:13,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:13,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:13,771 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:13,771 INFO L423 AbstractCegarLoop]: === Iteration 597 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:13,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash -387651920, now seen corresponding path program 579 times [2018-12-03 16:06:13,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:13,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:13,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:13,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:13,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:13,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:13,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:13,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:13,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 597 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 597 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:13,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:13,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:13,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:13,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:13,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:13,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:14,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:14,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:14,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:14,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:14,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:14,032 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:15,869 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:06:15,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:15,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:15,869 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:06:15,870 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:06:15,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:06:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:06:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:06:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:06:16,867 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:06:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:16,867 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:06:16,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:06:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:16,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:16,867 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:16,867 INFO L423 AbstractCegarLoop]: === Iteration 598 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:16,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:16,867 INFO L82 PathProgramCache]: Analyzing trace with hash -387594260, now seen corresponding path program 580 times [2018-12-03 16:06:16,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:16,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:16,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:16,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:16,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:16,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:16,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:16,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:16,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:16,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:16,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 598 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 598 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:16,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:16,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:16,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:16,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:17,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:17,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:17,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:17,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:17,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:17,119 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:06:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:18,868 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:06:18,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:18,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:18,868 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:06:18,868 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:06:18,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:06:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 16:06:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:19,891 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:19,891 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:19,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:19,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:19,891 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:19,891 INFO L423 AbstractCegarLoop]: === Iteration 599 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:19,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:19,891 INFO L82 PathProgramCache]: Analyzing trace with hash -387592338, now seen corresponding path program 581 times [2018-12-03 16:06:19,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:19,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:19,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:19,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:19,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:19,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:19,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:19,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:19,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:19,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:19,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 599 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 599 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:19,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:19,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:06:19,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:19,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:19,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:20,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:20,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:20,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:20,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:20,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:20,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:20,139 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:21,882 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:06:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:21,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:21,882 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:06:21,883 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:06:21,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:06:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:06:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:06:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:06:22,812 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 16:06:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:22,812 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:06:22,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:06:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:22,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:22,813 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:06:22,813 INFO L423 AbstractCegarLoop]: === Iteration 600 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:22,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash -332242582, now seen corresponding path program 582 times [2018-12-03 16:06:22,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:22,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:22,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:22,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:22,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:22,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:22,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:22,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:22,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 600 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 600 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:22,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:22,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:22,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:22,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:22,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:22,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:23,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:23,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:23,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:23,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:23,058 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 16:06:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:24,844 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:06:24,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:24,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:24,845 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:06:24,845 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:06:24,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:06:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-12-03 16:06:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:25,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:25,885 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:25,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:25,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:25,885 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:25,885 INFO L423 AbstractCegarLoop]: === Iteration 601 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:25,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:25,886 INFO L82 PathProgramCache]: Analyzing trace with hash -332240660, now seen corresponding path program 583 times [2018-12-03 16:06:25,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:25,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:25,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:25,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:25,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:25,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:25,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:25,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:25,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:25,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:25,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 601 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 601 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:25,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:25,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:25,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:25,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:26,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:26,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:26,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:26,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:26,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:26,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:26,121 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:27,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:27,752 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:06:27,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:27,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:27,752 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:06:27,752 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:06:27,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:06:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 16:06:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:06:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:06:28,748 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:06:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:28,749 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:06:28,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:06:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:28,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:28,749 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:28,749 INFO L423 AbstractCegarLoop]: === Iteration 602 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:28,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash -332183000, now seen corresponding path program 584 times [2018-12-03 16:06:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:28,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:28,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:28,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:28,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:28,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:28,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:28,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 602 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 602 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:28,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:28,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:06:28,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:28,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:28,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:28,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:28,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:28,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:28,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:28,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:28,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:28,994 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:06:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:30,690 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:06:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:30,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:30,691 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:06:30,691 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:06:30,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:06:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-12-03 16:06:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:31,710 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:31,710 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:31,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:31,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:31,711 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:31,711 INFO L423 AbstractCegarLoop]: === Iteration 603 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:31,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash -332181078, now seen corresponding path program 585 times [2018-12-03 16:06:31,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:31,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:31,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:31,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:31,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:31,785 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:31,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:31,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:31,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 603 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 603 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:31,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:31,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:31,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:31,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:31,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:31,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:31,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:31,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:31,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:31,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:31,948 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:33,569 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:06:33,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:33,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:33,569 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:06:33,569 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:06:33,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:06:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:06:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:06:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:06:34,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:06:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:34,518 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:06:34,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:06:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:34,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:34,518 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:34,518 INFO L423 AbstractCegarLoop]: === Iteration 604 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:34,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash -330395540, now seen corresponding path program 586 times [2018-12-03 16:06:34,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:34,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:34,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:34,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:34,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:34,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:34,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:34,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:34,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 604 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 604 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:34,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:34,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:34,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:34,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:34,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:34,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:34,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:34,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:34,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:34,764 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:06:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:36,342 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:06:36,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:36,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:36,342 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:06:36,342 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:06:36,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:06:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-12-03 16:06:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:37,360 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:37,360 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:37,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:37,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:37,361 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:37,361 INFO L423 AbstractCegarLoop]: === Iteration 605 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:37,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -330393618, now seen corresponding path program 587 times [2018-12-03 16:06:37,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:37,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:37,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:37,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:37,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:37,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:37,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:37,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:37,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:37,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:37,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 605 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 605 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:37,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:37,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:37,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:06:37,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:37,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:37,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:37,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:37,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:37,681 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:39,262 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:06:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:39,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:39,263 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:06:39,263 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:06:39,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:06:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 16:06:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:06:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:06:40,268 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:06:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:40,269 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:06:40,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:06:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:40,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:40,269 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:40,269 INFO L423 AbstractCegarLoop]: === Iteration 606 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:40,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash -330335958, now seen corresponding path program 588 times [2018-12-03 16:06:40,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:40,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:40,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:40,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:40,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:40,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:40,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:40,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:40,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 606 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 606 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:40,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:40,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:40,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:40,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:40,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:40,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:40,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:40,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:40,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:40,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:40,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:40,505 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:06:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:42,046 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:06:42,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:42,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:42,047 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:06:42,047 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:06:42,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:06:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-12-03 16:06:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:43,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:43,070 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:43,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:43,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:43,070 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:06:43,070 INFO L423 AbstractCegarLoop]: === Iteration 607 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:43,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash -330334036, now seen corresponding path program 589 times [2018-12-03 16:06:43,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:43,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:43,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:43,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:43,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:43,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:43,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:43,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:43,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:43,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:43,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 607 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 607 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:43,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:43,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:43,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:43,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:43,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:43,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:43,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:43,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:43,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:43,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:43,304 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:44,760 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:06:44,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:44,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:44,761 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:06:44,761 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:06:44,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:06:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-03 16:06:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:06:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:06:45,486 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 12 [2018-12-03 16:06:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:45,486 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:06:45,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:06:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:45,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:45,486 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 16:06:45,486 INFO L423 AbstractCegarLoop]: === Iteration 608 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:45,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:45,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1321112424, now seen corresponding path program 590 times [2018-12-03 16:06:45,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:45,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:45,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:45,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:45,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:45,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:45,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:45,561 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:45,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:45,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:45,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 608 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 608 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:45,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:45,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:45,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:06:45,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:45,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:45,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:45,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:45,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:45,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:45,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:45,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:45,755 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 12 states. [2018-12-03 16:06:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:47,343 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:06:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:47,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:47,343 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:06:47,343 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:06:47,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:06:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-12-03 16:06:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:48,398 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:48,398 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:48,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:48,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:48,398 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:06:48,399 INFO L423 AbstractCegarLoop]: === Iteration 609 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:48,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:48,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1321114346, now seen corresponding path program 591 times [2018-12-03 16:06:48,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:48,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:48,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:48,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:48,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:48,489 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:48,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:48,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:48,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 609 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 609 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:48,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:48,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:48,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:48,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:48,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:48,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:48,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:48,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:48,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:48,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:48,650 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:50,240 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:06:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:50,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:50,240 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:06:50,241 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:06:50,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:06:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 16:06:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:06:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:06:51,262 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 16:06:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:51,262 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:06:51,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:06:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:51,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:51,262 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:06:51,262 INFO L423 AbstractCegarLoop]: === Iteration 610 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:51,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:51,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1321172006, now seen corresponding path program 592 times [2018-12-03 16:06:51,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:51,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:51,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:51,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:51,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:51,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:51,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:51,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:51,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:51,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:51,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 610 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 610 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:51,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:51,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:51,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:51,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:51,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:51,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:51,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:51,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:51,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:51,498 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 16:06:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:53,185 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:06:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:53,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:53,186 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:06:53,186 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:06:53,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:06:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-12-03 16:06:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:06:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 16:06:54,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 16:06:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:54,229 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 16:06:54,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 16:06:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:54,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:54,229 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:06:54,229 INFO L423 AbstractCegarLoop]: === Iteration 611 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:54,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1321173928, now seen corresponding path program 593 times [2018-12-03 16:06:54,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:54,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:54,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:54,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:54,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:54,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:54,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:54,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:54,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:54,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:54,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 611 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 611 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:54,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:54,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:54,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:06:54,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:54,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:54,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:54,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:54,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:54,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:54,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:54,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:54,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:54,467 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 16:06:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:56,048 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:06:56,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:56,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:56,049 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:06:56,049 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:06:56,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:06:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:06:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:06:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:06:57,032 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 16:06:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:57,032 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:06:57,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:06:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:06:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:06:57,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:57,032 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 16:06:57,032 INFO L423 AbstractCegarLoop]: === Iteration 612 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:57,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1322959466, now seen corresponding path program 594 times [2018-12-03 16:06:57,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:57,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:57,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:57,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:57,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:57,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:57,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:57,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:57,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 612 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 612 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:57,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:57,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:57,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:57,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:57,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:57,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:57,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:57,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:06:57,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:57,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:06:57,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:06:57,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:57,281 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 16:06:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:58,764 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:06:58,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:06:58,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:06:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:58,765 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:06:58,765 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:06:58,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:06:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.