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_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:19,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:19,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:19,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:19,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:19,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:19,648 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:19,650 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:19,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:19,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:19,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:19,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:19,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:19,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:19,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:19,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:19,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:19,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:19,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:19,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:19,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:19,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:19,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:19,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:19,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:19,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:19,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:19,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:19,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:19,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:19,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:19,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:19,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:19,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:19,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:19,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:19,704 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:11:19,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:19,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:19,732 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:19,732 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:19,733 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:19,733 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:19,733 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:19,733 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:19,733 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:19,734 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:19,734 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:19,734 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:19,734 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:19,734 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:19,735 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:19,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:19,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:19,736 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:19,738 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:19,739 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:19,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:19,739 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:19,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:19,740 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:19,740 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:19,740 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:19,740 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:19,740 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:19,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:19,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:19,741 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:19,741 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:19,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:19,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:19,742 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:19,742 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:19,742 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:19,742 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:19,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:19,743 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:19,743 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:19,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:19,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:19,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:19,828 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:19,829 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:19,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-12-03 16:11:19,830 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-12-03 16:11:19,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:19,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:19,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:19,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:19,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:19,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:19,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:19,960 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:19,960 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:19,961 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:19,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:19,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:19,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:19,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:19,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:19,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:19,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:19,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:19,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:20,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:20,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/1) ... [2018-12-03 16:11:20,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:20,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:20,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:20,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:20,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (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 16:11:20,096 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 16:11:20,097 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 16:11:20,097 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 16:11:21,394 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:21,395 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:11:21,395 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:21 BoogieIcfgContainer [2018-12-03 16:11:21,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:21,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:21,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:21,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:21,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:19" (1/2) ... [2018-12-03 16:11:21,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc97d79 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:11:21, skipping insertion in model container [2018-12-03 16:11:21,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:21" (2/2) ... [2018-12-03 16:11:21,403 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-12-03 16:11:21,412 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:21,420 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-12-03 16:11:21,435 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-12-03 16:11:21,469 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:21,470 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:21,470 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:21,470 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:21,470 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:21,471 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:21,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:21,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-12-03 16:11:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:11:21,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:21,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:11:21,505 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:21,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-12-03 16:11:21,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:21,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:21,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:21,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:21,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:21,791 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 16:11:21,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:21,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:21,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:21,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:21,817 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-12-03 16:11:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:23,523 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-12-03 16:11:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:11:23,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:11:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:23,545 INFO L225 Difference]: With dead ends: 142 [2018-12-03 16:11:23,545 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 16:11:23,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 16:11:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-12-03 16:11:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:11:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-12-03 16:11:23,616 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-12-03 16:11:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:23,618 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-12-03 16:11:23,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-12-03 16:11:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:11:23,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:23,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:11:23,621 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:23,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:23,622 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-12-03 16:11:23,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:23,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:23,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:23,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:23,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:23,800 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 16:11:23,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:23,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:23,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:23,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:23,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:23,805 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-12-03 16:11:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:25,507 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-12-03 16:11:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:11:25,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:11:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:25,514 INFO L225 Difference]: With dead ends: 241 [2018-12-03 16:11:25,514 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 16:11:25,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:25,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 16:11:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-12-03 16:11:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 16:11:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-12-03 16:11:25,549 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-12-03 16:11:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:25,550 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-12-03 16:11:25,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-12-03 16:11:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:11:25,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:25,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:11:25,553 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:25,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-12-03 16:11:25,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:25,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:25,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:25,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:25,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:25,693 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 16:11:25,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:25,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:25,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:25,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:11:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:11:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:25,696 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-12-03 16:11:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:27,001 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-12-03 16:11:27,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:11:27,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:11:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:27,006 INFO L225 Difference]: With dead ends: 269 [2018-12-03 16:11:27,006 INFO L226 Difference]: Without dead ends: 265 [2018-12-03 16:11:27,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-12-03 16:11:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-12-03 16:11:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 16:11:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-12-03 16:11:27,043 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-12-03 16:11:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:27,044 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-12-03 16:11:27,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:11:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-12-03 16:11:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:27,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:27,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:27,047 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:27,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-12-03 16:11:27,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:27,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:27,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:27,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:27,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:27,182 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 16:11:27,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:27,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:27,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:27,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:27,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:27,185 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-12-03 16:11:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:32,251 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-12-03 16:11:32,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:11:32,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:32,257 INFO L225 Difference]: With dead ends: 790 [2018-12-03 16:11:32,258 INFO L226 Difference]: Without dead ends: 629 [2018-12-03 16:11:32,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:11:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-12-03 16:11:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-12-03 16:11:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-03 16:11:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-12-03 16:11:32,309 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-12-03 16:11:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:32,310 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-12-03 16:11:32,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-12-03 16:11:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:32,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:32,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:32,313 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:32,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:32,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-12-03 16:11:32,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:32,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:32,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:32,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:32,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:32,488 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 16:11:32,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:32,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:32,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:32,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:32,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:32,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:32,490 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-12-03 16:11:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:35,743 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-12-03 16:11:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:11:35,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:35,749 INFO L225 Difference]: With dead ends: 634 [2018-12-03 16:11:35,749 INFO L226 Difference]: Without dead ends: 628 [2018-12-03 16:11:35,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:11:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-12-03 16:11:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-12-03 16:11:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-03 16:11:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-12-03 16:11:35,805 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-12-03 16:11:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:35,805 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-12-03 16:11:35,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-12-03 16:11:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:35,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:35,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:35,808 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:35,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-12-03 16:11:35,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:35,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:35,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:35,941 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 16:11:35,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:35,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:35,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:35,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:35,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:35,943 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-12-03 16:11:37,496 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:11:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:40,347 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-12-03 16:11:40,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:11:40,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:40,352 INFO L225 Difference]: With dead ends: 768 [2018-12-03 16:11:40,353 INFO L226 Difference]: Without dead ends: 537 [2018-12-03 16:11:40,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:11:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-03 16:11:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-12-03 16:11:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-03 16:11:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-12-03 16:11:40,403 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-12-03 16:11:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:40,404 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-12-03 16:11:40,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-12-03 16:11:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:40,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:40,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:40,407 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:40,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:40,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-12-03 16:11:40,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:40,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:40,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:40,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:40,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:40,620 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 16:11:40,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:40,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:40,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:40,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:40,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:40,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:40,622 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-12-03 16:11:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:43,175 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-12-03 16:11:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:11:43,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:43,187 INFO L225 Difference]: With dead ends: 1145 [2018-12-03 16:11:43,187 INFO L226 Difference]: Without dead ends: 812 [2018-12-03 16:11:43,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:11:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-12-03 16:11:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-12-03 16:11:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-03 16:11:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-12-03 16:11:43,259 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-12-03 16:11:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:43,260 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-12-03 16:11:43,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-12-03 16:11:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:43,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:43,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:43,263 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:43,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:43,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-12-03 16:11:43,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:43,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:43,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:43,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:43,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:43,377 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 16:11:43,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:43,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:43,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:43,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:43,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:43,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:43,379 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-12-03 16:11:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:45,722 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-12-03 16:11:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:11:45,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:45,729 INFO L225 Difference]: With dead ends: 877 [2018-12-03 16:11:45,730 INFO L226 Difference]: Without dead ends: 871 [2018-12-03 16:11:45,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:11:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-12-03 16:11:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-12-03 16:11:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-12-03 16:11:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-12-03 16:11:45,824 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-12-03 16:11:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:45,824 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-12-03 16:11:45,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-12-03 16:11:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:45,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:45,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:45,826 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:45,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-12-03 16:11:45,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:45,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:45,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:45,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:45,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:46,043 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 16:11:46,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:46,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:46,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:46,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:46,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:46,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:46,045 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-12-03 16:11:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:48,106 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-12-03 16:11:48,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:11:48,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:48,112 INFO L225 Difference]: With dead ends: 1049 [2018-12-03 16:11:48,112 INFO L226 Difference]: Without dead ends: 818 [2018-12-03 16:11:48,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:11:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-12-03 16:11:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-12-03 16:11:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-12-03 16:11:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-12-03 16:11:48,226 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-12-03 16:11:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:48,227 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-12-03 16:11:48,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-12-03 16:11:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:48,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:48,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:48,229 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:48,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-12-03 16:11:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:48,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:48,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:48,354 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 16:11:48,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:48,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:48,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:48,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:48,356 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-12-03 16:11:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:50,108 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-12-03 16:11:50,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:11:50,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:50,113 INFO L225 Difference]: With dead ends: 733 [2018-12-03 16:11:50,113 INFO L226 Difference]: Without dead ends: 727 [2018-12-03 16:11:50,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:11:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-03 16:11:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-12-03 16:11:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-12-03 16:11:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-12-03 16:11:50,238 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-12-03 16:11:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:50,238 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-12-03 16:11:50,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-12-03 16:11:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:50,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:50,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:50,241 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:50,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:50,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-12-03 16:11:50,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:50,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:50,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:50,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:50,711 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-12-03 16:11:50,742 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 16:11:50,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:50,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:50,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:50,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:50,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:50,744 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-12-03 16:11:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:53,865 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-12-03 16:11:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:11:53,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:53,874 INFO L225 Difference]: With dead ends: 1329 [2018-12-03 16:11:53,874 INFO L226 Difference]: Without dead ends: 1323 [2018-12-03 16:11:53,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:11:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-12-03 16:11:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-12-03 16:11:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 16:11:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-12-03 16:11:54,041 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-12-03 16:11:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:54,042 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-12-03 16:11:54,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-12-03 16:11:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:54,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:54,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:54,044 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:54,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:54,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-12-03 16:11:54,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:54,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:54,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:54,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:54,158 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 16:11:54,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:54,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:54,159 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:54,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:54,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:54,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:54,160 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-12-03 16:11:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:56,765 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-12-03 16:11:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:11:56,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:56,773 INFO L225 Difference]: With dead ends: 1268 [2018-12-03 16:11:56,773 INFO L226 Difference]: Without dead ends: 1262 [2018-12-03 16:11:56,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:11:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-12-03 16:11:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-12-03 16:11:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-12-03 16:11:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-12-03 16:11:56,956 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-12-03 16:11:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:56,956 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-12-03 16:11:56,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-12-03 16:11:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:56,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:56,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:56,959 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:56,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-12-03 16:11:56,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:56,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:57,103 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 16:11:57,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:57,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:11:57,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:57,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:11:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:11:57,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:11:57,105 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-12-03 16:11:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:59,682 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-12-03 16:11:59,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:11:59,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:11:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:59,692 INFO L225 Difference]: With dead ends: 1367 [2018-12-03 16:11:59,692 INFO L226 Difference]: Without dead ends: 1361 [2018-12-03 16:11:59,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:11:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-12-03 16:11:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-12-03 16:11:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-12-03 16:11:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-12-03 16:11:59,888 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-12-03 16:11:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:59,888 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-12-03 16:11:59,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:11:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-12-03 16:11:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:11:59,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:59,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:59,891 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:59,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-12-03 16:11:59,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:59,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:59,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:59,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:00,028 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 16:12:00,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:00,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:12:00,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:00,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:00,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:00,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:00,029 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-12-03 16:12:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:03,338 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-12-03 16:12:03,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:12:03,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:12:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:03,349 INFO L225 Difference]: With dead ends: 1373 [2018-12-03 16:12:03,349 INFO L226 Difference]: Without dead ends: 1367 [2018-12-03 16:12:03,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:12:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-12-03 16:12:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-12-03 16:12:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-12-03 16:12:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-12-03 16:12:03,595 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-12-03 16:12:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:03,595 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-12-03 16:12:03,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-12-03 16:12:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:03,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:03,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:03,597 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:03,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-12-03 16:12:03,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:03,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:03,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:03,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:03,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:03,752 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 16:12:03,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:03,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:03,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:03,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:03,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:03,754 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-12-03 16:12:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:06,029 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-12-03 16:12:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:06,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:06,038 INFO L225 Difference]: With dead ends: 1526 [2018-12-03 16:12:06,038 INFO L226 Difference]: Without dead ends: 1520 [2018-12-03 16:12:06,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-12-03 16:12:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-12-03 16:12:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-03 16:12:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-12-03 16:12:06,274 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-12-03 16:12:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:06,274 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-12-03 16:12:06,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-12-03 16:12:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:06,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:06,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:06,276 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:06,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:06,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-12-03 16:12:06,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:06,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:06,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:06,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:06,380 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 16:12:06,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:06,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:06,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:06,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:06,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:06,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:06,382 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-12-03 16:12:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:08,593 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-12-03 16:12:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:12:08,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:08,603 INFO L225 Difference]: With dead ends: 1548 [2018-12-03 16:12:08,603 INFO L226 Difference]: Without dead ends: 1542 [2018-12-03 16:12:08,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-03 16:12:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-12-03 16:12:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-03 16:12:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-12-03 16:12:08,818 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-12-03 16:12:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:08,818 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-12-03 16:12:08,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-12-03 16:12:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:08,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:08,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:08,820 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:08,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-12-03 16:12:08,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:08,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:08,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:08,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:09,123 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-03 16:12:09,171 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 16:12:09,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:09,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:09,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:09,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:09,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:09,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:09,173 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-12-03 16:12:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:11,650 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-12-03 16:12:11,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:11,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:11,658 INFO L225 Difference]: With dead ends: 1575 [2018-12-03 16:12:11,658 INFO L226 Difference]: Without dead ends: 1569 [2018-12-03 16:12:11,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-12-03 16:12:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-12-03 16:12:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-12-03 16:12:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-12-03 16:12:11,912 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-12-03 16:12:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:11,912 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-12-03 16:12:11,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-12-03 16:12:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:11,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:11,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:11,914 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:11,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-12-03 16:12:11,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:11,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:11,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:11,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:12,011 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 16:12:12,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:12,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:12,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:12,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:12,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:12,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:12,013 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-12-03 16:12:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:14,134 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-12-03 16:12:14,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:12:14,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:14,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:14,145 INFO L225 Difference]: With dead ends: 1597 [2018-12-03 16:12:14,145 INFO L226 Difference]: Without dead ends: 1591 [2018-12-03 16:12:14,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:12:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-12-03 16:12:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-12-03 16:12:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-03 16:12:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-12-03 16:12:14,401 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-12-03 16:12:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:14,401 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-12-03 16:12:14,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-12-03 16:12:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:14,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:14,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:14,403 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:14,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-12-03 16:12:14,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:14,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:14,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:14,585 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 16:12:14,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:14,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:14,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:14,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:14,588 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-12-03 16:12:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:16,856 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-12-03 16:12:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:16,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:16,864 INFO L225 Difference]: With dead ends: 1726 [2018-12-03 16:12:16,864 INFO L226 Difference]: Without dead ends: 1720 [2018-12-03 16:12:16,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:12:16,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-12-03 16:12:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-12-03 16:12:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-12-03 16:12:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-12-03 16:12:17,202 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-12-03 16:12:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:17,203 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-12-03 16:12:17,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-12-03 16:12:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:17,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:17,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:17,205 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:17,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-12-03 16:12:17,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:17,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:17,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:17,343 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 16:12:17,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:17,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:17,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:17,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:17,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:17,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:17,345 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-12-03 16:12:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:19,789 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-12-03 16:12:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:12:19,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:19,795 INFO L225 Difference]: With dead ends: 1758 [2018-12-03 16:12:19,795 INFO L226 Difference]: Without dead ends: 1752 [2018-12-03 16:12:19,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:12:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-12-03 16:12:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-12-03 16:12:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-12-03 16:12:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-12-03 16:12:20,120 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-12-03 16:12:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:20,120 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-12-03 16:12:20,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-12-03 16:12:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:20,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:20,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:20,122 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:20,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-12-03 16:12:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:20,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:20,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:20,216 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 16:12:20,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:20,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:20,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:20,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:20,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:20,219 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-12-03 16:12:23,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:23,142 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-12-03 16:12:23,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:12:23,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:23,149 INFO L225 Difference]: With dead ends: 1867 [2018-12-03 16:12:23,149 INFO L226 Difference]: Without dead ends: 1861 [2018-12-03 16:12:23,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-12-03 16:12:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-12-03 16:12:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-12-03 16:12:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-12-03 16:12:23,530 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-12-03 16:12:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:23,530 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-12-03 16:12:23,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-12-03 16:12:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:23,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:23,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:23,532 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:23,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-12-03 16:12:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:23,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:23,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:23,671 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 16:12:23,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:23,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:23,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:23,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:23,672 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-12-03 16:12:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:26,913 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-12-03 16:12:26,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:26,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:26,922 INFO L225 Difference]: With dead ends: 1968 [2018-12-03 16:12:26,922 INFO L226 Difference]: Without dead ends: 1962 [2018-12-03 16:12:26,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-12-03 16:12:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-12-03 16:12:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-12-03 16:12:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-12-03 16:12:27,442 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-12-03 16:12:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:27,442 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-12-03 16:12:27,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-12-03 16:12:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:27,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:27,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:27,444 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:27,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-12-03 16:12:27,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:27,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:27,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:27,547 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 16:12:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:27,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:27,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:27,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:27,549 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-12-03 16:12:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:30,280 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-12-03 16:12:30,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:12:30,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:30,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:30,288 INFO L225 Difference]: With dead ends: 2001 [2018-12-03 16:12:30,288 INFO L226 Difference]: Without dead ends: 1995 [2018-12-03 16:12:30,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-12-03 16:12:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-12-03 16:12:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-12-03 16:12:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-12-03 16:12:30,800 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-12-03 16:12:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:30,800 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-12-03 16:12:30,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-12-03 16:12:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:30,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:30,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:30,802 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:30,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-12-03 16:12:30,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:30,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:30,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:30,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:30,919 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 16:12:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:30,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:30,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:30,921 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-12-03 16:12:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:33,497 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-12-03 16:12:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:33,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:33,502 INFO L225 Difference]: With dead ends: 1708 [2018-12-03 16:12:33,503 INFO L226 Difference]: Without dead ends: 1702 [2018-12-03 16:12:33,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:12:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-12-03 16:12:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-12-03 16:12:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-12-03 16:12:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-12-03 16:12:34,054 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-12-03 16:12:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:34,054 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-12-03 16:12:34,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-12-03 16:12:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:34,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:34,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:34,056 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:34,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-12-03 16:12:34,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:34,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:34,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:34,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:34,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:34,167 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 16:12:34,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:34,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:34,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:34,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:34,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:34,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:34,169 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-12-03 16:12:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:37,707 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-12-03 16:12:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:12:37,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:37,715 INFO L225 Difference]: With dead ends: 2402 [2018-12-03 16:12:37,715 INFO L226 Difference]: Without dead ends: 2396 [2018-12-03 16:12:37,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-12-03 16:12:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-12-03 16:12:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-12-03 16:12:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-12-03 16:12:38,366 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-12-03 16:12:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:38,366 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-12-03 16:12:38,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-12-03 16:12:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:38,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:38,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:38,368 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:38,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-12-03 16:12:38,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:38,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:38,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:38,787 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-12-03 16:12:39,162 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 16:12:39,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:39,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 16:12:39,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:39,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:39,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:12:39,164 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-12-03 16:12:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:42,511 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-12-03 16:12:42,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:12:42,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 16:12:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:42,515 INFO L225 Difference]: With dead ends: 2274 [2018-12-03 16:12:42,516 INFO L226 Difference]: Without dead ends: 2268 [2018-12-03 16:12:42,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:12:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-12-03 16:12:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-12-03 16:12:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 16:12:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-12-03 16:12:43,129 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-12-03 16:12:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:43,129 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-12-03 16:12:43,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-12-03 16:12:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:43,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:43,130 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 16:12:43,131 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:43,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-12-03 16:12:43,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:43,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:43,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:43,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:43,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:43,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:12:43,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:43,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:12:43,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:12:43,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:12:43,166 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-12-03 16:12:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:44,094 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-12-03 16:12:44,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:12:44,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 16:12:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:44,097 INFO L225 Difference]: With dead ends: 2170 [2018-12-03 16:12:44,097 INFO L226 Difference]: Without dead ends: 1253 [2018-12-03 16:12:44,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:12:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-12-03 16:12:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-12-03 16:12:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-12-03 16:12:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-12-03 16:12:44,568 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-12-03 16:12:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:44,568 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-12-03 16:12:44,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:12:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-12-03 16:12:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:44,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:44,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:44,570 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:44,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:44,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-12-03 16:12:44,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:44,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:44,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:44,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:44,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:44,710 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 16:12:44,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:44,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:12:44,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:44,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:44,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:44,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:44,711 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-12-03 16:12:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:48,563 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-12-03 16:12:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:12:48,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:12:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:48,567 INFO L225 Difference]: With dead ends: 2095 [2018-12-03 16:12:48,567 INFO L226 Difference]: Without dead ends: 2093 [2018-12-03 16:12:48,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-12-03 16:12:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-12-03 16:12:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-12-03 16:12:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-12-03 16:12:49,078 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-12-03 16:12:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:49,078 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-12-03 16:12:49,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-12-03 16:12:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:49,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:49,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:49,080 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:49,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:49,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-12-03 16:12:49,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:49,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:49,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:49,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:49,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:49,234 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 16:12:49,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:49,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:12:49,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:49,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:49,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:49,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:49,236 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-12-03 16:12:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:52,950 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-12-03 16:12:52,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:12:52,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:12:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:52,955 INFO L225 Difference]: With dead ends: 1994 [2018-12-03 16:12:52,955 INFO L226 Difference]: Without dead ends: 1988 [2018-12-03 16:12:52,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:12:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-12-03 16:12:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-12-03 16:12:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-12-03 16:12:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-12-03 16:12:53,527 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-12-03 16:12:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:53,528 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-12-03 16:12:53,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-12-03 16:12:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:53,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:53,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:53,529 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:53,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:53,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-12-03 16:12:53,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:53,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:53,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:53,790 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 16:12:53,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:53,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:12:53,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:53,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:53,792 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-12-03 16:12:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:58,035 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-12-03 16:12:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:12:58,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:12:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:58,039 INFO L225 Difference]: With dead ends: 2160 [2018-12-03 16:12:58,039 INFO L226 Difference]: Without dead ends: 2154 [2018-12-03 16:12:58,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:12:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-12-03 16:12:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-12-03 16:12:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-12-03 16:12:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-12-03 16:12:58,655 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-12-03 16:12:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:58,655 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-12-03 16:12:58,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-12-03 16:12:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:58,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:58,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:12:58,657 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:58,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-12-03 16:12:58,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:58,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:58,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:58,825 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 16:12:58,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:58,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:12:58,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:58,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:58,827 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-12-03 16:13:03,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:03,036 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-12-03 16:13:03,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:13:03,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:03,041 INFO L225 Difference]: With dead ends: 2094 [2018-12-03 16:13:03,041 INFO L226 Difference]: Without dead ends: 2088 [2018-12-03 16:13:03,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:13:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-12-03 16:13:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-12-03 16:13:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-12-03 16:13:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-12-03 16:13:03,719 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-12-03 16:13:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:03,719 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-12-03 16:13:03,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-12-03 16:13:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:03,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:03,720 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 16:13:03,721 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:03,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-12-03 16:13:03,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:03,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:03,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:03,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:13:03,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:03,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:13:03,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:13:03,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:13:03,747 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-12-03 16:13:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:04,823 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-12-03 16:13:04,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:13:04,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 16:13:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:04,826 INFO L225 Difference]: With dead ends: 1929 [2018-12-03 16:13:04,826 INFO L226 Difference]: Without dead ends: 1400 [2018-12-03 16:13:04,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:13:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-12-03 16:13:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-12-03 16:13:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-12-03 16:13:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-12-03 16:13:05,468 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-12-03 16:13:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:05,469 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-12-03 16:13:05,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:13:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-12-03 16:13:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:05,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:05,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:05,470 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:05,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-12-03 16:13:05,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:05,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:05,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:05,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:05,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:05,578 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 16:13:05,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:05,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:05,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:05,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:05,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:05,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:05,580 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-12-03 16:13:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:09,398 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-12-03 16:13:09,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:13:09,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:09,404 INFO L225 Difference]: With dead ends: 2276 [2018-12-03 16:13:09,404 INFO L226 Difference]: Without dead ends: 2270 [2018-12-03 16:13:09,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:13:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-12-03 16:13:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-12-03 16:13:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-12-03 16:13:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-12-03 16:13:10,287 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-12-03 16:13:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:10,288 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-12-03 16:13:10,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-12-03 16:13:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:10,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:10,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:10,290 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:10,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-12-03 16:13:10,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:10,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:10,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:10,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:10,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:10,378 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 16:13:10,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:10,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:10,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:10,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:10,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:10,379 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-12-03 16:13:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:14,722 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-12-03 16:13:14,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:13:14,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:14,728 INFO L225 Difference]: With dead ends: 2425 [2018-12-03 16:13:14,728 INFO L226 Difference]: Without dead ends: 2419 [2018-12-03 16:13:14,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:13:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-12-03 16:13:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-12-03 16:13:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-12-03 16:13:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-12-03 16:13:15,750 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-12-03 16:13:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:15,751 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-12-03 16:13:15,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-12-03 16:13:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:15,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:15,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:15,753 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:15,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-12-03 16:13:15,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:15,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:15,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:15,856 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 16:13:15,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:15,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:15,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:15,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:15,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:15,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:15,858 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-12-03 16:13:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:20,490 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-12-03 16:13:20,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:13:20,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:20,496 INFO L225 Difference]: With dead ends: 2278 [2018-12-03 16:13:20,496 INFO L226 Difference]: Without dead ends: 2272 [2018-12-03 16:13:20,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:13:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-12-03 16:13:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-12-03 16:13:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-12-03 16:13:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-12-03 16:13:21,447 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-12-03 16:13:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:21,447 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-12-03 16:13:21,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-12-03 16:13:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:21,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:21,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:21,449 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:21,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:21,449 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-12-03 16:13:21,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:21,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:21,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:21,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:21,656 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 16:13:21,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:21,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:21,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:21,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:21,658 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-12-03 16:13:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:25,960 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-12-03 16:13:25,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:13:25,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:25,966 INFO L225 Difference]: With dead ends: 2233 [2018-12-03 16:13:25,967 INFO L226 Difference]: Without dead ends: 2227 [2018-12-03 16:13:25,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:13:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-12-03 16:13:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-12-03 16:13:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-12-03 16:13:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-12-03 16:13:26,897 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-12-03 16:13:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:26,897 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-12-03 16:13:26,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-12-03 16:13:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:26,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:26,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:26,899 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:26,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:26,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-12-03 16:13:26,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:26,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:26,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:26,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:27,135 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-12-03 16:13:27,284 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 16:13:27,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:27,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:27,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:27,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:27,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:27,285 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-12-03 16:13:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:31,955 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-12-03 16:13:31,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:13:31,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:31,960 INFO L225 Difference]: With dead ends: 2558 [2018-12-03 16:13:31,961 INFO L226 Difference]: Without dead ends: 2552 [2018-12-03 16:13:31,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:13:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-12-03 16:13:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-12-03 16:13:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-12-03 16:13:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-12-03 16:13:32,949 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-12-03 16:13:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:32,949 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-12-03 16:13:32,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-12-03 16:13:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:32,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:32,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:32,951 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:32,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:32,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-12-03 16:13:32,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:32,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:32,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:32,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:32,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:33,081 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 16:13:33,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:33,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:33,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:33,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:33,083 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-12-03 16:13:33,214 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-12-03 16:13:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:37,897 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-12-03 16:13:37,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:13:37,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:37,903 INFO L225 Difference]: With dead ends: 2703 [2018-12-03 16:13:37,903 INFO L226 Difference]: Without dead ends: 2697 [2018-12-03 16:13:37,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:13:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-12-03 16:13:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-12-03 16:13:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-12-03 16:13:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-12-03 16:13:38,916 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-12-03 16:13:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:38,916 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-12-03 16:13:38,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-12-03 16:13:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:38,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:38,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:38,917 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:38,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:38,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-12-03 16:13:38,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:38,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:38,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:38,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:38,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:39,064 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 16:13:39,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:39,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:39,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:39,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:39,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:39,065 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-12-03 16:13:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:44,316 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-12-03 16:13:44,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:13:44,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:44,324 INFO L225 Difference]: With dead ends: 2674 [2018-12-03 16:13:44,325 INFO L226 Difference]: Without dead ends: 2668 [2018-12-03 16:13:44,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:13:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-12-03 16:13:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-12-03 16:13:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-12-03 16:13:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-12-03 16:13:45,408 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-12-03 16:13:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:45,408 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-12-03 16:13:45,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-12-03 16:13:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:13:45,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:45,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:45,409 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:45,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-12-03 16:13:45,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:45,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:45,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:45,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:45,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:45,520 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 16:13:45,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:45,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:45,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:45,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:45,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:45,521 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-12-03 16:13:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:51,088 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-12-03 16:13:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:13:51,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:13:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:51,094 INFO L225 Difference]: With dead ends: 2722 [2018-12-03 16:13:51,094 INFO L226 Difference]: Without dead ends: 2716 [2018-12-03 16:13:51,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:13:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-12-03 16:13:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-12-03 16:13:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-12-03 16:13:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-12-03 16:13:52,259 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-12-03 16:13:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:52,259 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-12-03 16:13:52,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-12-03 16:13:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:13:52,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:52,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:52,260 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:52,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:52,261 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-12-03 16:13:52,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:52,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:52,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:52,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:52,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:52,362 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 16:13:52,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:52,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:52,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:52,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:52,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:52,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:52,363 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-12-03 16:13:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:57,514 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-12-03 16:13:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:13:57,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:13:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:57,520 INFO L225 Difference]: With dead ends: 2962 [2018-12-03 16:13:57,520 INFO L226 Difference]: Without dead ends: 2956 [2018-12-03 16:13:57,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:13:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-12-03 16:13:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-12-03 16:13:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-12-03 16:13:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-12-03 16:13:58,875 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-12-03 16:13:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:58,875 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-12-03 16:13:58,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:13:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-12-03 16:13:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:13:58,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:58,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:13:58,877 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:58,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:58,877 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-12-03 16:13:58,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:58,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:58,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:58,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:58,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:59,073 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 16:13:59,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:13:59,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:13:59,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:13:59,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:13:59,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:13:59,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:13:59,074 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-12-03 16:14:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:04,220 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-12-03 16:14:04,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:14:04,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:14:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:04,226 INFO L225 Difference]: With dead ends: 2948 [2018-12-03 16:14:04,227 INFO L226 Difference]: Without dead ends: 2942 [2018-12-03 16:14:04,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:14:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-12-03 16:14:05,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-12-03 16:14:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-12-03 16:14:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-12-03 16:14:05,628 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-12-03 16:14:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:05,628 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-12-03 16:14:05,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:14:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-12-03 16:14:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:14:05,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:05,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:05,630 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:05,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-12-03 16:14:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:05,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:05,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:05,701 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 16:14:05,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:14:05,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:14:05,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:05,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:14:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:14:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:14:05,703 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-12-03 16:14:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:11,865 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-12-03 16:14:11,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:14:11,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:14:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:11,872 INFO L225 Difference]: With dead ends: 3238 [2018-12-03 16:14:11,872 INFO L226 Difference]: Without dead ends: 3232 [2018-12-03 16:14:11,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:14:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-12-03 16:14:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-12-03 16:14:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-03 16:14:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-12-03 16:14:13,411 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-12-03 16:14:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:13,412 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-12-03 16:14:13,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:14:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-12-03 16:14:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:14:13,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:13,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:13,413 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:13,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-12-03 16:14:13,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:13,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:13,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:13,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:13,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:13,503 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 16:14:13,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:14:13,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:14:13,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:13,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:14:13,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:14:13,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:14:13,505 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-12-03 16:14:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:19,868 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-12-03 16:14:19,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:14:19,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:14:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:19,875 INFO L225 Difference]: With dead ends: 3212 [2018-12-03 16:14:19,875 INFO L226 Difference]: Without dead ends: 3206 [2018-12-03 16:14:19,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:14:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-12-03 16:14:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-12-03 16:14:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-12-03 16:14:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-12-03 16:14:21,372 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-12-03 16:14:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:21,372 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-12-03 16:14:21,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:14:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-12-03 16:14:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:14:21,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:21,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:21,373 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:21,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-12-03 16:14:21,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:21,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:21,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:21,459 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 16:14:21,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:14:21,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:14:21,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:21,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:14:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:14:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:14:21,461 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-12-03 16:14:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:27,296 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-12-03 16:14:27,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:14:27,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:14:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:27,303 INFO L225 Difference]: With dead ends: 3315 [2018-12-03 16:14:27,303 INFO L226 Difference]: Without dead ends: 3309 [2018-12-03 16:14:27,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:14:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-12-03 16:14:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-12-03 16:14:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-12-03 16:14:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-12-03 16:14:29,011 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-12-03 16:14:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:29,012 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-12-03 16:14:29,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:14:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-12-03 16:14:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:14:29,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:29,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:29,013 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:29,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-12-03 16:14:29,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:29,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:29,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:29,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:29,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:29,114 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 16:14:29,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:14:29,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:14:29,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:29,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:14:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:14:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:14:29,116 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-12-03 16:14:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:35,640 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-12-03 16:14:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:14:35,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:14:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:35,647 INFO L225 Difference]: With dead ends: 3446 [2018-12-03 16:14:35,647 INFO L226 Difference]: Without dead ends: 3440 [2018-12-03 16:14:35,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:14:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-12-03 16:14:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-12-03 16:14:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-12-03 16:14:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-12-03 16:14:37,464 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-12-03 16:14:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:37,464 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-12-03 16:14:37,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:14:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-12-03 16:14:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:14:37,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:37,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:37,466 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:37,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-12-03 16:14:37,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:37,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:37,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:37,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:37,549 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 16:14:37,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:14:37,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:14:37,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:37,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:14:37,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:14:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:14:37,551 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-12-03 16:14:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:43,050 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-12-03 16:14:43,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:14:43,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:14:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:43,057 INFO L225 Difference]: With dead ends: 2832 [2018-12-03 16:14:43,057 INFO L226 Difference]: Without dead ends: 2824 [2018-12-03 16:14:43,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:14:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-12-03 16:14:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-12-03 16:14:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-12-03 16:14:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-12-03 16:14:45,008 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-12-03 16:14:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:45,008 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-12-03 16:14:45,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:14:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-12-03 16:14:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:14:45,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:45,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:45,010 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:45,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-12-03 16:14:45,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:45,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:45,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:45,111 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 16:14:45,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:14:45,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:14:45,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:45,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:14:45,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:14:45,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:14:45,112 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-12-03 16:14:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:51,074 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-12-03 16:14:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:14:51,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:14:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:51,080 INFO L225 Difference]: With dead ends: 3157 [2018-12-03 16:14:51,080 INFO L226 Difference]: Without dead ends: 3151 [2018-12-03 16:14:51,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:14:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-12-03 16:14:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-12-03 16:14:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-12-03 16:14:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-12-03 16:14:52,894 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-12-03 16:14:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:52,895 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-12-03 16:14:52,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:14:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-12-03 16:14:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:14:52,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:52,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:14:52,897 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:52,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:52,897 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-12-03 16:14:52,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:52,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:52,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:52,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:52,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:53,058 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 16:14:53,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:14:53,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:14:53,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:14:53,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:14:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:14:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:14:53,059 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-12-03 16:15:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:01,626 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-12-03 16:15:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:15:01,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:15:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:01,634 INFO L225 Difference]: With dead ends: 3822 [2018-12-03 16:15:01,634 INFO L226 Difference]: Without dead ends: 3816 [2018-12-03 16:15:01,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:15:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-12-03 16:15:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-12-03 16:15:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-12-03 16:15:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-12-03 16:15:03,778 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-12-03 16:15:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:03,778 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-12-03 16:15:03,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:15:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-12-03 16:15:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:15:03,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:03,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:03,780 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:03,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-12-03 16:15:03,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:03,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:03,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:03,950 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 16:15:03,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:15:03,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:15:03,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:15:03,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:15:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:15:03,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:15:03,952 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-12-03 16:15:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:13,177 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-12-03 16:15:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:15:13,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:15:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:13,186 INFO L225 Difference]: With dead ends: 4144 [2018-12-03 16:15:13,186 INFO L226 Difference]: Without dead ends: 4138 [2018-12-03 16:15:13,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:15:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-12-03 16:15:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-12-03 16:15:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-12-03 16:15:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-12-03 16:15:15,543 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-12-03 16:15:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:15,543 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-12-03 16:15:15,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:15:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-12-03 16:15:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:15:15,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:15,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:15,545 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:15,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-12-03 16:15:15,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:15,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:15,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:15,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:15,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:15,636 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 16:15:15,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:15:15,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:15:15,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:15:15,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:15:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:15:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:15:15,637 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-12-03 16:15:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:22,934 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-12-03 16:15:22,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:15:22,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:15:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:22,941 INFO L225 Difference]: With dead ends: 3320 [2018-12-03 16:15:22,941 INFO L226 Difference]: Without dead ends: 3314 [2018-12-03 16:15:22,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:15:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-12-03 16:15:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-12-03 16:15:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-12-03 16:15:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-12-03 16:15:25,342 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-12-03 16:15:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:25,342 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-12-03 16:15:25,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:15:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-12-03 16:15:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:15:25,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:25,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:25,345 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:25,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-12-03 16:15:25,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:25,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:25,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:25,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:25,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:25,456 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 16:15:25,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:15:25,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:15:25,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:15:25,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:15:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:15:25,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:15:25,458 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-12-03 16:15:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:34,855 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-12-03 16:15:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:15:34,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:15:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:34,863 INFO L225 Difference]: With dead ends: 4113 [2018-12-03 16:15:34,863 INFO L226 Difference]: Without dead ends: 4107 [2018-12-03 16:15:34,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:15:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-12-03 16:15:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-12-03 16:15:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-12-03 16:15:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-12-03 16:15:37,283 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-12-03 16:15:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:37,284 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-12-03 16:15:37,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:15:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-12-03 16:15:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:15:37,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:37,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:37,285 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:37,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-12-03 16:15:37,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:37,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:37,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:37,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:37,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:37,374 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 16:15:37,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:15:37,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:15:37,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:15:37,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:15:37,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:15:37,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:15:37,375 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. [2018-12-03 16:15:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:47,047 INFO L93 Difference]: Finished difference Result 4521 states and 14364 transitions. [2018-12-03 16:15:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:15:47,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:15:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:47,056 INFO L225 Difference]: With dead ends: 4521 [2018-12-03 16:15:47,057 INFO L226 Difference]: Without dead ends: 4515 [2018-12-03 16:15:47,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:15:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2018-12-03 16:15:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 2187. [2018-12-03 16:15:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2018-12-03 16:15:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 7764 transitions. [2018-12-03 16:15:49,588 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 7764 transitions. Word has length 9 [2018-12-03 16:15:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:49,588 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 7764 transitions. [2018-12-03 16:15:49,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:15:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 7764 transitions. [2018-12-03 16:15:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:15:49,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:49,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:15:49,590 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:49,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:49,590 INFO L82 PathProgramCache]: Analyzing trace with hash -703458751, now seen corresponding path program 1 times [2018-12-03 16:15:49,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:49,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:49,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:49,717 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 16:15:49,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:15:49,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:15:49,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:15:49,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:15:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:15:49,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:15:49,718 INFO L87 Difference]: Start difference. First operand 2187 states and 7764 transitions. Second operand 8 states. [2018-12-03 16:15:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:59,208 INFO L93 Difference]: Finished difference Result 3855 states and 12150 transitions. [2018-12-03 16:15:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:15:59,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:15:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:59,216 INFO L225 Difference]: With dead ends: 3855 [2018-12-03 16:15:59,217 INFO L226 Difference]: Without dead ends: 3849 [2018-12-03 16:15:59,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:15:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2018-12-03 16:16:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 2143. [2018-12-03 16:16:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2018-12-03 16:16:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 7583 transitions. [2018-12-03 16:16:01,718 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 7583 transitions. Word has length 9 [2018-12-03 16:16:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:01,718 INFO L480 AbstractCegarLoop]: Abstraction has 2143 states and 7583 transitions. [2018-12-03 16:16:01,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 7583 transitions. [2018-12-03 16:16:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:16:01,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:01,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:01,720 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:01,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash -703458376, now seen corresponding path program 1 times [2018-12-03 16:16:01,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:01,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:01,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:01,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:01,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:01,834 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 16:16:01,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:16:01,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:16:01,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:16:01,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:01,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:01,835 INFO L87 Difference]: Start difference. First operand 2143 states and 7583 transitions. Second operand 8 states. [2018-12-03 16:16:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:11,763 INFO L93 Difference]: Finished difference Result 4238 states and 13299 transitions. [2018-12-03 16:16:11,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:16:11,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:16:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:11,772 INFO L225 Difference]: With dead ends: 4238 [2018-12-03 16:16:11,772 INFO L226 Difference]: Without dead ends: 4236 [2018-12-03 16:16:11,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:16:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2018-12-03 16:16:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 2077. [2018-12-03 16:16:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2018-12-03 16:16:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 7307 transitions. [2018-12-03 16:16:14,269 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 7307 transitions. Word has length 9 [2018-12-03 16:16:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:14,269 INFO L480 AbstractCegarLoop]: Abstraction has 2077 states and 7307 transitions. [2018-12-03 16:16:14,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 7307 transitions. [2018-12-03 16:16:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:16:14,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:14,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:14,271 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:14,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2069416361, now seen corresponding path program 1 times [2018-12-03 16:16:14,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:14,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:14,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:14,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:14,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:14,372 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 16:16:14,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:16:14,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:16:14,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:16:14,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:14,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:14,373 INFO L87 Difference]: Start difference. First operand 2077 states and 7307 transitions. Second operand 8 states. [2018-12-03 16:16:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:25,886 INFO L93 Difference]: Finished difference Result 4709 states and 14887 transitions. [2018-12-03 16:16:25,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:16:25,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:16:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:25,894 INFO L225 Difference]: With dead ends: 4709 [2018-12-03 16:16:25,894 INFO L226 Difference]: Without dead ends: 4703 [2018-12-03 16:16:25,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:16:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2018-12-03 16:16:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 2205. [2018-12-03 16:16:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2018-12-03 16:16:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 7795 transitions. [2018-12-03 16:16:28,549 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 7795 transitions. Word has length 9 [2018-12-03 16:16:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:28,549 INFO L480 AbstractCegarLoop]: Abstraction has 2205 states and 7795 transitions. [2018-12-03 16:16:28,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 7795 transitions. [2018-12-03 16:16:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:16:28,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:28,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:28,551 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:28,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2069416736, now seen corresponding path program 1 times [2018-12-03 16:16:28,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:28,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:28,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:28,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:28,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:28,880 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 16:16:28,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:16:28,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:16:28,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:16:28,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:16:28,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:16:28,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:16:28,882 INFO L87 Difference]: Start difference. First operand 2205 states and 7795 transitions. Second operand 8 states. [2018-12-03 16:16:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:38,566 INFO L93 Difference]: Finished difference Result 4247 states and 13579 transitions. [2018-12-03 16:16:38,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:16:38,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:16:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:38,574 INFO L225 Difference]: With dead ends: 4247 [2018-12-03 16:16:38,575 INFO L226 Difference]: Without dead ends: 4241 [2018-12-03 16:16:38,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:16:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2018-12-03 16:16:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 2723. [2018-12-03 16:16:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-12-03 16:16:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 9843 transitions. [2018-12-03 16:16:42,064 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 9843 transitions. Word has length 9 [2018-12-03 16:16:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:42,064 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 9843 transitions. [2018-12-03 16:16:42,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:16:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 9843 transitions. [2018-12-03 16:16:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:16:42,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:42,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:42,066 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:42,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2017829461, now seen corresponding path program 1 times [2018-12-03 16:16:42,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:42,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:42,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:42,236 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 16:16:42,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:16:42,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:16:42,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:16:42,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:16:42,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:16:42,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:16:42,238 INFO L87 Difference]: Start difference. First operand 2723 states and 9843 transitions. Second operand 9 states. [2018-12-03 16:16:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:50,871 INFO L93 Difference]: Finished difference Result 6774 states and 23375 transitions. [2018-12-03 16:16:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:16:50,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:16:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:50,880 INFO L225 Difference]: With dead ends: 6774 [2018-12-03 16:16:50,880 INFO L226 Difference]: Without dead ends: 4052 [2018-12-03 16:16:50,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:16:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2018-12-03 16:16:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 2719. [2018-12-03 16:16:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2018-12-03 16:16:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 9745 transitions. [2018-12-03 16:16:54,288 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 9745 transitions. Word has length 9 [2018-12-03 16:16:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:54,288 INFO L480 AbstractCegarLoop]: Abstraction has 2719 states and 9745 transitions. [2018-12-03 16:16:54,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:16:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 9745 transitions. [2018-12-03 16:16:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:16:54,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:54,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:16:54,290 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:54,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2017829350, now seen corresponding path program 1 times [2018-12-03 16:16:54,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:54,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:54,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:54,371 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 16:16:54,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:16:54,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:16:54,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:16:54,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:16:54,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:16:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:16:54,372 INFO L87 Difference]: Start difference. First operand 2719 states and 9745 transitions. Second operand 9 states. [2018-12-03 16:17:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:03,748 INFO L93 Difference]: Finished difference Result 3818 states and 12356 transitions. [2018-12-03 16:17:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:17:03,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:17:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:03,755 INFO L225 Difference]: With dead ends: 3818 [2018-12-03 16:17:03,755 INFO L226 Difference]: Without dead ends: 3812 [2018-12-03 16:17:03,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:17:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2018-12-03 16:17:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 2654. [2018-12-03 16:17:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2018-12-03 16:17:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 9529 transitions. [2018-12-03 16:17:07,212 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 9529 transitions. Word has length 9 [2018-12-03 16:17:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:07,213 INFO L480 AbstractCegarLoop]: Abstraction has 2654 states and 9529 transitions. [2018-12-03 16:17:07,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:17:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 9529 transitions. [2018-12-03 16:17:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:17:07,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:07,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:17:07,214 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:07,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:07,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1544214472, now seen corresponding path program 1 times [2018-12-03 16:17:07,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:07,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:07,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:07,471 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 16:17:07,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:17:07,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:17:07,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:17:07,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:17:07,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:17:07,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:17:07,472 INFO L87 Difference]: Start difference. First operand 2654 states and 9529 transitions. Second operand 9 states. [2018-12-03 16:17:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:16,825 INFO L93 Difference]: Finished difference Result 6017 states and 20262 transitions. [2018-12-03 16:17:16,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:17:16,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:17:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:16,832 INFO L225 Difference]: With dead ends: 6017 [2018-12-03 16:17:16,833 INFO L226 Difference]: Without dead ends: 3832 [2018-12-03 16:17:16,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:17:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2018-12-03 16:17:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 2609. [2018-12-03 16:17:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2018-12-03 16:17:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 9097 transitions. [2018-12-03 16:17:20,253 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 9097 transitions. Word has length 9 [2018-12-03 16:17:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:20,253 INFO L480 AbstractCegarLoop]: Abstraction has 2609 states and 9097 transitions. [2018-12-03 16:17:20,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:17:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 9097 transitions. [2018-12-03 16:17:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:17:20,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:20,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:17:20,255 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:20,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1544214097, now seen corresponding path program 1 times [2018-12-03 16:17:20,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:20,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:20,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:20,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:20,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:20,454 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 16:17:20,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:17:20,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 16:17:20,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:17:20,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:17:20,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:17:20,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:17:20,456 INFO L87 Difference]: Start difference. First operand 2609 states and 9097 transitions. Second operand 9 states. [2018-12-03 16:17:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:32,466 INFO L93 Difference]: Finished difference Result 4453 states and 13944 transitions. [2018-12-03 16:17:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:17:32,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:17:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:32,475 INFO L225 Difference]: With dead ends: 4453 [2018-12-03 16:17:32,475 INFO L226 Difference]: Without dead ends: 4447 [2018-12-03 16:17:32,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:17:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2018-12-03 16:17:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 2339. [2018-12-03 16:17:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2339 states. [2018-12-03 16:17:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 8091 transitions. [2018-12-03 16:17:35,845 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 8091 transitions. Word has length 9 [2018-12-03 16:17:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:35,845 INFO L480 AbstractCegarLoop]: Abstraction has 2339 states and 8091 transitions. [2018-12-03 16:17:35,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:17:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 8091 transitions. [2018-12-03 16:17:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:17:35,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:35,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:17:35,846 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:35,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash -164665634, now seen corresponding path program 1 times [2018-12-03 16:17:35,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:35,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:35,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:35,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:36,005 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 16:17:36,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:17:36,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:17:36,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:17:36,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:17:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:17:36,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:17:36,007 INFO L87 Difference]: Start difference. First operand 2339 states and 8091 transitions. Second operand 8 states. [2018-12-03 16:17:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:45,765 INFO L93 Difference]: Finished difference Result 3691 states and 11650 transitions. [2018-12-03 16:17:45,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:17:45,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:17:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:45,772 INFO L225 Difference]: With dead ends: 3691 [2018-12-03 16:17:45,772 INFO L226 Difference]: Without dead ends: 3689 [2018-12-03 16:17:45,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:17:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-12-03 16:17:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 2341. [2018-12-03 16:17:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2018-12-03 16:17:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 8100 transitions. [2018-12-03 16:17:49,170 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 8100 transitions. Word has length 9 [2018-12-03 16:17:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:49,170 INFO L480 AbstractCegarLoop]: Abstraction has 2341 states and 8100 transitions. [2018-12-03 16:17:49,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:17:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 8100 transitions. [2018-12-03 16:17:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:17:49,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:49,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:17:49,171 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:49,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash -164665523, now seen corresponding path program 1 times [2018-12-03 16:17:49,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:49,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:49,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:49,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:49,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:49,868 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-12-03 16:17:49,987 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 16:17:49,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:17:49,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:17:49,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:17:49,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:17:49,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:17:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:17:49,989 INFO L87 Difference]: Start difference. First operand 2341 states and 8100 transitions. Second operand 8 states. [2018-12-03 16:17:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:59,438 INFO L93 Difference]: Finished difference Result 3575 states and 11166 transitions. [2018-12-03 16:17:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:17:59,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:17:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:59,445 INFO L225 Difference]: With dead ends: 3575 [2018-12-03 16:17:59,445 INFO L226 Difference]: Without dead ends: 3569 [2018-12-03 16:17:59,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:17:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2018-12-03 16:18:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 2282. [2018-12-03 16:18:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2018-12-03 16:18:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 7890 transitions. [2018-12-03 16:18:02,703 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 7890 transitions. Word has length 9 [2018-12-03 16:18:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:02,704 INFO L480 AbstractCegarLoop]: Abstraction has 2282 states and 7890 transitions. [2018-12-03 16:18:02,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:18:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 7890 transitions. [2018-12-03 16:18:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:18:02,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:02,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:18:02,705 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:02,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:02,705 INFO L82 PathProgramCache]: Analyzing trace with hash 105933428, now seen corresponding path program 1 times [2018-12-03 16:18:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:02,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:02,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:03,019 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-03 16:18:03,199 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 16:18:03,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:18:03,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:18:03,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:18:03,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:18:03,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:18:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:18:03,201 INFO L87 Difference]: Start difference. First operand 2282 states and 7890 transitions. Second operand 8 states. [2018-12-03 16:18:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:12,538 INFO L93 Difference]: Finished difference Result 3555 states and 11315 transitions. [2018-12-03 16:18:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:18:12,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:18:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:12,546 INFO L225 Difference]: With dead ends: 3555 [2018-12-03 16:18:12,546 INFO L226 Difference]: Without dead ends: 3549 [2018-12-03 16:18:12,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:18:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2018-12-03 16:18:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 2245. [2018-12-03 16:18:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2018-12-03 16:18:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 7736 transitions. [2018-12-03 16:18:15,891 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 7736 transitions. Word has length 9 [2018-12-03 16:18:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:15,892 INFO L480 AbstractCegarLoop]: Abstraction has 2245 states and 7736 transitions. [2018-12-03 16:18:15,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:18:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 7736 transitions. [2018-12-03 16:18:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:18:15,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:15,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:18:15,894 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:15,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:15,894 INFO L82 PathProgramCache]: Analyzing trace with hash 105933539, now seen corresponding path program 1 times [2018-12-03 16:18:15,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:15,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:15,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:15,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:15,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:16,244 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 16:18:16,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:18:16,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 16:18:16,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:18:16,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:18:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:18:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:18:16,245 INFO L87 Difference]: Start difference. First operand 2245 states and 7736 transitions. Second operand 8 states. [2018-12-03 16:18:18,412 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 16:18:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:25,460 INFO L93 Difference]: Finished difference Result 3393 states and 10634 transitions. [2018-12-03 16:18:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:18:25,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:18:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:25,466 INFO L225 Difference]: With dead ends: 3393 [2018-12-03 16:18:25,466 INFO L226 Difference]: Without dead ends: 3391 [2018-12-03 16:18:25,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:18:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2018-12-03 16:18:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2207. [2018-12-03 16:18:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2018-12-03 16:18:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 7572 transitions. [2018-12-03 16:18:28,717 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 7572 transitions. Word has length 9 [2018-12-03 16:18:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:28,717 INFO L480 AbstractCegarLoop]: Abstraction has 2207 states and 7572 transitions. [2018-12-03 16:18:28,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:18:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 7572 transitions. [2018-12-03 16:18:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:18:28,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:28,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:18:28,720 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:28,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:28,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1791280574, now seen corresponding path program 1 times [2018-12-03 16:18:28,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:28,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:28,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:28,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:28,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:18:28,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:18:28,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:18:28,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:18:28,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:18:28,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:18:28,745 INFO L87 Difference]: Start difference. First operand 2207 states and 7572 transitions. Second operand 4 states. [2018-12-03 16:18:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:31,089 INFO L93 Difference]: Finished difference Result 3105 states and 10535 transitions. [2018-12-03 16:18:31,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:18:31,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 16:18:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:31,091 INFO L225 Difference]: With dead ends: 3105 [2018-12-03 16:18:31,092 INFO L226 Difference]: Without dead ends: 1193 [2018-12-03 16:18:31,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:18:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-12-03 16:18:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 543. [2018-12-03 16:18:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-12-03 16:18:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1674 transitions. [2018-12-03 16:18:32,289 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1674 transitions. Word has length 11 [2018-12-03 16:18:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:32,290 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 1674 transitions. [2018-12-03 16:18:32,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:18:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1674 transitions. [2018-12-03 16:18:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:18:32,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:32,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:18:32,291 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:32,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113719, now seen corresponding path program 1 times [2018-12-03 16:18:32,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:32,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:32,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:32,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:32,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:32,433 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 16:18:32,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:18:32,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:18:32,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:18:32,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:18:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:18:32,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:18:32,435 INFO L87 Difference]: Start difference. First operand 543 states and 1674 transitions. Second operand 10 states. [2018-12-03 16:18:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:48,436 INFO L93 Difference]: Finished difference Result 3379 states and 8888 transitions. [2018-12-03 16:18:48,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:18:48,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:18:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:48,441 INFO L225 Difference]: With dead ends: 3379 [2018-12-03 16:18:48,441 INFO L226 Difference]: Without dead ends: 3182 [2018-12-03 16:18:48,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=527, Invalid=1729, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:18:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2018-12-03 16:18:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 987. [2018-12-03 16:18:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2018-12-03 16:18:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 3210 transitions. [2018-12-03 16:18:50,613 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 3210 transitions. Word has length 11 [2018-12-03 16:18:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:50,613 INFO L480 AbstractCegarLoop]: Abstraction has 987 states and 3210 transitions. [2018-12-03 16:18:50,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:18:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 3210 transitions. [2018-12-03 16:18:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:18:50,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:50,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:18:50,614 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:50,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113722, now seen corresponding path program 1 times [2018-12-03 16:18:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:50,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:50,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:50,719 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 16:18:50,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:18:50,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:18:50,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:18:50,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:18:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:18:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:18:50,720 INFO L87 Difference]: Start difference. First operand 987 states and 3210 transitions. Second operand 10 states. [2018-12-03 16:19:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:03,686 INFO L93 Difference]: Finished difference Result 3217 states and 8817 transitions. [2018-12-03 16:19:03,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:19:03,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:19:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:03,693 INFO L225 Difference]: With dead ends: 3217 [2018-12-03 16:19:03,693 INFO L226 Difference]: Without dead ends: 2555 [2018-12-03 16:19:03,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:19:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-12-03 16:19:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 1088. [2018-12-03 16:19:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2018-12-03 16:19:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 3479 transitions. [2018-12-03 16:19:06,066 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 3479 transitions. Word has length 11 [2018-12-03 16:19:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:06,066 INFO L480 AbstractCegarLoop]: Abstraction has 1088 states and 3479 transitions. [2018-12-03 16:19:06,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:19:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 3479 transitions. [2018-12-03 16:19:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:19:06,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:06,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:19:06,067 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:06,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113725, now seen corresponding path program 1 times [2018-12-03 16:19:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:06,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:06,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:06,517 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 16:19:06,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:19:06,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:19:06,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:19:06,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:19:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:19:06,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:19:06,519 INFO L87 Difference]: Start difference. First operand 1088 states and 3479 transitions. Second operand 10 states. [2018-12-03 16:19:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:20,052 INFO L93 Difference]: Finished difference Result 2969 states and 8028 transitions. [2018-12-03 16:19:20,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:19:20,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:19:20,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:20,058 INFO L225 Difference]: With dead ends: 2969 [2018-12-03 16:19:20,058 INFO L226 Difference]: Without dead ends: 2960 [2018-12-03 16:19:20,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=1381, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:19:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2018-12-03 16:19:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1191. [2018-12-03 16:19:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-03 16:19:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 3784 transitions. [2018-12-03 16:19:22,710 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 3784 transitions. Word has length 11 [2018-12-03 16:19:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:22,710 INFO L480 AbstractCegarLoop]: Abstraction has 1191 states and 3784 transitions. [2018-12-03 16:19:22,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:19:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 3784 transitions. [2018-12-03 16:19:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:19:22,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:22,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:19:22,712 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:22,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash 888605920, now seen corresponding path program 1 times [2018-12-03 16:19:22,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:22,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:22,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:22,889 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 16:19:22,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:19:22,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:19:22,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:19:22,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:19:22,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:19:22,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:19:22,890 INFO L87 Difference]: Start difference. First operand 1191 states and 3784 transitions. Second operand 10 states. [2018-12-03 16:19:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:44,248 INFO L93 Difference]: Finished difference Result 4135 states and 11122 transitions. [2018-12-03 16:19:44,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:19:44,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:19:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:44,255 INFO L225 Difference]: With dead ends: 4135 [2018-12-03 16:19:44,255 INFO L226 Difference]: Without dead ends: 4126 [2018-12-03 16:19:44,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=888, Invalid=4812, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:19:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2018-12-03 16:19:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 1244. [2018-12-03 16:19:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-12-03 16:19:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3975 transitions. [2018-12-03 16:19:47,122 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3975 transitions. Word has length 11 [2018-12-03 16:19:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:47,122 INFO L480 AbstractCegarLoop]: Abstraction has 1244 states and 3975 transitions. [2018-12-03 16:19:47,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:19:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3975 transitions. [2018-12-03 16:19:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:19:47,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:47,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:19:47,124 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:47,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 888605923, now seen corresponding path program 1 times [2018-12-03 16:19:47,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:47,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:47,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:47,260 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 16:19:47,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:19:47,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:19:47,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:19:47,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:19:47,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:19:47,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:19:47,261 INFO L87 Difference]: Start difference. First operand 1244 states and 3975 transitions. Second operand 10 states. [2018-12-03 16:20:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:02,960 INFO L93 Difference]: Finished difference Result 3332 states and 9049 transitions. [2018-12-03 16:20:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:20:02,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:20:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:02,966 INFO L225 Difference]: With dead ends: 3332 [2018-12-03 16:20:02,966 INFO L226 Difference]: Without dead ends: 3323 [2018-12-03 16:20:02,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=1405, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:20:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2018-12-03 16:20:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 1265. [2018-12-03 16:20:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2018-12-03 16:20:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 4049 transitions. [2018-12-03 16:20:05,879 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 4049 transitions. Word has length 11 [2018-12-03 16:20:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:05,879 INFO L480 AbstractCegarLoop]: Abstraction has 1265 states and 4049 transitions. [2018-12-03 16:20:05,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:20:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 4049 transitions. [2018-12-03 16:20:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:20:05,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:05,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:20:05,880 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:05,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:05,881 INFO L82 PathProgramCache]: Analyzing trace with hash 888605926, now seen corresponding path program 1 times [2018-12-03 16:20:05,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:05,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:05,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:05,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:05,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:05,983 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 16:20:05,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:20:05,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:20:05,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:20:05,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:20:05,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:20:05,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:20:05,984 INFO L87 Difference]: Start difference. First operand 1265 states and 4049 transitions. Second operand 10 states. [2018-12-03 16:20:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:20,448 INFO L93 Difference]: Finished difference Result 3029 states and 8339 transitions. [2018-12-03 16:20:20,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:20:20,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:20:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:20,454 INFO L225 Difference]: With dead ends: 3029 [2018-12-03 16:20:20,454 INFO L226 Difference]: Without dead ends: 3026 [2018-12-03 16:20:20,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:20:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2018-12-03 16:20:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1249. [2018-12-03 16:20:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2018-12-03 16:20:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 3989 transitions. [2018-12-03 16:20:23,378 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 3989 transitions. Word has length 11 [2018-12-03 16:20:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:23,378 INFO L480 AbstractCegarLoop]: Abstraction has 1249 states and 3989 transitions. [2018-12-03 16:20:23,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:20:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 3989 transitions. [2018-12-03 16:20:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:20:23,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:23,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:20:23,380 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:23,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash 558747878, now seen corresponding path program 1 times [2018-12-03 16:20:23,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:23,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:23,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:23,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:23,509 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 16:20:23,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:20:23,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:20:23,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:20:23,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:20:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:20:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:20:23,510 INFO L87 Difference]: Start difference. First operand 1249 states and 3989 transitions. Second operand 10 states. [2018-12-03 16:20:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:46,404 INFO L93 Difference]: Finished difference Result 4529 states and 12161 transitions. [2018-12-03 16:20:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:20:46,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:20:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:46,412 INFO L225 Difference]: With dead ends: 4529 [2018-12-03 16:20:46,412 INFO L226 Difference]: Without dead ends: 4520 [2018-12-03 16:20:46,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=808, Invalid=3884, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:20:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2018-12-03 16:20:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1267. [2018-12-03 16:20:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2018-12-03 16:20:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 4032 transitions. [2018-12-03 16:20:49,458 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 4032 transitions. Word has length 11 [2018-12-03 16:20:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:49,458 INFO L480 AbstractCegarLoop]: Abstraction has 1267 states and 4032 transitions. [2018-12-03 16:20:49,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:20:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 4032 transitions. [2018-12-03 16:20:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:20:49,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:49,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:20:49,459 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:49,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:49,460 INFO L82 PathProgramCache]: Analyzing trace with hash 558747881, now seen corresponding path program 1 times [2018-12-03 16:20:49,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:49,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:49,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:49,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:49,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:49,972 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 16:20:49,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:20:49,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:20:49,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:20:49,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:20:49,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:20:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:20:49,973 INFO L87 Difference]: Start difference. First operand 1267 states and 4032 transitions. Second operand 10 states. [2018-12-03 16:21:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:04,901 INFO L93 Difference]: Finished difference Result 3085 states and 8513 transitions. [2018-12-03 16:21:04,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:21:04,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:21:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:04,907 INFO L225 Difference]: With dead ends: 3085 [2018-12-03 16:21:04,908 INFO L226 Difference]: Without dead ends: 3076 [2018-12-03 16:21:04,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:21:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2018-12-03 16:21:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 1305. [2018-12-03 16:21:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-12-03 16:21:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 4165 transitions. [2018-12-03 16:21:08,042 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 4165 transitions. Word has length 11 [2018-12-03 16:21:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:08,042 INFO L480 AbstractCegarLoop]: Abstraction has 1305 states and 4165 transitions. [2018-12-03 16:21:08,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:21:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 4165 transitions. [2018-12-03 16:21:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:21:08,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:08,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:21:08,044 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:08,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:08,044 INFO L82 PathProgramCache]: Analyzing trace with hash 558747884, now seen corresponding path program 1 times [2018-12-03 16:21:08,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:08,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:08,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:08,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:08,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:08,215 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 16:21:08,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:21:08,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:21:08,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:21:08,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:21:08,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:21:08,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:21:08,216 INFO L87 Difference]: Start difference. First operand 1305 states and 4165 transitions. Second operand 10 states. [2018-12-03 16:21:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:23,783 INFO L93 Difference]: Finished difference Result 3119 states and 8661 transitions. [2018-12-03 16:21:23,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:21:23,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:21:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:23,789 INFO L225 Difference]: With dead ends: 3119 [2018-12-03 16:21:23,789 INFO L226 Difference]: Without dead ends: 3110 [2018-12-03 16:21:23,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:21:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2018-12-03 16:21:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 1341. [2018-12-03 16:21:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-12-03 16:21:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4276 transitions. [2018-12-03 16:21:27,072 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4276 transitions. Word has length 11 [2018-12-03 16:21:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:27,072 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4276 transitions. [2018-12-03 16:21:27,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:21:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4276 transitions. [2018-12-03 16:21:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:21:27,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:27,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:21:27,074 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:27,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 910106073, now seen corresponding path program 1 times [2018-12-03 16:21:27,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:27,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:27,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:27,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:27,287 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 16:21:27,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:21:27,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:21:27,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:21:27,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:21:27,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:21:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:21:27,289 INFO L87 Difference]: Start difference. First operand 1341 states and 4276 transitions. Second operand 10 states. [2018-12-03 16:21:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:41,190 INFO L93 Difference]: Finished difference Result 2739 states and 7735 transitions. [2018-12-03 16:21:41,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:21:41,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:21:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:41,196 INFO L225 Difference]: With dead ends: 2739 [2018-12-03 16:21:41,196 INFO L226 Difference]: Without dead ends: 2730 [2018-12-03 16:21:41,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:21:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2018-12-03 16:21:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1376. [2018-12-03 16:21:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2018-12-03 16:21:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 4395 transitions. [2018-12-03 16:21:44,651 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 4395 transitions. Word has length 11 [2018-12-03 16:21:44,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:44,651 INFO L480 AbstractCegarLoop]: Abstraction has 1376 states and 4395 transitions. [2018-12-03 16:21:44,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:21:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 4395 transitions. [2018-12-03 16:21:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:21:44,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:44,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:21:44,653 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:44,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:44,653 INFO L82 PathProgramCache]: Analyzing trace with hash 910106076, now seen corresponding path program 1 times [2018-12-03 16:21:44,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:44,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:44,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:44,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:44,775 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 16:21:44,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:21:44,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:21:44,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:21:44,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:21:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:21:44,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:21:44,776 INFO L87 Difference]: Start difference. First operand 1376 states and 4395 transitions. Second operand 10 states. [2018-12-03 16:21:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:56,989 INFO L93 Difference]: Finished difference Result 2512 states and 7157 transitions. [2018-12-03 16:21:56,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:21:56,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:21:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:56,993 INFO L225 Difference]: With dead ends: 2512 [2018-12-03 16:21:56,994 INFO L226 Difference]: Without dead ends: 2503 [2018-12-03 16:21:56,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:21:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2018-12-03 16:22:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1401. [2018-12-03 16:22:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2018-12-03 16:22:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 4478 transitions. [2018-12-03 16:22:00,581 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 4478 transitions. Word has length 11 [2018-12-03 16:22:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:00,581 INFO L480 AbstractCegarLoop]: Abstraction has 1401 states and 4478 transitions. [2018-12-03 16:22:00,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:22:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 4478 transitions. [2018-12-03 16:22:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:22:00,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:00,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:22:00,582 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:00,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash 910106079, now seen corresponding path program 1 times [2018-12-03 16:22:00,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:00,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:00,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:00,741 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 16:22:00,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:22:00,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:22:00,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:22:00,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:22:00,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:22:00,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:22:00,742 INFO L87 Difference]: Start difference. First operand 1401 states and 4478 transitions. Second operand 10 states. [2018-12-03 16:22:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:16,345 INFO L93 Difference]: Finished difference Result 3207 states and 9059 transitions. [2018-12-03 16:22:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:22:16,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:22:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:16,352 INFO L225 Difference]: With dead ends: 3207 [2018-12-03 16:22:16,352 INFO L226 Difference]: Without dead ends: 3198 [2018-12-03 16:22:16,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:22:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2018-12-03 16:22:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 1415. [2018-12-03 16:22:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2018-12-03 16:22:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4523 transitions. [2018-12-03 16:22:19,997 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4523 transitions. Word has length 11 [2018-12-03 16:22:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:19,997 INFO L480 AbstractCegarLoop]: Abstraction has 1415 states and 4523 transitions. [2018-12-03 16:22:19,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:22:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4523 transitions. [2018-12-03 16:22:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:22:19,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:19,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:22:19,999 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:19,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:19,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109579, now seen corresponding path program 1 times [2018-12-03 16:22:19,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:20,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:20,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:20,184 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 16:22:20,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:22:20,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:22:20,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:22:20,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:22:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:22:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:22:20,186 INFO L87 Difference]: Start difference. First operand 1415 states and 4523 transitions. Second operand 10 states. [2018-12-03 16:22:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:31,670 INFO L93 Difference]: Finished difference Result 2338 states and 6757 transitions. [2018-12-03 16:22:31,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:22:31,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:22:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:31,675 INFO L225 Difference]: With dead ends: 2338 [2018-12-03 16:22:31,675 INFO L226 Difference]: Without dead ends: 2329 [2018-12-03 16:22:31,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:22:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-12-03 16:22:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1454. [2018-12-03 16:22:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-12-03 16:22:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 4664 transitions. [2018-12-03 16:22:35,375 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 4664 transitions. Word has length 11 [2018-12-03 16:22:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:35,375 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 4664 transitions. [2018-12-03 16:22:35,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:22:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 4664 transitions. [2018-12-03 16:22:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:22:35,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:35,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:22:35,376 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:35,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109582, now seen corresponding path program 1 times [2018-12-03 16:22:35,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:35,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:35,495 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 16:22:35,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:22:35,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:22:35,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:22:35,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:22:35,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:22:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:22:35,497 INFO L87 Difference]: Start difference. First operand 1454 states and 4664 transitions. Second operand 10 states. [2018-12-03 16:22:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:46,706 INFO L93 Difference]: Finished difference Result 3078 states and 9084 transitions. [2018-12-03 16:22:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:22:46,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:22:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:46,710 INFO L225 Difference]: With dead ends: 3078 [2018-12-03 16:22:46,710 INFO L226 Difference]: Without dead ends: 2252 [2018-12-03 16:22:46,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:22:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2018-12-03 16:22:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1520. [2018-12-03 16:22:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2018-12-03 16:22:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 4843 transitions. [2018-12-03 16:22:50,656 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 4843 transitions. Word has length 11 [2018-12-03 16:22:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:50,657 INFO L480 AbstractCegarLoop]: Abstraction has 1520 states and 4843 transitions. [2018-12-03 16:22:50,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:22:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 4843 transitions. [2018-12-03 16:22:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:22:50,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:50,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:22:50,658 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:50,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109585, now seen corresponding path program 1 times [2018-12-03 16:22:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:50,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:50,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:50,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:50,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:50,842 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-12-03 16:22:51,300 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 16:22:51,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:22:51,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:22:51,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:22:51,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:22:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:22:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:22:51,301 INFO L87 Difference]: Start difference. First operand 1520 states and 4843 transitions. Second operand 10 states. [2018-12-03 16:23:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:04,806 INFO L93 Difference]: Finished difference Result 2757 states and 7897 transitions. [2018-12-03 16:23:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:23:04,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:23:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:04,811 INFO L225 Difference]: With dead ends: 2757 [2018-12-03 16:23:04,811 INFO L226 Difference]: Without dead ends: 2748 [2018-12-03 16:23:04,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:23:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2018-12-03 16:23:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 1677. [2018-12-03 16:23:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-12-03 16:23:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 5316 transitions. [2018-12-03 16:23:09,298 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 5316 transitions. Word has length 11 [2018-12-03 16:23:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:09,298 INFO L480 AbstractCegarLoop]: Abstraction has 1677 states and 5316 transitions. [2018-12-03 16:23:09,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:23:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 5316 transitions. [2018-12-03 16:23:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:23:09,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:09,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:23:09,300 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:09,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash 641174699, now seen corresponding path program 1 times [2018-12-03 16:23:09,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:09,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:09,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:09,405 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 16:23:09,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:23:09,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:23:09,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:23:09,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:23:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:23:09,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:23:09,407 INFO L87 Difference]: Start difference. First operand 1677 states and 5316 transitions. Second operand 10 states. [2018-12-03 16:23:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:25,201 INFO L93 Difference]: Finished difference Result 3023 states and 8545 transitions. [2018-12-03 16:23:25,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:23:25,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:23:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:25,207 INFO L225 Difference]: With dead ends: 3023 [2018-12-03 16:23:25,207 INFO L226 Difference]: Without dead ends: 3014 [2018-12-03 16:23:25,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:23:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2018-12-03 16:23:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1721. [2018-12-03 16:23:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2018-12-03 16:23:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 5467 transitions. [2018-12-03 16:23:29,892 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 5467 transitions. Word has length 11 [2018-12-03 16:23:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:29,892 INFO L480 AbstractCegarLoop]: Abstraction has 1721 states and 5467 transitions. [2018-12-03 16:23:29,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:23:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 5467 transitions. [2018-12-03 16:23:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:23:29,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:29,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:23:29,894 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:29,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash 641174702, now seen corresponding path program 1 times [2018-12-03 16:23:29,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:29,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:29,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:30,019 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 16:23:30,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:23:30,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:23:30,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:23:30,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:23:30,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:23:30,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:23:30,021 INFO L87 Difference]: Start difference. First operand 1721 states and 5467 transitions. Second operand 10 states. [2018-12-03 16:23:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:45,674 INFO L93 Difference]: Finished difference Result 2959 states and 8425 transitions. [2018-12-03 16:23:45,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:23:45,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:23:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:45,679 INFO L225 Difference]: With dead ends: 2959 [2018-12-03 16:23:45,679 INFO L226 Difference]: Without dead ends: 2950 [2018-12-03 16:23:45,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:23:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2018-12-03 16:23:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1706. [2018-12-03 16:23:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2018-12-03 16:23:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 5408 transitions. [2018-12-03 16:23:50,350 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 5408 transitions. Word has length 11 [2018-12-03 16:23:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:50,350 INFO L480 AbstractCegarLoop]: Abstraction has 1706 states and 5408 transitions. [2018-12-03 16:23:50,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:23:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 5408 transitions. [2018-12-03 16:23:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:23:50,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:50,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:23:50,352 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:50,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:50,352 INFO L82 PathProgramCache]: Analyzing trace with hash 641174705, now seen corresponding path program 1 times [2018-12-03 16:23:50,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:50,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:50,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:50,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:50,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:50,469 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 16:23:50,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:23:50,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:23:50,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:23:50,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:23:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:23:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:23:50,470 INFO L87 Difference]: Start difference. First operand 1706 states and 5408 transitions. Second operand 10 states. [2018-12-03 16:24:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:09,077 INFO L93 Difference]: Finished difference Result 3515 states and 10000 transitions. [2018-12-03 16:24:09,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:24:09,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:24:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:09,083 INFO L225 Difference]: With dead ends: 3515 [2018-12-03 16:24:09,083 INFO L226 Difference]: Without dead ends: 3512 [2018-12-03 16:24:09,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:24:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2018-12-03 16:24:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 1674. [2018-12-03 16:24:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-12-03 16:24:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 5323 transitions. [2018-12-03 16:24:13,692 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 5323 transitions. Word has length 11 [2018-12-03 16:24:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:13,693 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 5323 transitions. [2018-12-03 16:24:13,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:24:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 5323 transitions. [2018-12-03 16:24:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:24:13,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:13,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:13,694 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:13,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:13,694 INFO L82 PathProgramCache]: Analyzing trace with hash 311316657, now seen corresponding path program 1 times [2018-12-03 16:24:13,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:13,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:13,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:13,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:13,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:13,813 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 16:24:13,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:13,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:24:13,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:13,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:24:13,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:24:13,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:13,815 INFO L87 Difference]: Start difference. First operand 1674 states and 5323 transitions. Second operand 10 states. [2018-12-03 16:24:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:32,996 INFO L93 Difference]: Finished difference Result 3480 states and 9801 transitions. [2018-12-03 16:24:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:24:32,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:24:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:33,001 INFO L225 Difference]: With dead ends: 3480 [2018-12-03 16:24:33,001 INFO L226 Difference]: Without dead ends: 3471 [2018-12-03 16:24:33,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:24:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2018-12-03 16:24:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 1683. [2018-12-03 16:24:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2018-12-03 16:24:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 5340 transitions. [2018-12-03 16:24:37,687 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 5340 transitions. Word has length 11 [2018-12-03 16:24:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:37,688 INFO L480 AbstractCegarLoop]: Abstraction has 1683 states and 5340 transitions. [2018-12-03 16:24:37,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:24:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 5340 transitions. [2018-12-03 16:24:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:24:37,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:37,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:37,690 INFO L423 AbstractCegarLoop]: === Iteration 86 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:37,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash 311316660, now seen corresponding path program 1 times [2018-12-03 16:24:37,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:37,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:37,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:37,926 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 16:24:37,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:37,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:24:37,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:37,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:24:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:24:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:37,928 INFO L87 Difference]: Start difference. First operand 1683 states and 5340 transitions. Second operand 10 states. [2018-12-03 16:24:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:54,912 INFO L93 Difference]: Finished difference Result 3012 states and 8515 transitions. [2018-12-03 16:24:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:24:54,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:24:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:54,918 INFO L225 Difference]: With dead ends: 3012 [2018-12-03 16:24:54,918 INFO L226 Difference]: Without dead ends: 3003 [2018-12-03 16:24:54,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:24:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2018-12-03 16:24:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1674. [2018-12-03 16:24:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-12-03 16:24:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 5309 transitions. [2018-12-03 16:24:59,622 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 5309 transitions. Word has length 11 [2018-12-03 16:24:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:59,622 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 5309 transitions. [2018-12-03 16:24:59,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:24:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 5309 transitions. [2018-12-03 16:24:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:24:59,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:59,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:59,625 INFO L423 AbstractCegarLoop]: === Iteration 87 === [productErr16ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:59,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash 311316663, now seen corresponding path program 1 times [2018-12-03 16:24:59,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:59,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:59,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:59,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:59,725 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 16:24:59,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:59,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 16:24:59,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:59,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:24:59,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:24:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:59,727 INFO L87 Difference]: Start difference. First operand 1674 states and 5309 transitions. Second operand 10 states. [2018-12-03 16:25:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:20,205 INFO L93 Difference]: Finished difference Result 3799 states and 10741 transitions. [2018-12-03 16:25:20,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:25:20,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 16:25:20,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:20,211 INFO L225 Difference]: With dead ends: 3799 [2018-12-03 16:25:20,212 INFO L226 Difference]: Without dead ends: 3790 [2018-12-03 16:25:20,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1279, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:25:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states.