java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:13:17,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:13:17,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:13:17,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:13:17,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:13:17,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:13:17,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:13:17,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:13:17,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:13:17,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:13:17,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:13:17,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:13:17,605 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:13:17,606 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:13:17,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:13:17,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:13:17,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:13:17,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:13:17,613 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:13:17,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:13:17,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:13:17,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:13:17,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:13:17,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:13:17,621 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:13:17,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:13:17,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:13:17,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:13:17,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:13:17,626 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:13:17,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:13:17,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:13:17,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:13:17,627 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:13:17,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:13:17,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:13:17,630 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:13:17,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:13:17,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:13:17,644 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:13:17,645 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:13:17,645 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:13:17,645 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:13:17,645 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:13:17,645 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:13:17,646 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:13:17,646 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:13:17,646 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:13:17,646 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:13:17,647 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:13:17,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:13:17,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:13:17,648 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:13:17,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:13:17,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:13:17,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:13:17,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:13:17,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:13:17,649 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:13:17,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:13:17,649 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:13:17,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:13:17,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:13:17,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:13:17,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:13:17,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:13:17,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:13:17,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:17,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:13:17,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:13:17,651 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:13:17,652 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:13:17,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:13:17,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:13:17,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:13:17,652 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:13:17,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:13:17,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:13:17,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:13:17,710 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:13:17,710 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:13:17,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-12-03 17:13:17,712 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-12-03 17:13:17,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:13:17,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:13:17,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:17,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:13:17,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:13:17,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,813 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:13:17,814 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:13:17,814 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:13:17,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:17,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:13:17,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:13:17,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:13:17,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/1) ... [2018-12-03 17:13:17,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:13:17,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:13:17,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:13:17,872 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:13:17,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (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 17:13:17,947 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 17:13:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 17:13:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 17:13:18,884 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:13:18,884 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:13:18,885 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:18 BoogieIcfgContainer [2018-12-03 17:13:18,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:13:18,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:13:18,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:13:18,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:13:18,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:17" (1/2) ... [2018-12-03 17:13:18,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c3521f and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:13:18, skipping insertion in model container [2018-12-03 17:13:18,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:18" (2/2) ... [2018-12-03 17:13:18,894 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-12-03 17:13:18,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:13:18,914 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-12-03 17:13:18,934 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-12-03 17:13:18,979 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:13:18,980 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:13:18,980 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:13:18,980 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:13:18,980 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:13:18,980 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:13:18,981 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:13:18,981 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:13:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-03 17:13:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:13:19,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:19,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:19,027 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:19,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-12-03 17:13:19,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:19,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:19,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:19,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:19,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:19,492 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 17:13:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:19,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:19,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:13:19,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:13:19,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:13:19,522 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-12-03 17:13:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:21,381 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-12-03 17:13:21,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:13:21,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 17:13:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:21,401 INFO L225 Difference]: With dead ends: 163 [2018-12-03 17:13:21,402 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 17:13:21,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 17:13:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-12-03 17:13:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:13:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-12-03 17:13:21,473 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-12-03 17:13:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:21,473 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-12-03 17:13:21,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:13:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-12-03 17:13:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:13:21,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:21,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:21,478 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:21,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-12-03 17:13:21,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:21,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:21,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:21,594 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 17:13:21,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:21,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:21,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:21,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:13:21,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:13:21,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:13:21,598 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-12-03 17:13:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:22,560 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-12-03 17:13:22,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:13:22,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 17:13:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:22,566 INFO L225 Difference]: With dead ends: 188 [2018-12-03 17:13:22,566 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 17:13:22,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 17:13:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-12-03 17:13:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 17:13:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-12-03 17:13:22,594 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-12-03 17:13:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:22,594 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-12-03 17:13:22,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:13:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-12-03 17:13:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:13:22,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:22,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:22,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:22,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-12-03 17:13:22,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:22,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:22,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:22,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:22,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:22,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:22,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:13:22,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:22,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:22,722 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-12-03 17:13:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:24,469 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-12-03 17:13:24,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:13:24,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 17:13:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:24,476 INFO L225 Difference]: With dead ends: 361 [2018-12-03 17:13:24,476 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 17:13:24,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 17:13:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-12-03 17:13:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 17:13:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-12-03 17:13:24,529 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-12-03 17:13:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:24,530 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-12-03 17:13:24,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-12-03 17:13:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:13:24,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:24,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:24,533 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:24,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:24,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-12-03 17:13:24,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:24,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:24,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:24,705 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 17:13:24,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:24,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:13:24,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:24,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:24,707 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-12-03 17:13:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:26,060 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-12-03 17:13:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:13:26,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 17:13:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:26,064 INFO L225 Difference]: With dead ends: 307 [2018-12-03 17:13:26,065 INFO L226 Difference]: Without dead ends: 302 [2018-12-03 17:13:26,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:13:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-03 17:13:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-12-03 17:13:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 17:13:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-12-03 17:13:26,106 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-12-03 17:13:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:26,106 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-12-03 17:13:26,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-12-03 17:13:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:26,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:26,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:26,110 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:26,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-12-03 17:13:26,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:26,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:26,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:26,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:26,491 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 17:13:26,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:26,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:26,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:26,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:26,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:26,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:26,494 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-12-03 17:13:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:31,287 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-12-03 17:13:31,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:13:31,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:31,294 INFO L225 Difference]: With dead ends: 741 [2018-12-03 17:13:31,295 INFO L226 Difference]: Without dead ends: 733 [2018-12-03 17:13:31,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:13:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-12-03 17:13:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-12-03 17:13:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 17:13:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-12-03 17:13:31,351 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-12-03 17:13:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:31,352 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-12-03 17:13:31,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-12-03 17:13:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:31,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:31,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:31,355 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:31,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:31,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-12-03 17:13:31,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:31,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:31,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:31,438 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 17:13:31,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:31,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:31,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:31,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:31,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:31,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:31,441 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-12-03 17:13:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:37,483 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-12-03 17:13:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:13:37,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:37,491 INFO L225 Difference]: With dead ends: 797 [2018-12-03 17:13:37,491 INFO L226 Difference]: Without dead ends: 789 [2018-12-03 17:13:37,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:13:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-03 17:13:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-12-03 17:13:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-03 17:13:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-12-03 17:13:37,558 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-12-03 17:13:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:37,558 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-12-03 17:13:37,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-12-03 17:13:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:37,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:37,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:37,561 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:37,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:37,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-12-03 17:13:37,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:37,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:37,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:37,663 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 17:13:37,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:37,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:37,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:37,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:37,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:37,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:37,667 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-12-03 17:13:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:39,730 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-12-03 17:13:39,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:13:39,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:39,736 INFO L225 Difference]: With dead ends: 684 [2018-12-03 17:13:39,737 INFO L226 Difference]: Without dead ends: 676 [2018-12-03 17:13:39,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:13:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-12-03 17:13:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-12-03 17:13:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-12-03 17:13:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-12-03 17:13:39,797 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-12-03 17:13:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:39,797 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-12-03 17:13:39,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-12-03 17:13:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:39,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:39,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:39,799 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:39,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-12-03 17:13:39,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:39,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:39,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:39,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:39,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:39,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:39,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:39,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:39,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:39,884 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-12-03 17:13:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:41,287 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-12-03 17:13:41,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:13:41,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:41,293 INFO L225 Difference]: With dead ends: 605 [2018-12-03 17:13:41,293 INFO L226 Difference]: Without dead ends: 597 [2018-12-03 17:13:41,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-12-03 17:13:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-12-03 17:13:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-12-03 17:13:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-12-03 17:13:41,361 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-12-03 17:13:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:41,362 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-12-03 17:13:41,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-12-03 17:13:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:41,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:41,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:41,364 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:41,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-12-03 17:13:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:41,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:41,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:41,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:41,632 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 17:13:41,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:41,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:41,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:41,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:41,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:41,634 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-12-03 17:13:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:43,924 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-12-03 17:13:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:13:43,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:43,932 INFO L225 Difference]: With dead ends: 935 [2018-12-03 17:13:43,933 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 17:13:43,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:13:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 17:13:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-12-03 17:13:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-12-03 17:13:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-12-03 17:13:44,021 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-12-03 17:13:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:44,022 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-12-03 17:13:44,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-12-03 17:13:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:44,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:44,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:44,023 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:44,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-12-03 17:13:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:44,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:44,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:44,104 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 17:13:44,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:44,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:44,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:44,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:44,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:44,106 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-12-03 17:13:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:46,131 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-12-03 17:13:46,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:13:46,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:46,138 INFO L225 Difference]: With dead ends: 923 [2018-12-03 17:13:46,138 INFO L226 Difference]: Without dead ends: 915 [2018-12-03 17:13:46,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:13:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-03 17:13:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-12-03 17:13:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 17:13:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-12-03 17:13:46,244 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-12-03 17:13:46,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:46,245 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-12-03 17:13:46,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-12-03 17:13:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:46,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:46,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:46,246 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:46,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-12-03 17:13:46,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:46,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:46,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:46,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:46,504 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 17:13:46,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:46,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:46,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:46,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:46,505 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-12-03 17:13:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:48,371 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-12-03 17:13:48,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:13:48,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:48,378 INFO L225 Difference]: With dead ends: 837 [2018-12-03 17:13:48,378 INFO L226 Difference]: Without dead ends: 829 [2018-12-03 17:13:48,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-12-03 17:13:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-12-03 17:13:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-12-03 17:13:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-12-03 17:13:48,483 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-12-03 17:13:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:48,483 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-12-03 17:13:48,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-12-03 17:13:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:48,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:48,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:48,485 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:48,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-12-03 17:13:48,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:48,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:48,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:48,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:48,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:48,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:48,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:48,577 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-12-03 17:13:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:50,971 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-12-03 17:13:50,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:13:50,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:50,977 INFO L225 Difference]: With dead ends: 996 [2018-12-03 17:13:50,977 INFO L226 Difference]: Without dead ends: 988 [2018-12-03 17:13:50,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:13:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-12-03 17:13:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-12-03 17:13:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 17:13:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-12-03 17:13:51,091 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-12-03 17:13:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:51,093 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-12-03 17:13:51,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-12-03 17:13:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:51,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:51,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:51,094 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:51,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-12-03 17:13:51,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:51,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:51,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:51,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:51,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:51,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:51,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:51,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:51,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:51,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:51,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:51,201 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-12-03 17:13:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:53,354 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-12-03 17:13:53,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:13:53,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:53,360 INFO L225 Difference]: With dead ends: 913 [2018-12-03 17:13:53,361 INFO L226 Difference]: Without dead ends: 905 [2018-12-03 17:13:53,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:13:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-03 17:13:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-12-03 17:13:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-03 17:13:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-12-03 17:13:53,492 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-12-03 17:13:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:53,493 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-12-03 17:13:53,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-12-03 17:13:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:53,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:53,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:53,495 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:53,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-12-03 17:13:53,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:53,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:53,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:53,594 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 17:13:53,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:53,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:53,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:53,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:53,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:53,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:13:53,596 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-12-03 17:13:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:55,346 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-12-03 17:13:55,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:13:55,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:13:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:55,351 INFO L225 Difference]: With dead ends: 886 [2018-12-03 17:13:55,351 INFO L226 Difference]: Without dead ends: 878 [2018-12-03 17:13:55,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:13:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-12-03 17:13:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-12-03 17:13:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-03 17:13:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-12-03 17:13:55,476 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-12-03 17:13:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:55,476 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-12-03 17:13:55,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-12-03 17:13:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:55,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:55,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:55,477 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:55,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-12-03 17:13:55,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:55,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:55,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:55,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:55,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:55,579 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 17:13:55,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:55,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:55,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:55,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:55,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:55,582 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-12-03 17:13:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:57,797 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-12-03 17:13:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:13:57,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:13:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:57,803 INFO L225 Difference]: With dead ends: 801 [2018-12-03 17:13:57,803 INFO L226 Difference]: Without dead ends: 793 [2018-12-03 17:13:57,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:13:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-03 17:13:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-12-03 17:13:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-03 17:13:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-12-03 17:13:58,003 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-12-03 17:13:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:58,004 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-12-03 17:13:58,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:13:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-12-03 17:13:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:58,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:58,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:58,005 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:58,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:58,006 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-12-03 17:13:58,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:58,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:58,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:58,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:58,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:58,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:58,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:58,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:58,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:58,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:58,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:58,712 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-12-03 17:14:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:01,194 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-12-03 17:14:01,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:14:01,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:01,201 INFO L225 Difference]: With dead ends: 962 [2018-12-03 17:14:01,201 INFO L226 Difference]: Without dead ends: 954 [2018-12-03 17:14:01,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:14:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-03 17:14:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-12-03 17:14:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-03 17:14:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-12-03 17:14:01,365 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-12-03 17:14:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:01,366 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-12-03 17:14:01,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-12-03 17:14:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:01,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:01,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:01,367 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:01,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-12-03 17:14:01,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:01,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:01,452 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 17:14:01,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:01,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:01,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:01,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:01,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:01,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:01,453 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-12-03 17:14:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:04,015 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-12-03 17:14:04,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:14:04,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:04,022 INFO L225 Difference]: With dead ends: 1000 [2018-12-03 17:14:04,022 INFO L226 Difference]: Without dead ends: 992 [2018-12-03 17:14:04,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:14:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-12-03 17:14:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-12-03 17:14:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-12-03 17:14:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-12-03 17:14:04,195 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-12-03 17:14:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:04,195 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-12-03 17:14:04,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-12-03 17:14:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:04,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:04,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:04,197 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:04,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-12-03 17:14:04,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:04,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:04,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:04,291 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 17:14:04,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:04,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:04,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:04,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:04,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:04,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:04,293 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-12-03 17:14:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:07,182 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-12-03 17:14:07,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:14:07,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:07,187 INFO L225 Difference]: With dead ends: 1065 [2018-12-03 17:14:07,187 INFO L226 Difference]: Without dead ends: 1057 [2018-12-03 17:14:07,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:14:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-12-03 17:14:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-12-03 17:14:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-03 17:14:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-12-03 17:14:07,391 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-12-03 17:14:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:07,392 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-12-03 17:14:07,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-12-03 17:14:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:07,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:07,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:07,393 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:07,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-12-03 17:14:07,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:07,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:07,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:07,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:07,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:07,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 17:14:07,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:07,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:07,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:07,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:07,524 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-12-03 17:14:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:10,929 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-12-03 17:14:10,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:14:10,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:10,935 INFO L225 Difference]: With dead ends: 1227 [2018-12-03 17:14:10,935 INFO L226 Difference]: Without dead ends: 1219 [2018-12-03 17:14:10,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:14:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-12-03 17:14:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-12-03 17:14:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-12-03 17:14:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-12-03 17:14:11,138 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-12-03 17:14:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:11,139 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-12-03 17:14:11,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-12-03 17:14:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:11,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:11,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:11,140 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:11,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:11,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-12-03 17:14:11,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:11,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:11,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:11,218 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 17:14:11,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:11,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:11,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:11,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:11,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:11,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:11,219 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-12-03 17:14:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:14,314 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-12-03 17:14:14,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:14:14,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:14,320 INFO L225 Difference]: With dead ends: 1076 [2018-12-03 17:14:14,320 INFO L226 Difference]: Without dead ends: 1068 [2018-12-03 17:14:14,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:14:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-12-03 17:14:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-12-03 17:14:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-03 17:14:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-12-03 17:14:14,568 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-12-03 17:14:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:14,568 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-12-03 17:14:14,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-12-03 17:14:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:14,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:14,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:14,570 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:14,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:14,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-12-03 17:14:14,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:14,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:14,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:14,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:14,673 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 17:14:14,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:14,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:14,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:14,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:14,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:14,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:14,675 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-12-03 17:14:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:17,325 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-12-03 17:14:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:17,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:17,331 INFO L225 Difference]: With dead ends: 1111 [2018-12-03 17:14:17,331 INFO L226 Difference]: Without dead ends: 1103 [2018-12-03 17:14:17,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:14:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-12-03 17:14:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-12-03 17:14:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 17:14:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-12-03 17:14:17,661 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-12-03 17:14:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:17,661 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-12-03 17:14:17,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-12-03 17:14:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:17,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:17,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:17,663 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:17,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-12-03 17:14:17,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:17,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:17,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:17,801 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 17:14:17,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:17,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:17,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:17,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:17,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:17,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:17,803 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-12-03 17:14:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:21,465 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-12-03 17:14:21,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:14:21,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:21,473 INFO L225 Difference]: With dead ends: 1304 [2018-12-03 17:14:21,473 INFO L226 Difference]: Without dead ends: 1296 [2018-12-03 17:14:21,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:14:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-12-03 17:14:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-12-03 17:14:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-12-03 17:14:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-12-03 17:14:21,788 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-12-03 17:14:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:21,788 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-12-03 17:14:21,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-12-03 17:14:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:21,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:21,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:21,789 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:21,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-12-03 17:14:21,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:21,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:21,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:21,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:21,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:21,873 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 17:14:21,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:21,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:21,874 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:21,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:21,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:21,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:21,875 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-12-03 17:14:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:25,757 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-12-03 17:14:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:25,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:25,767 INFO L225 Difference]: With dead ends: 1370 [2018-12-03 17:14:25,767 INFO L226 Difference]: Without dead ends: 1362 [2018-12-03 17:14:25,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:14:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-12-03 17:14:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-12-03 17:14:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-12-03 17:14:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-12-03 17:14:26,087 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-12-03 17:14:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:26,087 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-12-03 17:14:26,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-12-03 17:14:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:26,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:26,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:26,089 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:26,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:26,089 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-12-03 17:14:26,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:26,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:26,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:26,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:26,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:26,218 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 17:14:26,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:26,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:26,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:26,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:26,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:26,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:26,221 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-12-03 17:14:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:29,287 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-12-03 17:14:29,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:14:29,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:29,293 INFO L225 Difference]: With dead ends: 1298 [2018-12-03 17:14:29,293 INFO L226 Difference]: Without dead ends: 1290 [2018-12-03 17:14:29,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:14:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-12-03 17:14:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-12-03 17:14:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 17:14:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-12-03 17:14:29,732 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-12-03 17:14:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:29,732 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-12-03 17:14:29,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-12-03 17:14:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:29,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:29,733 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:29,733 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:29,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-12-03 17:14:29,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:29,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:29,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:29,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:29,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:29,941 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 17:14:29,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:29,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:14:29,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:29,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:14:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:14:29,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:14:29,943 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-12-03 17:14:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:31,026 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-12-03 17:14:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:14:31,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 17:14:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:31,029 INFO L225 Difference]: With dead ends: 1242 [2018-12-03 17:14:31,029 INFO L226 Difference]: Without dead ends: 673 [2018-12-03 17:14:31,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-12-03 17:14:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-12-03 17:14:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-03 17:14:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-12-03 17:14:31,515 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-12-03 17:14:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:31,515 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-12-03 17:14:31,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:14:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-12-03 17:14:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:31,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:31,515 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:31,516 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:31,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-12-03 17:14:31,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:31,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:31,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:31,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:31,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:31,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:31,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:31,613 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:31,615 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [67], [72], [78], [279], [285], [286], [349] [2018-12-03 17:14:31,667 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:31,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:32,082 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:32,084 INFO L272 AbstractInterpreter]: Visited 11 different actions 36 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:32,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:32,128 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:32,195 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 57.52% of their original sizes. [2018-12-03 17:14:32,195 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:32,572 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:32,573 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:32,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:32,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 15 [2018-12-03 17:14:32,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:32,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:14:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:14:32,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:14:32,575 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 10 states. [2018-12-03 17:14:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:38,406 INFO L93 Difference]: Finished difference Result 982 states and 2293 transitions. [2018-12-03 17:14:38,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:14:38,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-03 17:14:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:38,410 INFO L225 Difference]: With dead ends: 982 [2018-12-03 17:14:38,410 INFO L226 Difference]: Without dead ends: 977 [2018-12-03 17:14:38,411 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:38,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-12-03 17:14:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 741. [2018-12-03 17:14:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 17:14:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1751 transitions. [2018-12-03 17:14:39,532 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1751 transitions. Word has length 13 [2018-12-03 17:14:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:39,532 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1751 transitions. [2018-12-03 17:14:39,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:14:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1751 transitions. [2018-12-03 17:14:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:14:39,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:39,533 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:39,534 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:39,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-12-03 17:14:39,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:39,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:39,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:39,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:39,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:39,724 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:14:39,725 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [122], [199], [203], [207], [236], [245], [254], [260], [274], [349] [2018-12-03 17:14:39,727 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:39,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:39,761 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:39,761 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:39,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:39,789 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:39,814 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60% of their original sizes. [2018-12-03 17:14:39,815 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:40,165 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:14:40,165 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:40,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:40,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:14:40,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:40,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:14:40,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:14:40,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:14:40,166 INFO L87 Difference]: Start difference. First operand 741 states and 1751 transitions. Second operand 13 states. [2018-12-03 17:15:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:11,396 INFO L93 Difference]: Finished difference Result 1829 states and 4262 transitions. [2018-12-03 17:15:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:15:11,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:15:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:11,400 INFO L225 Difference]: With dead ends: 1829 [2018-12-03 17:15:11,400 INFO L226 Difference]: Without dead ends: 1821 [2018-12-03 17:15:11,401 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=649, Invalid=1703, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:15:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2018-12-03 17:15:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1153. [2018-12-03 17:15:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-12-03 17:15:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2810 transitions. [2018-12-03 17:15:12,511 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2810 transitions. Word has length 16 [2018-12-03 17:15:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:12,511 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 2810 transitions. [2018-12-03 17:15:12,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:15:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2810 transitions. [2018-12-03 17:15:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:12,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:12,512 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:12,512 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:12,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-12-03 17:15:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:12,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:12,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:12,614 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:12,614 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [115], [199], [203], [207], [236], [245], [254], [260], [274], [349] [2018-12-03 17:15:12,615 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:12,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:12,639 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:12,640 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:15:12,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:12,661 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:12,683 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.63% of their original sizes. [2018-12-03 17:15:12,683 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:12,924 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:15:12,924 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:12,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:12,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:15:12,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:12,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:15:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:15:12,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:15:12,925 INFO L87 Difference]: Start difference. First operand 1153 states and 2810 transitions. Second operand 13 states. [2018-12-03 17:15:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:25,234 INFO L93 Difference]: Finished difference Result 1887 states and 4411 transitions. [2018-12-03 17:15:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:15:25,234 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:15:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:25,239 INFO L225 Difference]: With dead ends: 1887 [2018-12-03 17:15:25,239 INFO L226 Difference]: Without dead ends: 1879 [2018-12-03 17:15:25,241 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1032, Invalid=3660, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:15:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2018-12-03 17:15:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1122. [2018-12-03 17:15:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-12-03 17:15:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2740 transitions. [2018-12-03 17:15:26,393 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2740 transitions. Word has length 16 [2018-12-03 17:15:26,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:26,394 INFO L480 AbstractCegarLoop]: Abstraction has 1122 states and 2740 transitions. [2018-12-03 17:15:26,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:15:26,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2740 transitions. [2018-12-03 17:15:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:26,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:26,395 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:26,395 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:26,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:26,395 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-12-03 17:15:26,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:26,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:26,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:26,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:26,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:26,500 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:26,500 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [115], [199], [203], [207], [236], [245], [260], [274], [349] [2018-12-03 17:15:26,501 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:26,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:26,527 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:26,527 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:15:26,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:26,563 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:26,590 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.86% of their original sizes. [2018-12-03 17:15:26,591 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:26,828 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:15:26,829 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:26,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:26,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:15:26,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:26,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:15:26,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:15:26,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:15:26,830 INFO L87 Difference]: Start difference. First operand 1122 states and 2740 transitions. Second operand 13 states. [2018-12-03 17:15:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:37,144 INFO L93 Difference]: Finished difference Result 1825 states and 4256 transitions. [2018-12-03 17:15:37,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:15:37,144 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:15:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:37,149 INFO L225 Difference]: With dead ends: 1825 [2018-12-03 17:15:37,150 INFO L226 Difference]: Without dead ends: 1817 [2018-12-03 17:15:37,152 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=727, Invalid=2579, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:15:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-12-03 17:15:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 960. [2018-12-03 17:15:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-12-03 17:15:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2307 transitions. [2018-12-03 17:15:38,395 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2307 transitions. Word has length 16 [2018-12-03 17:15:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:38,396 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 2307 transitions. [2018-12-03 17:15:38,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:15:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2307 transitions. [2018-12-03 17:15:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:38,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:38,397 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:38,397 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:38,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1925014454, now seen corresponding path program 1 times [2018-12-03 17:15:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:38,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:38,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:38,472 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 17:15:38,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:38,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:15:38,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:38,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:15:38,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:15:38,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:15:38,473 INFO L87 Difference]: Start difference. First operand 960 states and 2307 transitions. Second operand 6 states. [2018-12-03 17:15:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:40,255 INFO L93 Difference]: Finished difference Result 1963 states and 4671 transitions. [2018-12-03 17:15:40,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:15:40,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-03 17:15:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:40,258 INFO L225 Difference]: With dead ends: 1963 [2018-12-03 17:15:40,258 INFO L226 Difference]: Without dead ends: 1004 [2018-12-03 17:15:40,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:15:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-12-03 17:15:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 960. [2018-12-03 17:15:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-12-03 17:15:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2180 transitions. [2018-12-03 17:15:41,286 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2180 transitions. Word has length 16 [2018-12-03 17:15:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:41,286 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 2180 transitions. [2018-12-03 17:15:41,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:15:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2180 transitions. [2018-12-03 17:15:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:41,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:41,287 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:41,287 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:41,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1147109874, now seen corresponding path program 1 times [2018-12-03 17:15:41,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:41,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:41,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:41,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:41,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:41,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:41,386 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:41,386 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [199], [203], [207], [236], [245], [254], [264], [274], [349] [2018-12-03 17:15:41,387 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:41,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:41,407 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:41,408 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:15:41,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:41,412 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:41,426 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.53% of their original sizes. [2018-12-03 17:15:41,426 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:41,565 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:15:41,566 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:41,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:41,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:15:41,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:41,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:15:41,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:15:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:15:41,568 INFO L87 Difference]: Start difference. First operand 960 states and 2180 transitions. Second operand 13 states. [2018-12-03 17:15:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:50,698 INFO L93 Difference]: Finished difference Result 1685 states and 3709 transitions. [2018-12-03 17:15:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:15:50,698 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:15:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:50,702 INFO L225 Difference]: With dead ends: 1685 [2018-12-03 17:15:50,702 INFO L226 Difference]: Without dead ends: 1677 [2018-12-03 17:15:50,703 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:15:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2018-12-03 17:15:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1100. [2018-12-03 17:15:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-12-03 17:15:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 2497 transitions. [2018-12-03 17:15:52,118 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 2497 transitions. Word has length 16 [2018-12-03 17:15:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:52,118 INFO L480 AbstractCegarLoop]: Abstraction has 1100 states and 2497 transitions. [2018-12-03 17:15:52,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:15:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 2497 transitions. [2018-12-03 17:15:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:52,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:52,119 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:52,119 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:52,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1762524116, now seen corresponding path program 1 times [2018-12-03 17:15:52,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:52,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:52,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:52,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:52,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:52,200 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:52,200 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [94], [98], [199], [203], [207], [236], [245], [264], [274], [349] [2018-12-03 17:15:52,201 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:52,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:52,224 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:15:52,224 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:15:52,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:52,230 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:15:52,242 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.75% of their original sizes. [2018-12-03 17:15:52,243 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:15:52,386 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:15:52,386 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:15:52,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:15:52,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:15:52,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:52,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:15:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:15:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:15:52,387 INFO L87 Difference]: Start difference. First operand 1100 states and 2497 transitions. Second operand 13 states. [2018-12-03 17:16:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:03,271 INFO L93 Difference]: Finished difference Result 2042 states and 4515 transitions. [2018-12-03 17:16:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:16:03,271 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:16:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:03,274 INFO L225 Difference]: With dead ends: 2042 [2018-12-03 17:16:03,274 INFO L226 Difference]: Without dead ends: 2034 [2018-12-03 17:16:03,275 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=570, Invalid=1980, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:16:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2018-12-03 17:16:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1136. [2018-12-03 17:16:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2018-12-03 17:16:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 2577 transitions. [2018-12-03 17:16:04,666 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 2577 transitions. Word has length 16 [2018-12-03 17:16:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:04,666 INFO L480 AbstractCegarLoop]: Abstraction has 1136 states and 2577 transitions. [2018-12-03 17:16:04,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:16:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2577 transitions. [2018-12-03 17:16:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:04,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:04,667 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:04,668 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:04,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash 352691054, now seen corresponding path program 1 times [2018-12-03 17:16:04,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:04,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:04,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:04,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:04,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:04,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:04,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:04,772 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:16:04,772 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [199], [203], [207], [236], [245], [264], [274], [292], [349] [2018-12-03 17:16:04,773 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:04,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:04,793 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:16:04,794 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:16:04,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:04,804 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:16:04,816 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.31% of their original sizes. [2018-12-03 17:16:04,817 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:16:04,932 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:16:04,932 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:16:04,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:04,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:16:04,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:04,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:16:04,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:16:04,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:16:04,934 INFO L87 Difference]: Start difference. First operand 1136 states and 2577 transitions. Second operand 13 states. [2018-12-03 17:16:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:15,910 INFO L93 Difference]: Finished difference Result 1968 states and 4341 transitions. [2018-12-03 17:16:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:16:15,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:16:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:15,913 INFO L225 Difference]: With dead ends: 1968 [2018-12-03 17:16:15,913 INFO L226 Difference]: Without dead ends: 1960 [2018-12-03 17:16:15,915 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=610, Invalid=2252, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:16:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2018-12-03 17:16:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1136. [2018-12-03 17:16:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2018-12-03 17:16:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 2576 transitions. [2018-12-03 17:16:17,338 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 2576 transitions. Word has length 16 [2018-12-03 17:16:17,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:17,338 INFO L480 AbstractCegarLoop]: Abstraction has 1136 states and 2576 transitions. [2018-12-03 17:16:17,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:16:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2576 transitions. [2018-12-03 17:16:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:17,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:17,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:17,339 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:17,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:17,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-12-03 17:16:17,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:17,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:17,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:17,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:17,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:17,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:17,438 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:16:17,439 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [179], [203], [217], [236], [245], [264], [274], [292], [298], [310], [349] [2018-12-03 17:16:17,440 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:17,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:17,466 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:16:17,466 INFO L272 AbstractInterpreter]: Visited 16 different actions 49 times. Merged at 8 different actions 29 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:16:17,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:17,481 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:16:17,492 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 48.55% of their original sizes. [2018-12-03 17:16:17,493 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:16:17,689 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:16:17,689 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:16:17,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:17,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 21 [2018-12-03 17:16:17,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:17,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:16:17,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:16:17,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:16:17,691 INFO L87 Difference]: Start difference. First operand 1136 states and 2576 transitions. Second operand 15 states. [2018-12-03 17:16:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:27,892 INFO L93 Difference]: Finished difference Result 2167 states and 4830 transitions. [2018-12-03 17:16:27,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:16:27,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:16:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:27,894 INFO L225 Difference]: With dead ends: 2167 [2018-12-03 17:16:27,895 INFO L226 Difference]: Without dead ends: 2153 [2018-12-03 17:16:27,895 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:16:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2018-12-03 17:16:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1374. [2018-12-03 17:16:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2018-12-03 17:16:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 3122 transitions. [2018-12-03 17:16:29,758 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 3122 transitions. Word has length 16 [2018-12-03 17:16:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:29,758 INFO L480 AbstractCegarLoop]: Abstraction has 1374 states and 3122 transitions. [2018-12-03 17:16:29,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:16:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 3122 transitions. [2018-12-03 17:16:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:29,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:29,759 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:29,760 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:29,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-12-03 17:16:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:29,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:30,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:30,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:30,461 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:16:30,461 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [92], [199], [203], [207], [236], [245], [254], [349] [2018-12-03 17:16:30,462 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:30,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:30,477 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:16:30,478 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:16:30,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:30,479 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:16:30,493 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.37% of their original sizes. [2018-12-03 17:16:30,494 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:16:30,652 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:16:30,653 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:16:30,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:30,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:16:30,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:30,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:16:30,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:16:30,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:16:30,654 INFO L87 Difference]: Start difference. First operand 1374 states and 3122 transitions. Second operand 13 states. [2018-12-03 17:16:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:41,325 INFO L93 Difference]: Finished difference Result 2031 states and 4490 transitions. [2018-12-03 17:16:41,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:16:41,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:16:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:41,328 INFO L225 Difference]: With dead ends: 2031 [2018-12-03 17:16:41,328 INFO L226 Difference]: Without dead ends: 2023 [2018-12-03 17:16:41,329 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=454, Invalid=1438, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:16:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-12-03 17:16:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1394. [2018-12-03 17:16:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2018-12-03 17:16:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 3172 transitions. [2018-12-03 17:16:43,408 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 3172 transitions. Word has length 16 [2018-12-03 17:16:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:43,408 INFO L480 AbstractCegarLoop]: Abstraction has 1394 states and 3172 transitions. [2018-12-03 17:16:43,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:16:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 3172 transitions. [2018-12-03 17:16:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:43,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:43,409 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:43,410 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:43,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:43,410 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-12-03 17:16:43,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:43,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:43,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:43,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:43,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:43,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:43,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:43,498 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:16:43,499 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [98], [199], [203], [207], [236], [245], [349] [2018-12-03 17:16:43,500 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:43,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:43,521 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:16:43,521 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:16:43,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:43,529 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:16:43,540 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.59% of their original sizes. [2018-12-03 17:16:43,541 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:16:43,854 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:16:43,854 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:16:43,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:43,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:16:43,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:43,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:16:43,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:16:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:16:43,856 INFO L87 Difference]: Start difference. First operand 1394 states and 3172 transitions. Second operand 13 states. [2018-12-03 17:16:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:55,436 INFO L93 Difference]: Finished difference Result 2297 states and 5103 transitions. [2018-12-03 17:16:55,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:16:55,437 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:16:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:55,439 INFO L225 Difference]: With dead ends: 2297 [2018-12-03 17:16:55,440 INFO L226 Difference]: Without dead ends: 2289 [2018-12-03 17:16:55,441 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=571, Invalid=1781, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:16:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2018-12-03 17:16:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1412. [2018-12-03 17:16:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-12-03 17:16:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3209 transitions. [2018-12-03 17:16:57,438 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3209 transitions. Word has length 16 [2018-12-03 17:16:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:57,438 INFO L480 AbstractCegarLoop]: Abstraction has 1412 states and 3209 transitions. [2018-12-03 17:16:57,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:16:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3209 transitions. [2018-12-03 17:16:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:57,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:57,439 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:57,440 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:57,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2014581314, now seen corresponding path program 1 times [2018-12-03 17:16:57,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:57,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:57,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:57,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:57,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:57,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:57,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:57,534 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:16:57,534 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [98], [199], [203], [207], [236], [245], [292], [349] [2018-12-03 17:16:57,535 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:57,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:57,551 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:16:57,551 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:16:57,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:57,553 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:16:57,563 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.15% of their original sizes. [2018-12-03 17:16:57,564 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:16:57,677 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:16:57,678 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:16:57,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:16:57,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:16:57,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:57,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:16:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:16:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:16:57,679 INFO L87 Difference]: Start difference. First operand 1412 states and 3209 transitions. Second operand 13 states. [2018-12-03 17:17:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:10,161 INFO L93 Difference]: Finished difference Result 2364 states and 5238 transitions. [2018-12-03 17:17:10,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:17:10,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:17:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:10,163 INFO L225 Difference]: With dead ends: 2364 [2018-12-03 17:17:10,163 INFO L226 Difference]: Without dead ends: 2356 [2018-12-03 17:17:10,165 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=639, Invalid=2117, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:17:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2018-12-03 17:17:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1348. [2018-12-03 17:17:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-12-03 17:17:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3067 transitions. [2018-12-03 17:17:12,089 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 3067 transitions. Word has length 16 [2018-12-03 17:17:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:12,089 INFO L480 AbstractCegarLoop]: Abstraction has 1348 states and 3067 transitions. [2018-12-03 17:17:12,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:17:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 3067 transitions. [2018-12-03 17:17:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:17:12,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:12,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:12,091 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:12,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash 714972923, now seen corresponding path program 1 times [2018-12-03 17:17:12,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:12,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:12,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:12,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:12,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:12,168 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:17:12,168 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [98], [179], [203], [217], [236], [245], [292], [298], [310], [349] [2018-12-03 17:17:12,169 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:12,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:12,192 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:17:12,192 INFO L272 AbstractInterpreter]: Visited 16 different actions 49 times. Merged at 8 different actions 29 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:17:12,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:12,209 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:17:12,223 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 48.35% of their original sizes. [2018-12-03 17:17:12,223 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:17:12,435 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:17:12,435 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:17:12,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:17:12,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 21 [2018-12-03 17:17:12,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:12,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:17:12,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:17:12,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:17:12,436 INFO L87 Difference]: Start difference. First operand 1348 states and 3067 transitions. Second operand 15 states. [2018-12-03 17:17:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:25,519 INFO L93 Difference]: Finished difference Result 2199 states and 4922 transitions. [2018-12-03 17:17:25,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:17:25,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:17:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:25,522 INFO L225 Difference]: With dead ends: 2199 [2018-12-03 17:17:25,522 INFO L226 Difference]: Without dead ends: 2185 [2018-12-03 17:17:25,523 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:17:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2018-12-03 17:17:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1350. [2018-12-03 17:17:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2018-12-03 17:17:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 3071 transitions. [2018-12-03 17:17:27,673 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 3071 transitions. Word has length 16 [2018-12-03 17:17:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:27,673 INFO L480 AbstractCegarLoop]: Abstraction has 1350 states and 3071 transitions. [2018-12-03 17:17:27,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:17:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 3071 transitions. [2018-12-03 17:17:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:17:27,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:27,674 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:27,674 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:27,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-12-03 17:17:27,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:27,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:27,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:27,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:27,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:27,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:27,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:27,739 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:17:27,739 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [67], [72], [78], [98], [199], [203], [207], [236], [245], [292], [349] [2018-12-03 17:17:27,742 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:27,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:27,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:17:27,758 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:17:27,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:27,762 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:17:27,772 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.15% of their original sizes. [2018-12-03 17:17:27,773 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:17:27,887 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:17:27,887 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:17:27,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:17:27,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 17:17:27,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:27,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:17:27,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:17:27,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:17:27,889 INFO L87 Difference]: Start difference. First operand 1350 states and 3071 transitions. Second operand 13 states. [2018-12-03 17:17:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:39,265 INFO L93 Difference]: Finished difference Result 1993 states and 4401 transitions. [2018-12-03 17:17:39,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:17:39,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:17:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:39,268 INFO L225 Difference]: With dead ends: 1993 [2018-12-03 17:17:39,268 INFO L226 Difference]: Without dead ends: 1985 [2018-12-03 17:17:39,269 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=1908, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:17:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2018-12-03 17:17:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1234. [2018-12-03 17:17:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234 states. [2018-12-03 17:17:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 2802 transitions. [2018-12-03 17:17:41,243 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 2802 transitions. Word has length 16 [2018-12-03 17:17:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:41,243 INFO L480 AbstractCegarLoop]: Abstraction has 1234 states and 2802 transitions. [2018-12-03 17:17:41,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:17:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 2802 transitions. [2018-12-03 17:17:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:17:41,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:41,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:41,244 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:41,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash -688951426, now seen corresponding path program 1 times [2018-12-03 17:17:41,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:41,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:41,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:41,714 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 17:17:41,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:17:41,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 17:17:41,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:41,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:17:41,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:17:41,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:17:41,715 INFO L87 Difference]: Start difference. First operand 1234 states and 2802 transitions. Second operand 9 states. [2018-12-03 17:17:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:47,164 INFO L93 Difference]: Finished difference Result 1719 states and 3818 transitions. [2018-12-03 17:17:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:17:47,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:17:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:47,167 INFO L225 Difference]: With dead ends: 1719 [2018-12-03 17:17:47,167 INFO L226 Difference]: Without dead ends: 1711 [2018-12-03 17:17:47,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:17:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2018-12-03 17:17:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1122. [2018-12-03 17:17:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-12-03 17:17:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2537 transitions. [2018-12-03 17:17:48,883 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2537 transitions. Word has length 16 [2018-12-03 17:17:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:48,883 INFO L480 AbstractCegarLoop]: Abstraction has 1122 states and 2537 transitions. [2018-12-03 17:17:48,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:17:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2537 transitions. [2018-12-03 17:17:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:17:48,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:48,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:48,884 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:48,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash -688849281, now seen corresponding path program 1 times [2018-12-03 17:17:48,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:48,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:48,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:48,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:48,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:48,957 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 17:17:48,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:17:48,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 17:17:48,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:48,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:17:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:17:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:17:48,958 INFO L87 Difference]: Start difference. First operand 1122 states and 2537 transitions. Second operand 9 states. [2018-12-03 17:17:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:53,658 INFO L93 Difference]: Finished difference Result 1438 states and 3140 transitions. [2018-12-03 17:17:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:17:53,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:17:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:53,660 INFO L225 Difference]: With dead ends: 1438 [2018-12-03 17:17:53,660 INFO L226 Difference]: Without dead ends: 1430 [2018-12-03 17:17:53,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:17:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-12-03 17:17:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1112. [2018-12-03 17:17:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-12-03 17:17:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 2512 transitions. [2018-12-03 17:17:55,481 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 2512 transitions. Word has length 16 [2018-12-03 17:17:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:55,482 INFO L480 AbstractCegarLoop]: Abstraction has 1112 states and 2512 transitions. [2018-12-03 17:17:55,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:17:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2512 transitions. [2018-12-03 17:17:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:17:55,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:55,482 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:55,483 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:55,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:55,483 INFO L82 PathProgramCache]: Analyzing trace with hash -679935045, now seen corresponding path program 1 times [2018-12-03 17:17:55,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:55,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:55,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:55,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:55,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:55,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:55,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:55,595 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:17:55,596 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [67], [72], [78], [174], [179], [183], [203], [217], [298], [310], [349] [2018-12-03 17:17:55,596 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:55,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:55,608 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:17:55,608 INFO L272 AbstractInterpreter]: Visited 14 different actions 37 times. Merged at 6 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:17:55,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:55,609 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:17:55,623 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 48.35% of their original sizes. [2018-12-03 17:17:55,623 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:17:56,019 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:17:56,019 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:17:56,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:17:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 21 [2018-12-03 17:17:56,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:17:56,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:17:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:17:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:17:56,020 INFO L87 Difference]: Start difference. First operand 1112 states and 2512 transitions. Second operand 15 states. [2018-12-03 17:18:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:08,076 INFO L93 Difference]: Finished difference Result 1857 states and 4134 transitions. [2018-12-03 17:18:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:18:08,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:18:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:08,079 INFO L225 Difference]: With dead ends: 1857 [2018-12-03 17:18:08,079 INFO L226 Difference]: Without dead ends: 1849 [2018-12-03 17:18:08,080 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=582, Invalid=2174, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:18:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2018-12-03 17:18:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1220. [2018-12-03 17:18:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-12-03 17:18:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 2759 transitions. [2018-12-03 17:18:10,131 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 2759 transitions. Word has length 16 [2018-12-03 17:18:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:10,131 INFO L480 AbstractCegarLoop]: Abstraction has 1220 states and 2759 transitions. [2018-12-03 17:18:10,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:18:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 2759 transitions. [2018-12-03 17:18:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:18:10,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:10,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:10,132 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:10,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2131084194, now seen corresponding path program 1 times [2018-12-03 17:18:10,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:10,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:10,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:10,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:10,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:10,200 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 17:18:10,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:18:10,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 17:18:10,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:10,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:18:10,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:18:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:18:10,201 INFO L87 Difference]: Start difference. First operand 1220 states and 2759 transitions. Second operand 9 states. [2018-12-03 17:18:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:15,305 INFO L93 Difference]: Finished difference Result 1532 states and 3371 transitions. [2018-12-03 17:18:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:18:15,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:18:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:15,307 INFO L225 Difference]: With dead ends: 1532 [2018-12-03 17:18:15,307 INFO L226 Difference]: Without dead ends: 1524 [2018-12-03 17:18:15,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:18:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-12-03 17:18:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1056. [2018-12-03 17:18:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-12-03 17:18:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2390 transitions. [2018-12-03 17:18:16,927 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2390 transitions. Word has length 16 [2018-12-03 17:18:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:16,927 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 2390 transitions. [2018-12-03 17:18:16,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:18:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2390 transitions. [2018-12-03 17:18:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:18:16,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:16,928 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:16,928 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:16,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-12-03 17:18:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:16,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:16,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:16,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:16,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:17,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:17,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:17,000 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:18:17,000 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [199], [203], [207], [236], [245], [254], [337], [345], [351] [2018-12-03 17:18:17,001 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:17,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:17,016 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:18:17,016 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:18:17,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:17,018 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:18:17,027 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.48% of their original sizes. [2018-12-03 17:18:17,028 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:18:17,129 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:18:17,129 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:18:17,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:18:17,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 18 [2018-12-03 17:18:17,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:17,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:18:17,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:18:17,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:18:17,130 INFO L87 Difference]: Start difference. First operand 1056 states and 2390 transitions. Second operand 13 states. [2018-12-03 17:18:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:26,375 INFO L93 Difference]: Finished difference Result 1687 states and 3698 transitions. [2018-12-03 17:18:26,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:18:26,375 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:18:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:26,377 INFO L225 Difference]: With dead ends: 1687 [2018-12-03 17:18:26,377 INFO L226 Difference]: Without dead ends: 1679 [2018-12-03 17:18:26,378 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:18:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2018-12-03 17:18:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1108. [2018-12-03 17:18:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-12-03 17:18:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 2517 transitions. [2018-12-03 17:18:28,119 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 2517 transitions. Word has length 16 [2018-12-03 17:18:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:28,119 INFO L480 AbstractCegarLoop]: Abstraction has 1108 states and 2517 transitions. [2018-12-03 17:18:28,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:18:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 2517 transitions. [2018-12-03 17:18:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:18:28,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:28,120 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:28,120 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:28,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:28,120 INFO L82 PathProgramCache]: Analyzing trace with hash -960421593, now seen corresponding path program 1 times [2018-12-03 17:18:28,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:28,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:28,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:28,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:28,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:28,202 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:18:28,202 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [98], [199], [203], [207], [236], [245], [337], [345], [351] [2018-12-03 17:18:28,203 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:28,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:28,220 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:18:28,220 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:18:28,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:28,221 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:18:28,231 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.7% of their original sizes. [2018-12-03 17:18:28,231 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:18:28,362 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:18:28,363 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:18:28,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:18:28,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 18 [2018-12-03 17:18:28,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:28,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:18:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:18:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:18:28,364 INFO L87 Difference]: Start difference. First operand 1108 states and 2517 transitions. Second operand 13 states. [2018-12-03 17:18:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:39,071 INFO L93 Difference]: Finished difference Result 1912 states and 4185 transitions. [2018-12-03 17:18:39,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:18:39,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:18:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:39,073 INFO L225 Difference]: With dead ends: 1912 [2018-12-03 17:18:39,073 INFO L226 Difference]: Without dead ends: 1904 [2018-12-03 17:18:39,074 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:18:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-12-03 17:18:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1207. [2018-12-03 17:18:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2018-12-03 17:18:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2748 transitions. [2018-12-03 17:18:40,931 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2748 transitions. Word has length 16 [2018-12-03 17:18:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:40,931 INFO L480 AbstractCegarLoop]: Abstraction has 1207 states and 2748 transitions. [2018-12-03 17:18:40,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:18:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2748 transitions. [2018-12-03 17:18:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:18:40,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:40,932 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:40,932 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:40,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:40,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-12-03 17:18:40,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:40,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:40,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:40,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:40,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:40,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:40,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:40,996 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:18:40,996 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [102], [186], [192], [203], [227], [229], [236], [337], [345], [351] [2018-12-03 17:18:40,997 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:40,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:41,010 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:18:41,010 INFO L272 AbstractInterpreter]: Visited 15 different actions 40 times. Merged at 6 different actions 21 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:18:41,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:41,018 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:18:41,030 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 51.94% of their original sizes. [2018-12-03 17:18:41,031 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:18:41,224 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:18:41,225 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:18:41,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:18:41,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:18:41,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:41,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:18:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:18:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:18:41,226 INFO L87 Difference]: Start difference. First operand 1207 states and 2748 transitions. Second operand 15 states. [2018-12-03 17:18:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:50,561 INFO L93 Difference]: Finished difference Result 2005 states and 4457 transitions. [2018-12-03 17:18:50,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:18:50,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:18:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:50,563 INFO L225 Difference]: With dead ends: 2005 [2018-12-03 17:18:50,563 INFO L226 Difference]: Without dead ends: 1991 [2018-12-03 17:18:50,564 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:18:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2018-12-03 17:18:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1322. [2018-12-03 17:18:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-03 17:18:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 3000 transitions. [2018-12-03 17:18:52,668 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 3000 transitions. Word has length 16 [2018-12-03 17:18:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:52,668 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 3000 transitions. [2018-12-03 17:18:52,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:18:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 3000 transitions. [2018-12-03 17:18:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:18:52,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:52,669 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:52,669 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:52,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash -249130772, now seen corresponding path program 1 times [2018-12-03 17:18:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:52,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:52,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:52,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:52,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:52,743 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:18:52,743 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [78], [98], [199], [203], [207], [236], [245], [292], [337], [345], [351] [2018-12-03 17:18:52,744 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:52,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:52,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:18:52,759 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:18:52,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:52,760 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:18:52,772 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.26% of their original sizes. [2018-12-03 17:18:52,772 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:18:52,904 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:18:52,904 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:18:52,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:18:52,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 18 [2018-12-03 17:18:52,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:18:52,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:18:52,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:18:52,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:18:52,905 INFO L87 Difference]: Start difference. First operand 1322 states and 3000 transitions. Second operand 13 states. [2018-12-03 17:19:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:03,210 INFO L93 Difference]: Finished difference Result 2253 states and 4962 transitions. [2018-12-03 17:19:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:19:03,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:19:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:03,213 INFO L225 Difference]: With dead ends: 2253 [2018-12-03 17:19:03,213 INFO L226 Difference]: Without dead ends: 2245 [2018-12-03 17:19:03,213 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=312, Invalid=878, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:19:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2018-12-03 17:19:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1358. [2018-12-03 17:19:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-12-03 17:19:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 3080 transitions. [2018-12-03 17:19:05,426 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 3080 transitions. Word has length 16 [2018-12-03 17:19:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:05,426 INFO L480 AbstractCegarLoop]: Abstraction has 1358 states and 3080 transitions. [2018-12-03 17:19:05,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:19:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 3080 transitions. [2018-12-03 17:19:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:19:05,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:05,427 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:05,427 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:05,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -336231126, now seen corresponding path program 1 times [2018-12-03 17:19:05,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:05,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:05,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:05,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:05,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:05,892 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:19:05,892 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [78], [102], [186], [192], [203], [227], [229], [236], [292], [337], [345], [351] [2018-12-03 17:19:05,893 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:05,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:05,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:19:05,910 INFO L272 AbstractInterpreter]: Visited 15 different actions 40 times. Merged at 6 different actions 21 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:19:05,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:05,913 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:19:05,924 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 51.57% of their original sizes. [2018-12-03 17:19:05,924 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:19:06,117 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:19:06,117 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:19:06,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:19:06,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:19:06,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:06,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:19:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:19:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:19:06,119 INFO L87 Difference]: Start difference. First operand 1358 states and 3080 transitions. Second operand 15 states. [2018-12-03 17:19:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:19,750 INFO L93 Difference]: Finished difference Result 2181 states and 4833 transitions. [2018-12-03 17:19:19,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:19:19,750 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:19:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:19,753 INFO L225 Difference]: With dead ends: 2181 [2018-12-03 17:19:19,753 INFO L226 Difference]: Without dead ends: 2167 [2018-12-03 17:19:19,754 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:19:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2018-12-03 17:19:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1385. [2018-12-03 17:19:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-12-03 17:19:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 3141 transitions. [2018-12-03 17:19:22,155 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 3141 transitions. Word has length 16 [2018-12-03 17:19:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:22,155 INFO L480 AbstractCegarLoop]: Abstraction has 1385 states and 3141 transitions. [2018-12-03 17:19:22,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:19:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 3141 transitions. [2018-12-03 17:19:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:19:22,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:22,157 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:22,157 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:22,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-12-03 17:19:22,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:22,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:22,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:22,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:22,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:22,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:22,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:22,252 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:19:22,252 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [203], [213], [227], [236], [277], [279], [286], [337], [345], [351] [2018-12-03 17:19:22,253 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:22,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:22,267 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:19:22,268 INFO L272 AbstractInterpreter]: Visited 15 different actions 48 times. Merged at 8 different actions 29 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:19:22,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:22,269 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:19:22,279 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 49.28% of their original sizes. [2018-12-03 17:19:22,280 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:19:22,457 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:19:22,457 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:19:22,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:19:22,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:19:22,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:22,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:19:22,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:19:22,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:19:22,458 INFO L87 Difference]: Start difference. First operand 1385 states and 3141 transitions. Second operand 15 states. [2018-12-03 17:19:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:33,575 INFO L93 Difference]: Finished difference Result 2209 states and 4924 transitions. [2018-12-03 17:19:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:19:33,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:19:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:33,578 INFO L225 Difference]: With dead ends: 2209 [2018-12-03 17:19:33,578 INFO L226 Difference]: Without dead ends: 2195 [2018-12-03 17:19:33,580 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:19:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2018-12-03 17:19:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1370. [2018-12-03 17:19:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2018-12-03 17:19:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 3106 transitions. [2018-12-03 17:19:35,949 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 3106 transitions. Word has length 16 [2018-12-03 17:19:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:35,950 INFO L480 AbstractCegarLoop]: Abstraction has 1370 states and 3106 transitions. [2018-12-03 17:19:35,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:19:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 3106 transitions. [2018-12-03 17:19:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:19:35,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:35,951 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:35,951 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:35,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash -755254941, now seen corresponding path program 1 times [2018-12-03 17:19:35,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:35,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:35,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:35,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:35,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:36,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:36,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:36,022 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:19:36,022 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [98], [199], [203], [207], [236], [245], [292], [327], [339], [345], [351] [2018-12-03 17:19:36,023 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:36,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:36,042 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:19:36,042 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:19:36,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:36,049 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:19:36,061 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.78% of their original sizes. [2018-12-03 17:19:36,061 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:19:36,207 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:19:36,207 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:19:36,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:19:36,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 18 [2018-12-03 17:19:36,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:36,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:19:36,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:19:36,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:19:36,208 INFO L87 Difference]: Start difference. First operand 1370 states and 3106 transitions. Second operand 13 states. [2018-12-03 17:19:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:48,352 INFO L93 Difference]: Finished difference Result 2107 states and 4640 transitions. [2018-12-03 17:19:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:19:48,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 17:19:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:48,355 INFO L225 Difference]: With dead ends: 2107 [2018-12-03 17:19:48,355 INFO L226 Difference]: Without dead ends: 2099 [2018-12-03 17:19:48,355 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:19:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2018-12-03 17:19:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1322. [2018-12-03 17:19:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-03 17:19:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2996 transitions. [2018-12-03 17:19:50,679 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2996 transitions. Word has length 16 [2018-12-03 17:19:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:50,679 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 2996 transitions. [2018-12-03 17:19:50,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:19:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2996 transitions. [2018-12-03 17:19:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:19:50,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:50,680 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:50,680 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:50,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash -842355295, now seen corresponding path program 1 times [2018-12-03 17:19:50,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:50,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:50,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:50,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:50,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:50,748 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:19:50,748 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [102], [186], [192], [203], [227], [229], [236], [292], [327], [339], [345], [351] [2018-12-03 17:19:50,748 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:50,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:50,763 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:19:50,763 INFO L272 AbstractInterpreter]: Visited 15 different actions 40 times. Merged at 6 different actions 21 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:19:50,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:50,767 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:19:50,778 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 50.98% of their original sizes. [2018-12-03 17:19:50,778 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:19:50,963 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:19:50,963 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:19:50,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:19:50,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:19:50,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:19:50,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:19:50,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:19:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:19:50,964 INFO L87 Difference]: Start difference. First operand 1322 states and 2996 transitions. Second operand 15 states. [2018-12-03 17:20:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:01,062 INFO L93 Difference]: Finished difference Result 2101 states and 4654 transitions. [2018-12-03 17:20:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:20:01,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:20:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:01,065 INFO L225 Difference]: With dead ends: 2101 [2018-12-03 17:20:01,065 INFO L226 Difference]: Without dead ends: 2087 [2018-12-03 17:20:01,066 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:20:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-03 17:20:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1349. [2018-12-03 17:20:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2018-12-03 17:20:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 3057 transitions. [2018-12-03 17:20:03,743 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 3057 transitions. Word has length 16 [2018-12-03 17:20:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:03,743 INFO L480 AbstractCegarLoop]: Abstraction has 1349 states and 3057 transitions. [2018-12-03 17:20:03,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:20:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 3057 transitions. [2018-12-03 17:20:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:20:03,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:03,744 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:03,745 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:03,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash 627222603, now seen corresponding path program 1 times [2018-12-03 17:20:03,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:03,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:03,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:03,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:03,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:20:03,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:03,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:03,814 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:20:03,815 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [203], [213], [227], [236], [277], [279], [286], [327], [339], [345], [351] [2018-12-03 17:20:03,815 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:20:03,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:20:03,828 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:20:03,828 INFO L272 AbstractInterpreter]: Visited 15 different actions 48 times. Merged at 8 different actions 29 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:20:03,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:03,833 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:20:03,844 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 48.68% of their original sizes. [2018-12-03 17:20:03,844 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:20:04,230 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:20:04,230 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:20:04,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:20:04,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:20:04,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:04,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:20:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:20:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:20:04,231 INFO L87 Difference]: Start difference. First operand 1349 states and 3057 transitions. Second operand 15 states. [2018-12-03 17:20:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:16,542 INFO L93 Difference]: Finished difference Result 2365 states and 5260 transitions. [2018-12-03 17:20:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:20:16,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:20:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:16,545 INFO L225 Difference]: With dead ends: 2365 [2018-12-03 17:20:16,545 INFO L226 Difference]: Without dead ends: 2351 [2018-12-03 17:20:16,545 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:20:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2018-12-03 17:20:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 1341. [2018-12-03 17:20:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-12-03 17:20:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 3039 transitions. [2018-12-03 17:20:18,986 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 3039 transitions. Word has length 16 [2018-12-03 17:20:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:18,986 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 3039 transitions. [2018-12-03 17:20:18,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:20:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 3039 transitions. [2018-12-03 17:20:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:20:18,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:18,987 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:18,987 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:18,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-12-03 17:20:18,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:18,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:20:19,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:19,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:19,046 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:20:19,046 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [203], [213], [227], [236], [277], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 17:20:19,047 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:20:19,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:20:19,061 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:20:19,062 INFO L272 AbstractInterpreter]: Visited 15 different actions 52 times. Merged at 9 different actions 33 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:20:19,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:19,066 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:20:19,076 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 45.51% of their original sizes. [2018-12-03 17:20:19,076 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:20:19,228 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:20:19,228 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:20:19,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:20:19,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:20:19,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:19,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:20:19,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:20:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:20:19,229 INFO L87 Difference]: Start difference. First operand 1341 states and 3039 transitions. Second operand 15 states. [2018-12-03 17:20:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:29,271 INFO L93 Difference]: Finished difference Result 2504 states and 5628 transitions. [2018-12-03 17:20:29,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:20:29,272 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:20:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:29,275 INFO L225 Difference]: With dead ends: 2504 [2018-12-03 17:20:29,275 INFO L226 Difference]: Without dead ends: 2496 [2018-12-03 17:20:29,275 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:20:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2018-12-03 17:20:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1890. [2018-12-03 17:20:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2018-12-03 17:20:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 4306 transitions. [2018-12-03 17:20:32,874 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 4306 transitions. Word has length 16 [2018-12-03 17:20:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:32,874 INFO L480 AbstractCegarLoop]: Abstraction has 1890 states and 4306 transitions. [2018-12-03 17:20:32,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:20:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 4306 transitions. [2018-12-03 17:20:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:20:32,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:32,875 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:32,875 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:32,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-12-03 17:20:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:32,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:20:32,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:32,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:32,931 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:20:32,931 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [183], [203], [213], [229], [277], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 17:20:32,932 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:20:32,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:20:32,946 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:20:32,946 INFO L272 AbstractInterpreter]: Visited 15 different actions 51 times. Merged at 9 different actions 32 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:20:32,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:32,950 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:20:32,960 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 45.51% of their original sizes. [2018-12-03 17:20:32,960 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:20:33,107 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:20:33,108 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:20:33,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:20:33,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:20:33,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:33,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:20:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:20:33,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:20:33,109 INFO L87 Difference]: Start difference. First operand 1890 states and 4306 transitions. Second operand 15 states. [2018-12-03 17:20:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:47,501 INFO L93 Difference]: Finished difference Result 3043 states and 6817 transitions. [2018-12-03 17:20:47,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:20:47,501 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:20:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:47,505 INFO L225 Difference]: With dead ends: 3043 [2018-12-03 17:20:47,505 INFO L226 Difference]: Without dead ends: 3035 [2018-12-03 17:20:47,506 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:20:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2018-12-03 17:20:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2062. [2018-12-03 17:20:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-12-03 17:20:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 4695 transitions. [2018-12-03 17:20:51,230 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 4695 transitions. Word has length 16 [2018-12-03 17:20:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:51,230 INFO L480 AbstractCegarLoop]: Abstraction has 2062 states and 4695 transitions. [2018-12-03 17:20:51,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:20:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 4695 transitions. [2018-12-03 17:20:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:20:51,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:51,231 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:51,231 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:51,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-12-03 17:20:51,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:51,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:51,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:20:51,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:51,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:51,302 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:20:51,303 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [174], [183], [203], [279], [283], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 17:20:51,304 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:20:51,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:20:51,318 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:20:51,318 INFO L272 AbstractInterpreter]: Visited 15 different actions 49 times. Merged at 9 different actions 30 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:20:51,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:51,319 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:20:51,330 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 44.62% of their original sizes. [2018-12-03 17:20:51,330 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:20:51,496 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 17:20:51,496 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:20:51,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:20:51,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:20:51,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:20:51,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:20:51,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:20:51,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:20:51,497 INFO L87 Difference]: Start difference. First operand 2062 states and 4695 transitions. Second operand 15 states. [2018-12-03 17:21:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:07,054 INFO L93 Difference]: Finished difference Result 3379 states and 7540 transitions. [2018-12-03 17:21:07,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:21:07,054 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 17:21:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:07,058 INFO L225 Difference]: With dead ends: 3379 [2018-12-03 17:21:07,058 INFO L226 Difference]: Without dead ends: 3371 [2018-12-03 17:21:07,059 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:21:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2018-12-03 17:21:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2093. [2018-12-03 17:21:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2018-12-03 17:21:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 4761 transitions. [2018-12-03 17:21:10,936 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 4761 transitions. Word has length 16 [2018-12-03 17:21:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:10,937 INFO L480 AbstractCegarLoop]: Abstraction has 2093 states and 4761 transitions. [2018-12-03 17:21:10,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:21:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 4761 transitions. [2018-12-03 17:21:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:21:10,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:10,938 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:10,938 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:10,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:10,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1645893604, now seen corresponding path program 1 times [2018-12-03 17:21:10,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:10,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:10,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:10,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:10,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:21:11,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:11,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:11,140 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:21:11,140 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [98], [102], [186], [192], [229], [240], [337], [345], [351] [2018-12-03 17:21:11,140 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:11,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:11,154 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:21:11,154 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 5 different actions 18 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:21:11,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:11,156 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:21:11,171 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 51.72% of their original sizes. [2018-12-03 17:21:11,171 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:21:12,103 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:21:12,103 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:21:12,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:21:12,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:21:12,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:21:12,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:21:12,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:21:12,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:21:12,105 INFO L87 Difference]: Start difference. First operand 2093 states and 4761 transitions. Second operand 15 states. [2018-12-03 17:21:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:22,783 INFO L93 Difference]: Finished difference Result 2571 states and 5807 transitions. [2018-12-03 17:21:22,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:21:22,783 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:21:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:22,786 INFO L225 Difference]: With dead ends: 2571 [2018-12-03 17:21:22,786 INFO L226 Difference]: Without dead ends: 2563 [2018-12-03 17:21:22,786 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:21:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2018-12-03 17:21:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2117. [2018-12-03 17:21:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-03 17:21:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 4813 transitions. [2018-12-03 17:21:26,993 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 4813 transitions. Word has length 18 [2018-12-03 17:21:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:26,993 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 4813 transitions. [2018-12-03 17:21:26,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:21:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 4813 transitions. [2018-12-03 17:21:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:21:26,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:26,994 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:26,995 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:26,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash -995214687, now seen corresponding path program 1 times [2018-12-03 17:21:26,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:26,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:26,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:26,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:21:27,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:27,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:27,229 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:21:27,229 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [78], [98], [102], [186], [192], [229], [240], [292], [337], [345], [351] [2018-12-03 17:21:27,230 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:27,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:27,241 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:21:27,241 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 5 different actions 18 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:21:27,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:27,242 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:21:27,253 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 51.39% of their original sizes. [2018-12-03 17:21:27,253 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:21:27,459 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:21:27,459 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:21:27,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:21:27,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:21:27,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:21:27,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:21:27,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:21:27,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:21:27,460 INFO L87 Difference]: Start difference. First operand 2117 states and 4813 transitions. Second operand 15 states. [2018-12-03 17:21:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:39,515 INFO L93 Difference]: Finished difference Result 2643 states and 5961 transitions. [2018-12-03 17:21:39,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:21:39,516 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:21:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:39,519 INFO L225 Difference]: With dead ends: 2643 [2018-12-03 17:21:39,519 INFO L226 Difference]: Without dead ends: 2635 [2018-12-03 17:21:39,520 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:21:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2018-12-03 17:21:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2141. [2018-12-03 17:21:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2018-12-03 17:21:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 4865 transitions. [2018-12-03 17:21:43,647 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 4865 transitions. Word has length 18 [2018-12-03 17:21:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:43,647 INFO L480 AbstractCegarLoop]: Abstraction has 2141 states and 4865 transitions. [2018-12-03 17:21:43,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:21:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 4865 transitions. [2018-12-03 17:21:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:21:43,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:43,648 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:43,648 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:43,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:43,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1775095093, now seen corresponding path program 1 times [2018-12-03 17:21:43,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:43,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:43,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:43,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:43,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:21:43,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:43,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:43,707 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:21:43,707 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [98], [186], [192], [213], [229], [240], [277], [279], [286], [337], [345], [351] [2018-12-03 17:21:43,708 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:43,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:43,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:21:43,728 INFO L272 AbstractInterpreter]: Visited 17 different actions 55 times. Merged at 10 different actions 34 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:21:43,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:43,765 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:21:43,779 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 47.99% of their original sizes. [2018-12-03 17:21:43,779 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:21:44,033 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:21:44,034 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:21:44,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:21:44,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:21:44,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:21:44,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:21:44,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:21:44,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:21:44,035 INFO L87 Difference]: Start difference. First operand 2141 states and 4865 transitions. Second operand 15 states. [2018-12-03 17:21:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:56,674 INFO L93 Difference]: Finished difference Result 2611 states and 5895 transitions. [2018-12-03 17:21:56,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:21:56,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:21:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:56,677 INFO L225 Difference]: With dead ends: 2611 [2018-12-03 17:21:56,677 INFO L226 Difference]: Without dead ends: 2603 [2018-12-03 17:21:56,677 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:21:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2018-12-03 17:22:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2133. [2018-12-03 17:22:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-12-03 17:22:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 4849 transitions. [2018-12-03 17:22:00,626 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 4849 transitions. Word has length 18 [2018-12-03 17:22:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:00,626 INFO L480 AbstractCegarLoop]: Abstraction has 2133 states and 4849 transitions. [2018-12-03 17:22:00,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:22:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 4849 transitions. [2018-12-03 17:22:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:22:00,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:00,627 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:00,627 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:00,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:00,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1921647033, now seen corresponding path program 1 times [2018-12-03 17:22:00,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:00,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:00,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:00,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:22:00,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:00,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:00,687 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:22:00,688 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [55], [59], [78], [98], [240], [279], [286], [292], [337], [345], [351] [2018-12-03 17:22:00,688 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:22:00,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:22:00,701 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:22:00,701 INFO L272 AbstractInterpreter]: Visited 14 different actions 44 times. Merged at 7 different actions 26 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:22:00,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:00,706 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:22:00,718 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 46.62% of their original sizes. [2018-12-03 17:22:00,719 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:22:01,768 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:22:01,768 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:22:01,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:22:01,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:22:01,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:22:01,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:22:01,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:22:01,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:22:01,770 INFO L87 Difference]: Start difference. First operand 2133 states and 4849 transitions. Second operand 15 states. [2018-12-03 17:22:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:15,976 INFO L93 Difference]: Finished difference Result 2974 states and 6716 transitions. [2018-12-03 17:22:15,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:22:15,976 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:22:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:15,980 INFO L225 Difference]: With dead ends: 2974 [2018-12-03 17:22:15,980 INFO L226 Difference]: Without dead ends: 2969 [2018-12-03 17:22:15,980 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:22:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2018-12-03 17:22:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2129. [2018-12-03 17:22:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2018-12-03 17:22:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 4839 transitions. [2018-12-03 17:22:20,001 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 4839 transitions. Word has length 18 [2018-12-03 17:22:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:20,001 INFO L480 AbstractCegarLoop]: Abstraction has 2129 states and 4839 transitions. [2018-12-03 17:22:20,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:22:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 4839 transitions. [2018-12-03 17:22:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:22:20,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:20,003 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:20,003 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:20,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2049236648, now seen corresponding path program 1 times [2018-12-03 17:22:20,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:20,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:20,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:20,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:20,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:22:20,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:20,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:20,064 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:22:20,064 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [98], [102], [186], [192], [229], [240], [292], [327], [339], [345], [351] [2018-12-03 17:22:20,065 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:22:20,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:22:20,077 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:22:20,077 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 5 different actions 18 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:22:20,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:20,080 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:22:20,092 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 50.86% of their original sizes. [2018-12-03 17:22:20,092 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:22:20,277 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:22:20,277 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:22:20,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:22:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:22:20,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:22:20,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:22:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:22:20,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:22:20,279 INFO L87 Difference]: Start difference. First operand 2129 states and 4839 transitions. Second operand 15 states. [2018-12-03 17:22:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:33,515 INFO L93 Difference]: Finished difference Result 2616 states and 5903 transitions. [2018-12-03 17:22:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:22:33,515 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:22:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:33,518 INFO L225 Difference]: With dead ends: 2616 [2018-12-03 17:22:33,518 INFO L226 Difference]: Without dead ends: 2608 [2018-12-03 17:22:33,518 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:22:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2018-12-03 17:22:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2111. [2018-12-03 17:22:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2018-12-03 17:22:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 4799 transitions. [2018-12-03 17:22:37,472 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 4799 transitions. Word has length 18 [2018-12-03 17:22:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:37,472 INFO L480 AbstractCegarLoop]: Abstraction has 2111 states and 4799 transitions. [2018-12-03 17:22:37,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:22:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 4799 transitions. [2018-12-03 17:22:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:22:37,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:37,473 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:37,473 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:37,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1465850242, now seen corresponding path program 1 times [2018-12-03 17:22:37,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:37,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:37,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:37,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:37,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:22:37,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:37,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:37,536 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:22:37,536 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [98], [186], [192], [213], [229], [240], [277], [279], [286], [327], [339], [345], [351] [2018-12-03 17:22:37,536 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:22:37,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:22:37,553 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:22:37,553 INFO L272 AbstractInterpreter]: Visited 17 different actions 55 times. Merged at 10 different actions 34 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:22:37,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:37,558 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:22:37,571 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 47.46% of their original sizes. [2018-12-03 17:22:37,572 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:22:37,782 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:22:37,782 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:22:37,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:22:37,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:22:37,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:22:37,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:22:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:22:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:22:37,784 INFO L87 Difference]: Start difference. First operand 2111 states and 4799 transitions. Second operand 15 states. [2018-12-03 17:22:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:50,944 INFO L93 Difference]: Finished difference Result 2628 states and 5927 transitions. [2018-12-03 17:22:50,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:22:50,944 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:22:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:50,948 INFO L225 Difference]: With dead ends: 2628 [2018-12-03 17:22:50,948 INFO L226 Difference]: Without dead ends: 2620 [2018-12-03 17:22:50,948 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:22:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2018-12-03 17:22:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2101. [2018-12-03 17:22:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 17:22:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4779 transitions. [2018-12-03 17:22:55,256 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4779 transitions. Word has length 18 [2018-12-03 17:22:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:55,256 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 4779 transitions. [2018-12-03 17:22:55,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:22:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4779 transitions. [2018-12-03 17:22:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:22:55,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:55,257 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:55,257 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:55,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash 867625072, now seen corresponding path program 1 times [2018-12-03 17:22:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:55,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:55,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:22:55,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:55,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:55,323 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:22:55,323 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [55], [59], [98], [240], [279], [286], [292], [327], [339], [345], [351] [2018-12-03 17:22:55,324 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:22:55,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:22:55,339 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:22:55,340 INFO L272 AbstractInterpreter]: Visited 14 different actions 44 times. Merged at 7 different actions 26 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:22:55,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:55,341 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:22:55,353 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 46.09% of their original sizes. [2018-12-03 17:22:55,354 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:22:55,545 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:22:55,545 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:22:55,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:22:55,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:22:55,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:22:55,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:22:55,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:22:55,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:22:55,546 INFO L87 Difference]: Start difference. First operand 2101 states and 4779 transitions. Second operand 15 states. [2018-12-03 17:23:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:10,826 INFO L93 Difference]: Finished difference Result 3005 states and 6784 transitions. [2018-12-03 17:23:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:23:10,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:23:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:10,830 INFO L225 Difference]: With dead ends: 3005 [2018-12-03 17:23:10,830 INFO L226 Difference]: Without dead ends: 3000 [2018-12-03 17:23:10,831 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:23:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2018-12-03 17:23:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2087. [2018-12-03 17:23:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2018-12-03 17:23:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 4749 transitions. [2018-12-03 17:23:14,833 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 4749 transitions. Word has length 18 [2018-12-03 17:23:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:14,833 INFO L480 AbstractCegarLoop]: Abstraction has 2087 states and 4749 transitions. [2018-12-03 17:23:14,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:23:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 4749 transitions. [2018-12-03 17:23:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:23:14,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:14,834 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:23:14,834 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:14,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1762493698, now seen corresponding path program 1 times [2018-12-03 17:23:14,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:14,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:14,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:23:14,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:14,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:14,967 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:23:14,967 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [55], [98], [240], [292], [317], [323], [327], [331], [339], [345], [351] [2018-12-03 17:23:14,967 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:23:14,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:23:14,981 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:23:14,981 INFO L272 AbstractInterpreter]: Visited 14 different actions 48 times. Merged at 8 different actions 30 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:23:14,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:14,983 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:23:14,994 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 40.49% of their original sizes. [2018-12-03 17:23:14,995 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:23:15,157 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 17:23:15,157 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:23:15,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:23:15,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 17:23:15,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:23:15,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:23:15,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:23:15,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:23:15,159 INFO L87 Difference]: Start difference. First operand 2087 states and 4749 transitions. Second operand 15 states. [2018-12-03 17:23:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:30,217 INFO L93 Difference]: Finished difference Result 3761 states and 8476 transitions. [2018-12-03 17:23:30,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:23:30,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:23:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:30,222 INFO L225 Difference]: With dead ends: 3761 [2018-12-03 17:23:30,222 INFO L226 Difference]: Without dead ends: 3753 [2018-12-03 17:23:30,223 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:23:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2018-12-03 17:23:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 1897. [2018-12-03 17:23:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2018-12-03 17:23:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 4324 transitions. [2018-12-03 17:23:34,721 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 4324 transitions. Word has length 18 [2018-12-03 17:23:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:34,721 INFO L480 AbstractCegarLoop]: Abstraction has 1897 states and 4324 transitions. [2018-12-03 17:23:34,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:23:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 4324 transitions. [2018-12-03 17:23:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:23:34,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:34,722 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:23:34,722 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:34,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash 520693007, now seen corresponding path program 1 times [2018-12-03 17:23:34,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:34,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:34,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:34,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:34,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:34,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:34,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:34,823 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:23:34,824 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [102], [104], [110], [115], [183], [186], [192], [203], [229], [260], [274], [349] [2018-12-03 17:23:34,824 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:23:34,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:23:34,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:23:34,868 INFO L272 AbstractInterpreter]: Visited 16 different actions 93 times. Merged at 10 different actions 63 times. Widened at 7 different actions 26 times. Found 14 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:23:34,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:34,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:23:34,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:34,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:23:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:34,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:23:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:34,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:23:35,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:23:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2018-12-03 17:23:36,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:36,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:23:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:23:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:23:36,218 INFO L87 Difference]: Start difference. First operand 1897 states and 4324 transitions. Second operand 14 states. [2018-12-03 17:23:37,763 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 17:23:44,256 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 17:23:46,024 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 17:23:49,863 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:23:53,088 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-03 17:23:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:56,721 INFO L93 Difference]: Finished difference Result 4818 states and 10773 transitions. [2018-12-03 17:23:56,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:23:56,721 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 17:23:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:56,727 INFO L225 Difference]: With dead ends: 4818 [2018-12-03 17:23:56,727 INFO L226 Difference]: Without dead ends: 4810 [2018-12-03 17:23:56,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=730, Invalid=2240, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:23:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2018-12-03 17:24:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 2909. [2018-12-03 17:24:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2018-12-03 17:24:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 6732 transitions. [2018-12-03 17:24:03,574 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 6732 transitions. Word has length 20 [2018-12-03 17:24:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:03,574 INFO L480 AbstractCegarLoop]: Abstraction has 2909 states and 6732 transitions. [2018-12-03 17:24:03,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:24:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 6732 transitions. [2018-12-03 17:24:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:24:03,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:03,576 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:24:03,577 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:03,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash 759878049, now seen corresponding path program 1 times [2018-12-03 17:24:03,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:03,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:03,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:03,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:03,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:24:03,704 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:24:03,704 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [122], [199], [203], [207], [224], [236], [245], [247], [254], [264], [274], [349] [2018-12-03 17:24:03,705 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:24:03,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:24:03,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:24:03,760 INFO L272 AbstractInterpreter]: Visited 17 different actions 90 times. Merged at 9 different actions 59 times. Widened at 7 different actions 27 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:24:03,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:03,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:24:03,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:03,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:24:03,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:03,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:24:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:03,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:24:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:24:03,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:24:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:24:04,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:24:04,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 17:24:04,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:24:04,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:24:04,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:24:04,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:24:04,145 INFO L87 Difference]: Start difference. First operand 2909 states and 6732 transitions. Second operand 15 states. [2018-12-03 17:24:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:30,333 INFO L93 Difference]: Finished difference Result 6811 states and 15250 transitions. [2018-12-03 17:24:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:24:30,334 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-12-03 17:24:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:30,340 INFO L225 Difference]: With dead ends: 6811 [2018-12-03 17:24:30,341 INFO L226 Difference]: Without dead ends: 6803 [2018-12-03 17:24:30,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1488, Invalid=5994, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 17:24:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6803 states. [2018-12-03 17:24:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6803 to 3270. [2018-12-03 17:24:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-12-03 17:24:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 7527 transitions. [2018-12-03 17:24:38,736 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 7527 transitions. Word has length 20 [2018-12-03 17:24:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:38,736 INFO L480 AbstractCegarLoop]: Abstraction has 3270 states and 7527 transitions. [2018-12-03 17:24:38,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:24:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 7527 transitions. [2018-12-03 17:24:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:24:38,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:38,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:24:38,738 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:38,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:38,738 INFO L82 PathProgramCache]: Analyzing trace with hash 751079347, now seen corresponding path program 1 times [2018-12-03 17:24:38,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:38,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:38,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:38,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:38,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:24:38,893 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:24:38,893 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [94], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [254], [264], [274], [349] [2018-12-03 17:24:38,894 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:24:38,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:24:38,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:24:38,961 INFO L272 AbstractInterpreter]: Visited 20 different actions 115 times. Merged at 12 different actions 79 times. Widened at 10 different actions 34 times. Found 17 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:24:38,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:38,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:24:38,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:38,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:24:39,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:39,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:24:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:39,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:24:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:24:39,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:24:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:24:39,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:24:39,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 17:24:39,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:24:39,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:24:39,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:24:39,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:24:39,285 INFO L87 Difference]: Start difference. First operand 3270 states and 7527 transitions. Second operand 14 states. [2018-12-03 17:25:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:02,691 INFO L93 Difference]: Finished difference Result 6144 states and 13831 transitions. [2018-12-03 17:25:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:25:02,691 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 17:25:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:02,700 INFO L225 Difference]: With dead ends: 6144 [2018-12-03 17:25:02,700 INFO L226 Difference]: Without dead ends: 6136 [2018-12-03 17:25:02,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=917, Invalid=4195, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:25:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-12-03 17:25:12,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 3597. [2018-12-03 17:25:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-03 17:25:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 8266 transitions. [2018-12-03 17:25:12,163 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 8266 transitions. Word has length 20 [2018-12-03 17:25:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:12,163 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 8266 transitions. [2018-12-03 17:25:12,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:25:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 8266 transitions. [2018-12-03 17:25:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:25:12,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:12,165 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:25:12,165 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:12,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash 748278993, now seen corresponding path program 1 times [2018-12-03 17:25:12,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:12,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:12,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:12,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:12,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:12,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:12,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:12,257 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:25:12,258 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [94], [98], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [264], [274], [349] [2018-12-03 17:25:12,258 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:25:12,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:25:12,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:25:12,314 INFO L272 AbstractInterpreter]: Visited 19 different actions 119 times. Merged at 12 different actions 84 times. Widened at 9 different actions 37 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:25:12,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:12,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:25:12,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:12,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:25:12,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:12,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:25:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:12,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:25:12,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:25:12,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:12,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 17:25:12,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:12,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:25:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:25:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:25:12,614 INFO L87 Difference]: Start difference. First operand 3597 states and 8266 transitions. Second operand 14 states. [2018-12-03 17:25:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:35,769 INFO L93 Difference]: Finished difference Result 6177 states and 13913 transitions. [2018-12-03 17:25:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:25:35,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 17:25:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:35,776 INFO L225 Difference]: With dead ends: 6177 [2018-12-03 17:25:35,776 INFO L226 Difference]: Without dead ends: 6169 [2018-12-03 17:25:35,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=819, Invalid=3603, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:25:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2018-12-03 17:25:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 3534. [2018-12-03 17:25:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3534 states. [2018-12-03 17:25:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 8177 transitions. [2018-12-03 17:25:44,920 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 8177 transitions. Word has length 20 [2018-12-03 17:25:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:44,920 INFO L480 AbstractCegarLoop]: Abstraction has 3534 states and 8177 transitions. [2018-12-03 17:25:44,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:25:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 8177 transitions. [2018-12-03 17:25:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:25:44,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:44,922 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:25:44,922 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:44,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash 19446543, now seen corresponding path program 1 times [2018-12-03 17:25:44,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:44,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:44,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:45,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:45,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:45,011 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:25:45,012 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [98], [122], [199], [203], [207], [224], [236], [245], [247], [254], [349] [2018-12-03 17:25:45,013 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:25:45,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:25:45,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:25:45,051 INFO L272 AbstractInterpreter]: Visited 18 different actions 92 times. Merged at 9 different actions 61 times. Widened at 7 different actions 27 times. Found 13 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:25:45,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:45,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:25:45,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:45,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:25:45,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:45,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:25:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:45,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:25:45,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:25:45,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:45,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 17:25:45,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:45,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:25:45,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:25:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:25:45,371 INFO L87 Difference]: Start difference. First operand 3534 states and 8177 transitions. Second operand 15 states. [2018-12-03 17:26:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:19,416 INFO L93 Difference]: Finished difference Result 7912 states and 17877 transitions. [2018-12-03 17:26:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:26:19,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-12-03 17:26:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:19,429 INFO L225 Difference]: With dead ends: 7912 [2018-12-03 17:26:19,429 INFO L226 Difference]: Without dead ends: 7904 [2018-12-03 17:26:19,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1837, Invalid=6905, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:26:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states. [2018-12-03 17:26:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 3506. [2018-12-03 17:26:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2018-12-03 17:26:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 8161 transitions. [2018-12-03 17:26:29,206 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 8161 transitions. Word has length 20 [2018-12-03 17:26:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:29,206 INFO L480 AbstractCegarLoop]: Abstraction has 3506 states and 8161 transitions. [2018-12-03 17:26:29,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:26:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 8161 transitions. [2018-12-03 17:26:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:26:29,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:29,208 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:29,208 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:29,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:29,208 INFO L82 PathProgramCache]: Analyzing trace with hash -743176670, now seen corresponding path program 1 times [2018-12-03 17:26:29,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:29,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:29,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:29,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:29,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:29,318 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:26:29,318 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [102], [104], [110], [115], [183], [186], [192], [203], [229], [349] [2018-12-03 17:26:29,319 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:26:29,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:26:29,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:26:29,361 INFO L272 AbstractInterpreter]: Visited 17 different actions 96 times. Merged at 10 different actions 65 times. Widened at 7 different actions 26 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:26:29,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:29,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:26:29,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:29,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:26:29,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:29,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:29,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:26:29,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:26:29,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:29,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 17:26:29,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:29,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:26:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:26:29,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:26:29,722 INFO L87 Difference]: Start difference. First operand 3506 states and 8161 transitions. Second operand 14 states.