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