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