java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:07:40,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:07:40,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:07:40,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:07:40,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:07:40,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:07:40,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:07:40,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:07:40,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:07:40,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:07:40,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:07:40,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:07:40,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:07:40,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:07:40,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:07:40,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:07:40,543 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:07:40,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:07:40,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:07:40,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:07:40,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:07:40,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:07:40,562 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:07:40,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:07:40,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:07:40,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:07:40,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:07:40,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:07:40,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:07:40,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:07:40,571 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:07:40,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:07:40,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:07:40,574 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:07:40,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:07:40,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:07:40,576 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:07:40,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:07:40,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:07:40,600 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:07:40,600 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:07:40,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:07:40,601 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:07:40,601 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:07:40,601 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:07:40,601 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:07:40,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:07:40,605 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:07:40,605 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:07:40,605 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:07:40,606 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:07:40,606 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:07:40,607 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:07:40,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:07:40,607 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:07:40,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:07:40,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:07:40,608 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:07:40,609 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:07:40,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:07:40,610 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:07:40,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:07:40,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:07:40,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:07:40,610 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:07:40,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:07:40,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:07:40,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:07:40,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:07:40,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:40,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:07:40,612 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:07:40,612 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:07:40,612 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:07:40,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:07:40,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:07:40,613 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:07:40,613 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:07:40,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:07:40,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:07:40,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:07:40,665 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:07:40,666 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:07:40,667 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 15:07:40,667 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-12-03 15:07:40,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:07:40,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:07:40,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:40,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:07:40,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:07:40,757 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,773 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,791 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:07:40,791 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:07:40,791 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:07:40,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:40,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:07:40,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:07:40,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:07:40,811 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,811 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,821 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,821 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,837 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,848 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,853 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 03:07:40" (1/1) ... [2018-12-03 15:07:40,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:07:40,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:07:40,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:07:40,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:07:40,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:40,933 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 15:07:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 15:07:40,934 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 15:07:41,821 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:07:41,821 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:07:41,822 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:41 BoogieIcfgContainer [2018-12-03 15:07:41,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:07:41,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:07:41,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:07:41,826 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:07:41,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:40" (1/2) ... [2018-12-03 15:07:41,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14134230 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:07:41, skipping insertion in model container [2018-12-03 15:07:41,828 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 03:07:41" (2/2) ... [2018-12-03 15:07:41,830 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-12-03 15:07:41,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:07:41,849 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-12-03 15:07:41,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-12-03 15:07:41,906 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:07:41,907 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:07:41,907 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:07:41,907 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:07:41,907 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:07:41,907 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:07:41,908 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:07:41,908 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:07:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-03 15:07:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:07:41,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:41,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:41,947 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:41,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:41,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-12-03 15:07:41,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:42,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:42,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:42,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:42,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:42,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:42,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:42,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:42,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:07:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:07:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:07:42,327 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-12-03 15:07:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:44,138 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-12-03 15:07:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:07:44,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 15:07:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:44,157 INFO L225 Difference]: With dead ends: 163 [2018-12-03 15:07:44,157 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 15:07:44,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:07:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 15:07:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-12-03 15:07:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:07:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-12-03 15:07:44,220 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-12-03 15:07:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:44,221 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-12-03 15:07:44,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:07:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-12-03 15:07:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:07:44,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:44,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:44,224 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:44,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:44,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-12-03 15:07:44,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:44,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:44,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:44,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:44,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:44,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:07:44,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:07:44,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:07:44,358 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-12-03 15:07:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:45,370 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-12-03 15:07:45,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:07:45,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 15:07:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:45,374 INFO L225 Difference]: With dead ends: 188 [2018-12-03 15:07:45,374 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 15:07:45,376 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 15:07:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 15:07:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-12-03 15:07:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:07:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-12-03 15:07:45,400 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-12-03 15:07:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:45,401 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-12-03 15:07:45,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:07:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-12-03 15:07:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:07:45,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:45,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:45,404 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:45,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-12-03 15:07:45,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:45,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:45,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:45,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:45,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:45,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:45,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 15:07:45,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:45,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:45,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:45,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:45,537 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-12-03 15:07:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:47,297 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-12-03 15:07:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:07:47,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 15:07:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:47,305 INFO L225 Difference]: With dead ends: 361 [2018-12-03 15:07:47,305 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 15:07:47,307 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 15:07:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 15:07:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-12-03 15:07:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 15:07:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-12-03 15:07:47,359 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-12-03 15:07:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:47,359 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-12-03 15:07:47,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-12-03 15:07:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:07:47,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:47,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:47,362 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:47,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:47,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-12-03 15:07:47,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:47,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:47,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:47,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:47,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:47,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:47,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 15:07:47,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:47,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:47,570 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-12-03 15:07:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:48,991 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-12-03 15:07:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:07:48,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 15:07:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:48,996 INFO L225 Difference]: With dead ends: 307 [2018-12-03 15:07:48,996 INFO L226 Difference]: Without dead ends: 302 [2018-12-03 15:07:48,997 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 15:07:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-03 15:07:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-12-03 15:07:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 15:07:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-12-03 15:07:49,038 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-12-03 15:07:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:49,039 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-12-03 15:07:49,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-12-03 15:07:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:07:49,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:49,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:49,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:49,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-12-03 15:07:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:49,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:49,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:49,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:49,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:07:49,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:49,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:07:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:07:49,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:07:49,410 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-12-03 15:07:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:52,566 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-12-03 15:07:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:07:52,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:07:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:52,582 INFO L225 Difference]: With dead ends: 741 [2018-12-03 15:07:52,582 INFO L226 Difference]: Without dead ends: 733 [2018-12-03 15:07:52,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:07:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-12-03 15:07:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-12-03 15:07:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 15:07:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-12-03 15:07:52,647 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-12-03 15:07:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:52,647 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-12-03 15:07:52,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:07:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-12-03 15:07:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:07:52,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:52,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:52,651 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:52,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-12-03 15:07:52,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:52,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:52,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:52,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:52,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:07:52,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:52,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:07:52,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:07:52,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:07:52,833 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-12-03 15:07:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:57,546 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-12-03 15:07:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:07:57,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:07:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:57,553 INFO L225 Difference]: With dead ends: 797 [2018-12-03 15:07:57,553 INFO L226 Difference]: Without dead ends: 789 [2018-12-03 15:07:57,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:07:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-03 15:07:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-12-03 15:07:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-03 15:07:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-12-03 15:07:57,638 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-12-03 15:07:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:57,639 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-12-03 15:07:57,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:07:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-12-03 15:07:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:07:57,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:57,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:57,642 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:57,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-12-03 15:07:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:57,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:57,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:57,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:07:57,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:57,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:07:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:07:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:07:57,773 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-12-03 15:07:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:59,772 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-12-03 15:07:59,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:07:59,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:07:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:59,782 INFO L225 Difference]: With dead ends: 684 [2018-12-03 15:07:59,783 INFO L226 Difference]: Without dead ends: 676 [2018-12-03 15:07:59,784 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 15:07:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-12-03 15:07:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-12-03 15:07:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-12-03 15:07:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-12-03 15:07:59,844 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-12-03 15:07:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:59,844 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-12-03 15:07:59,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:07:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-12-03 15:07:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:07:59,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:59,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:59,846 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:59,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-12-03 15:07:59,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:59,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:59,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:59,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:59,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:59,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:07:59,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:59,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:07:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:07:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:07:59,935 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-12-03 15:08:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:01,408 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-12-03 15:08:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:08:01,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:01,414 INFO L225 Difference]: With dead ends: 605 [2018-12-03 15:08:01,414 INFO L226 Difference]: Without dead ends: 597 [2018-12-03 15:08:01,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:08:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-12-03 15:08:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-12-03 15:08:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-12-03 15:08:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-12-03 15:08:01,486 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-12-03 15:08:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:01,486 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-12-03 15:08:01,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-12-03 15:08:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:01,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:01,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:01,488 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:01,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-12-03 15:08:01,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:01,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:01,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:01,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:01,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:01,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:01,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:01,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:01,876 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-12-03 15:08:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:03,928 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-12-03 15:08:03,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:03,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:03,935 INFO L225 Difference]: With dead ends: 935 [2018-12-03 15:08:03,935 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 15:08:03,936 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 15:08:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 15:08:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-12-03 15:08:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-12-03 15:08:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-12-03 15:08:04,025 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-12-03 15:08:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:04,026 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-12-03 15:08:04,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-12-03 15:08:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:04,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:04,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:04,027 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:04,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:04,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-12-03 15:08:04,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:04,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:04,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:04,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:04,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:04,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:04,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:04,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:04,116 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-12-03 15:08:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:06,404 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-12-03 15:08:06,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:06,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:06,409 INFO L225 Difference]: With dead ends: 923 [2018-12-03 15:08:06,409 INFO L226 Difference]: Without dead ends: 915 [2018-12-03 15:08:06,410 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 15:08:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-03 15:08:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-12-03 15:08:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 15:08:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-12-03 15:08:06,507 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-12-03 15:08:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:06,507 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-12-03 15:08:06,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-12-03 15:08:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:06,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:06,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:06,510 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:06,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-12-03 15:08:06,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:06,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:06,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:06,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:06,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:06,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:06,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:06,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:06,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:06,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:06,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:06,618 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-12-03 15:08:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:08,280 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-12-03 15:08:08,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:08:08,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:08,286 INFO L225 Difference]: With dead ends: 837 [2018-12-03 15:08:08,286 INFO L226 Difference]: Without dead ends: 829 [2018-12-03 15:08:08,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:08:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-12-03 15:08:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-12-03 15:08:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-12-03 15:08:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-12-03 15:08:08,395 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-12-03 15:08:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:08,395 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-12-03 15:08:08,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-12-03 15:08:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:08,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:08,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:08,397 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:08,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-12-03 15:08:08,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:08,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:08,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:08,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:08,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:08,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:08,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:08,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:08,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:08,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:08,680 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-12-03 15:08:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:11,107 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-12-03 15:08:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:08:11,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:11,111 INFO L225 Difference]: With dead ends: 996 [2018-12-03 15:08:11,112 INFO L226 Difference]: Without dead ends: 988 [2018-12-03 15:08:11,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:08:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-12-03 15:08:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-12-03 15:08:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 15:08:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-12-03 15:08:11,214 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-12-03 15:08:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:11,216 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-12-03 15:08:11,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-12-03 15:08:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:11,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:11,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:11,218 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:11,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-12-03 15:08:11,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:11,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:11,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:11,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:11,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:11,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:11,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:11,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:11,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:11,291 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-12-03 15:08:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:13,273 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-12-03 15:08:13,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:08:13,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:13,280 INFO L225 Difference]: With dead ends: 913 [2018-12-03 15:08:13,280 INFO L226 Difference]: Without dead ends: 905 [2018-12-03 15:08:13,281 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 15:08:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-03 15:08:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-12-03 15:08:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-03 15:08:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-12-03 15:08:13,405 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-12-03 15:08:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:13,405 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-12-03 15:08:13,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-12-03 15:08:13,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:13,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:13,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:13,407 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:13,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:13,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-12-03 15:08:13,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:13,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:13,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:13,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:13,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:13,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:13,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:13,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:13,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:08:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:08:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:08:13,490 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-12-03 15:08:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:15,168 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-12-03 15:08:15,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:15,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 15:08:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:15,172 INFO L225 Difference]: With dead ends: 886 [2018-12-03 15:08:15,172 INFO L226 Difference]: Without dead ends: 878 [2018-12-03 15:08:15,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:08:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-12-03 15:08:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-12-03 15:08:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-03 15:08:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-12-03 15:08:15,308 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-12-03 15:08:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:15,308 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-12-03 15:08:15,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:08:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-12-03 15:08:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:15,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:15,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:15,310 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:15,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-12-03 15:08:15,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:15,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:15,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:15,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:15,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:15,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:15,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:15,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:15,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:15,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:15,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:15,422 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-12-03 15:08:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:17,469 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-12-03 15:08:17,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:08:17,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:17,475 INFO L225 Difference]: With dead ends: 801 [2018-12-03 15:08:17,475 INFO L226 Difference]: Without dead ends: 793 [2018-12-03 15:08:17,476 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 15:08:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-03 15:08:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-12-03 15:08:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-03 15:08:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-12-03 15:08:17,613 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-12-03 15:08:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:17,614 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-12-03 15:08:17,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-12-03 15:08:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:17,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:17,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:17,615 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:17,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:17,615 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-12-03 15:08:17,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:17,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:17,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:17,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:17,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:17,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:17,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:17,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:17,723 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-12-03 15:08:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:20,086 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-12-03 15:08:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:08:20,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:20,093 INFO L225 Difference]: With dead ends: 962 [2018-12-03 15:08:20,094 INFO L226 Difference]: Without dead ends: 954 [2018-12-03 15:08:20,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:08:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-03 15:08:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-12-03 15:08:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-03 15:08:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-12-03 15:08:20,326 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-12-03 15:08:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:20,327 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-12-03 15:08:20,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-12-03 15:08:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:20,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:20,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:20,329 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:20,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-12-03 15:08:20,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:20,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:20,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:20,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:20,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:20,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:20,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:20,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:20,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:20,674 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-12-03 15:08:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:23,070 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-12-03 15:08:23,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:08:23,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:23,076 INFO L225 Difference]: With dead ends: 1000 [2018-12-03 15:08:23,077 INFO L226 Difference]: Without dead ends: 992 [2018-12-03 15:08:23,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:08:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-12-03 15:08:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-12-03 15:08:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-12-03 15:08:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-12-03 15:08:23,239 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-12-03 15:08:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:23,239 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-12-03 15:08:23,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-12-03 15:08:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:23,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:23,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:23,241 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:23,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-12-03 15:08:23,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:23,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:23,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:23,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:23,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:23,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:23,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:23,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:23,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:23,336 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-12-03 15:08:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:26,226 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-12-03 15:08:26,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:08:26,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:26,233 INFO L225 Difference]: With dead ends: 1065 [2018-12-03 15:08:26,233 INFO L226 Difference]: Without dead ends: 1057 [2018-12-03 15:08:26,234 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 15:08:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-12-03 15:08:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-12-03 15:08:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-03 15:08:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-12-03 15:08:26,448 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-12-03 15:08:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:26,448 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-12-03 15:08:26,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-12-03 15:08:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:26,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:26,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:26,450 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:26,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-12-03 15:08:26,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:26,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:26,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:26,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:26,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:26,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:26,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:26,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:26,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:26,536 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-12-03 15:08:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:29,789 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-12-03 15:08:29,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:08:29,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:29,796 INFO L225 Difference]: With dead ends: 1227 [2018-12-03 15:08:29,796 INFO L226 Difference]: Without dead ends: 1219 [2018-12-03 15:08:29,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:08:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-12-03 15:08:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-12-03 15:08:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-12-03 15:08:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-12-03 15:08:30,009 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-12-03 15:08:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:30,009 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-12-03 15:08:30,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-12-03 15:08:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:30,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:30,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:30,010 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:30,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-12-03 15:08:30,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:30,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:30,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:30,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:30,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:30,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:30,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:30,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:30,101 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-12-03 15:08:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:33,041 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-12-03 15:08:33,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:08:33,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:33,046 INFO L225 Difference]: With dead ends: 1076 [2018-12-03 15:08:33,046 INFO L226 Difference]: Without dead ends: 1068 [2018-12-03 15:08:33,047 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 15:08:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-12-03 15:08:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-12-03 15:08:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-03 15:08:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-12-03 15:08:33,291 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-12-03 15:08:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:33,291 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-12-03 15:08:33,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-12-03 15:08:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:33,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:33,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:33,293 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:33,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:33,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-12-03 15:08:33,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:33,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:33,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:33,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:33,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:33,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:33,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:33,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:33,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:33,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:33,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:33,397 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-12-03 15:08:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:36,033 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-12-03 15:08:36,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:08:36,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:36,039 INFO L225 Difference]: With dead ends: 1111 [2018-12-03 15:08:36,039 INFO L226 Difference]: Without dead ends: 1103 [2018-12-03 15:08:36,040 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 15:08:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-12-03 15:08:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-12-03 15:08:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 15:08:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-12-03 15:08:36,362 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-12-03 15:08:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:36,363 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-12-03 15:08:36,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-12-03 15:08:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:36,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:36,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:36,364 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:36,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-12-03 15:08:36,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:36,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:36,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:36,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:36,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:36,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:36,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:36,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:36,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:36,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:36,461 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-12-03 15:08:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:39,934 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-12-03 15:08:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:08:39,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:39,942 INFO L225 Difference]: With dead ends: 1304 [2018-12-03 15:08:39,942 INFO L226 Difference]: Without dead ends: 1296 [2018-12-03 15:08:39,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:08:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-12-03 15:08:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-12-03 15:08:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-12-03 15:08:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-12-03 15:08:40,261 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-12-03 15:08:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:40,262 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-12-03 15:08:40,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-12-03 15:08:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:40,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:40,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:40,263 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:40,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-12-03 15:08:40,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:40,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:40,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:40,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:40,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:40,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:40,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:40,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:40,341 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-12-03 15:08:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:44,186 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-12-03 15:08:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:44,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:44,196 INFO L225 Difference]: With dead ends: 1370 [2018-12-03 15:08:44,196 INFO L226 Difference]: Without dead ends: 1362 [2018-12-03 15:08:44,197 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 15:08:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-12-03 15:08:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-12-03 15:08:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-12-03 15:08:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-12-03 15:08:44,560 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-12-03 15:08:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:44,560 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-12-03 15:08:44,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-12-03 15:08:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:08:44,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:44,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:44,562 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:44,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-12-03 15:08:44,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:44,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:44,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:44,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:44,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:44,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:44,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 15:08:44,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:44,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:44,693 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-12-03 15:08:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:47,646 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-12-03 15:08:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:08:47,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:08:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:47,652 INFO L225 Difference]: With dead ends: 1298 [2018-12-03 15:08:47,652 INFO L226 Difference]: Without dead ends: 1290 [2018-12-03 15:08:47,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:08:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-12-03 15:08:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-12-03 15:08:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 15:08:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-12-03 15:08:48,079 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-12-03 15:08:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:48,080 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-12-03 15:08:48,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-12-03 15:08:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:08:48,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:48,080 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:48,081 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:48,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-12-03 15:08:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:48,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:48,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:48,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:48,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:08:48,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:48,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:08:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:08:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:48,253 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-12-03 15:08:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:49,209 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-12-03 15:08:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:08:49,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 15:08:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:49,211 INFO L225 Difference]: With dead ends: 1242 [2018-12-03 15:08:49,211 INFO L226 Difference]: Without dead ends: 673 [2018-12-03 15:08:49,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-12-03 15:08:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-12-03 15:08:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-03 15:08:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-12-03 15:08:49,668 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-12-03 15:08:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:49,668 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-12-03 15:08:49,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:08:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-12-03 15:08:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:08:49,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:49,669 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:49,669 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:49,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-12-03 15:08:49,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:49,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:49,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:49,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:49,739 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 15:08:49,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:49,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:49,740 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 15:08:49,742 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [67], [72], [78], [279], [285], [286], [349] [2018-12-03 15:08:49,781 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:49,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:50,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:50,007 INFO L272 AbstractInterpreter]: Visited 11 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:08:50,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:50,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:50,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:50,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:50,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:50,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:50,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:51,739 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 15:08:51,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:52,060 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 15:08:52,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:52,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 15:08:52,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:52,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:08:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:08:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:08:52,082 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-12-03 15:08:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:56,804 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-12-03 15:08:56,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:08:56,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-12-03 15:08:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:56,807 INFO L225 Difference]: With dead ends: 854 [2018-12-03 15:08:56,807 INFO L226 Difference]: Without dead ends: 849 [2018-12-03 15:08:56,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:08:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-12-03 15:08:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-12-03 15:08:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-12-03 15:08:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-12-03 15:08:57,881 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-12-03 15:08:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:57,882 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-12-03 15:08:57,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:08:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-12-03 15:08:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:08:57,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:57,883 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:57,883 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:57,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-12-03 15:08:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:57,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:57,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:08:58,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:58,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:08:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:08:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:58,106 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-12-03 15:08:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:59,317 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-12-03 15:08:59,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:08:59,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 15:08:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:59,319 INFO L225 Difference]: With dead ends: 1308 [2018-12-03 15:08:59,320 INFO L226 Difference]: Without dead ends: 709 [2018-12-03 15:08:59,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-12-03 15:09:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-12-03 15:09:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-12-03 15:09:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-12-03 15:09:00,017 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-12-03 15:09:00,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:00,017 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-12-03 15:09:00,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:09:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-12-03 15:09:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:00,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:00,018 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:00,018 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:00,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-12-03 15:09:00,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:00,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:00,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:00,098 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 15:09:00,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:00,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:00,099 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:00,099 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [122], [199], [203], [207], [236], [245], [254], [260], [274], [349] [2018-12-03 15:09:00,101 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:00,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:00,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:00,116 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:09:00,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:00,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:00,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:00,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:00,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:00,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:00,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:00,327 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 15:09:00,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:00,517 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 15:09:00,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:00,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:09:00,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:00,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:09:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:09:00,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:09:00,537 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-12-03 15:09:05,281 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 15:09:09,594 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 15:09:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:15,791 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-12-03 15:09:15,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-12-03 15:09:15,792 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:09:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:15,795 INFO L225 Difference]: With dead ends: 2011 [2018-12-03 15:09:15,795 INFO L226 Difference]: Without dead ends: 2003 [2018-12-03 15:09:15,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9618 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3726, Invalid=23996, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:09:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-12-03 15:09:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-12-03 15:09:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-03 15:09:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-12-03 15:09:17,037 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-12-03 15:09:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:17,037 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-12-03 15:09:17,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:09:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-12-03 15:09:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:17,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:17,038 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:17,039 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:17,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-12-03 15:09:17,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:17,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:17,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:17,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:17,175 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 15:09:17,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:17,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:17,176 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:17,177 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [115], [199], [203], [207], [236], [245], [254], [260], [274], [349] [2018-12-03 15:09:17,178 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:17,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:17,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:17,192 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:09:17,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:17,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:17,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:17,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:17,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:17,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:17,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:17,425 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 15:09:17,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:17,581 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 15:09:17,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:17,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:09:17,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:17,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:09:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:09:17,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:09:17,604 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-12-03 15:09:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:30,203 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-12-03 15:09:30,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 15:09:30,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:09:30,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:30,211 INFO L225 Difference]: With dead ends: 2797 [2018-12-03 15:09:30,212 INFO L226 Difference]: Without dead ends: 2789 [2018-12-03 15:09:30,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6228 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2936, Invalid=16246, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:09:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-12-03 15:09:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-12-03 15:09:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-12-03 15:09:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-12-03 15:09:31,777 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-12-03 15:09:31,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:31,777 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-12-03 15:09:31,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:09:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-12-03 15:09:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:31,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:31,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:31,779 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:31,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-12-03 15:09:31,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:31,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:31,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:31,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:31,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:32,041 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 15:09:32,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:32,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:32,041 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:32,041 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [115], [199], [203], [207], [236], [245], [260], [274], [349] [2018-12-03 15:09:32,042 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:32,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:32,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:32,056 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:09:32,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:32,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:32,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:32,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:32,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:32,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:32,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:32,512 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 15:09:32,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:32,831 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 15:09:32,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:32,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:09:32,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:32,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:09:32,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:09:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:09:32,853 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-12-03 15:09:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:43,602 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-12-03 15:09:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 15:09:43,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:09:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:43,608 INFO L225 Difference]: With dead ends: 2492 [2018-12-03 15:09:43,608 INFO L226 Difference]: Without dead ends: 2484 [2018-12-03 15:09:43,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4667 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2123, Invalid=12639, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:09:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-12-03 15:09:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-12-03 15:09:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-12-03 15:09:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-12-03 15:09:45,113 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-12-03 15:09:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:45,113 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-12-03 15:09:45,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:09:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-12-03 15:09:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:45,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:45,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:45,115 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:45,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:45,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-12-03 15:09:45,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:45,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:45,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:45,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:45,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:45,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:45,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:45,914 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:45,914 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [179], [203], [217], [236], [245], [264], [274], [292], [298], [310], [349] [2018-12-03 15:09:45,915 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:45,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:45,962 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:45,962 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:09:46,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:46,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:46,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:46,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:46,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:46,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:46,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:46,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:46,419 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:09:46,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 15:09:46,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:46,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:09:46,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:09:46,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:09:46,421 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 10 states. [2018-12-03 15:09:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:54,173 INFO L93 Difference]: Finished difference Result 2293 states and 5149 transitions. [2018-12-03 15:09:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:09:54,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 15:09:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:54,180 INFO L225 Difference]: With dead ends: 2293 [2018-12-03 15:09:54,181 INFO L226 Difference]: Without dead ends: 2285 [2018-12-03 15:09:54,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=491, Invalid=2479, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:09:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2018-12-03 15:09:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1390. [2018-12-03 15:09:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2018-12-03 15:09:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 3233 transitions. [2018-12-03 15:09:55,706 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 3233 transitions. Word has length 16 [2018-12-03 15:09:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:55,707 INFO L480 AbstractCegarLoop]: Abstraction has 1390 states and 3233 transitions. [2018-12-03 15:09:55,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:09:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 3233 transitions. [2018-12-03 15:09:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:09:55,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:55,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:09:55,708 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:55,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1212620139, now seen corresponding path program 1 times [2018-12-03 15:09:55,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:55,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:55,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:55,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:55,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:55,782 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:09:55,782 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [102], [179], [203], [217], [227], [236], [264], [274], [292], [298], [310], [349] [2018-12-03 15:09:55,784 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:09:55,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:09:55,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:09:55,800 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:09:55,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:55,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:09:55,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:55,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:55,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:55,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:55,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:55,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:56,198 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:09:56,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 15:09:56,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:09:56,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:09:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:09:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:09:56,200 INFO L87 Difference]: Start difference. First operand 1390 states and 3233 transitions. Second operand 10 states. [2018-12-03 15:10:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:04,255 INFO L93 Difference]: Finished difference Result 2186 states and 4887 transitions. [2018-12-03 15:10:04,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:10:04,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 15:10:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:04,259 INFO L225 Difference]: With dead ends: 2186 [2018-12-03 15:10:04,259 INFO L226 Difference]: Without dead ends: 2178 [2018-12-03 15:10:04,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=597, Invalid=3063, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:10:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2018-12-03 15:10:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1379. [2018-12-03 15:10:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1379 states. [2018-12-03 15:10:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 3204 transitions. [2018-12-03 15:10:05,722 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 3204 transitions. Word has length 16 [2018-12-03 15:10:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:05,722 INFO L480 AbstractCegarLoop]: Abstraction has 1379 states and 3204 transitions. [2018-12-03 15:10:05,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:10:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 3204 transitions. [2018-12-03 15:10:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:05,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:05,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:05,724 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:05,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-12-03 15:10:05,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:05,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:05,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:05,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:05,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:05,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:05,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:05,820 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:10:05,820 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [102], [179], [183], [203], [217], [229], [264], [274], [292], [298], [310], [349] [2018-12-03 15:10:05,821 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:05,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:05,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:05,838 INFO L272 AbstractInterpreter]: Visited 16 different actions 21 times. Merged at 4 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:10:05,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:05,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:05,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:05,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:05,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:05,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:05,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:06,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:06,201 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:10:06,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 15:10:06,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:10:06,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:10:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:10:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:10:06,203 INFO L87 Difference]: Start difference. First operand 1379 states and 3204 transitions. Second operand 10 states. [2018-12-03 15:10:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:12,730 INFO L93 Difference]: Finished difference Result 1960 states and 4385 transitions. [2018-12-03 15:10:12,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:10:12,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 15:10:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:12,733 INFO L225 Difference]: With dead ends: 1960 [2018-12-03 15:10:12,733 INFO L226 Difference]: Without dead ends: 1952 [2018-12-03 15:10:12,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=2320, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:10:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2018-12-03 15:10:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1392. [2018-12-03 15:10:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-12-03 15:10:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 3244 transitions. [2018-12-03 15:10:14,171 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 3244 transitions. Word has length 16 [2018-12-03 15:10:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:14,171 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 3244 transitions. [2018-12-03 15:10:14,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:10:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 3244 transitions. [2018-12-03 15:10:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:14,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:14,172 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:14,172 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:14,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-12-03 15:10:14,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:14,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:14,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:14,254 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 15:10:14,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:14,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:14,254 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:10:14,255 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [92], [199], [203], [207], [236], [245], [254], [349] [2018-12-03 15:10:14,256 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:14,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:14,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:14,267 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:10:14,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:14,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:14,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:14,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:14,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:14,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:14,625 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 15:10:14,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:14,753 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 15:10:14,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:14,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:10:14,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:14,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:10:14,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:10:14,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:10:14,775 INFO L87 Difference]: Start difference. First operand 1392 states and 3244 transitions. Second operand 17 states. [2018-12-03 15:10:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:26,971 INFO L93 Difference]: Finished difference Result 2610 states and 5915 transitions. [2018-12-03 15:10:26,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:10:26,971 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:10:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:26,974 INFO L225 Difference]: With dead ends: 2610 [2018-12-03 15:10:26,974 INFO L226 Difference]: Without dead ends: 2602 [2018-12-03 15:10:26,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1805, Invalid=8701, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:10:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2018-12-03 15:10:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 1394. [2018-12-03 15:10:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2018-12-03 15:10:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 3250 transitions. [2018-12-03 15:10:28,385 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 3250 transitions. Word has length 16 [2018-12-03 15:10:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:28,385 INFO L480 AbstractCegarLoop]: Abstraction has 1394 states and 3250 transitions. [2018-12-03 15:10:28,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:10:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 3250 transitions. [2018-12-03 15:10:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:28,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:28,386 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:28,387 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:28,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-12-03 15:10:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:28,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:28,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:28,559 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 15:10:28,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:28,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:28,560 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:10:28,560 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [98], [199], [203], [207], [236], [245], [349] [2018-12-03 15:10:28,561 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:28,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:28,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:28,571 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:10:28,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:28,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:28,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:28,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:28,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:28,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:28,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:28,820 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 15:10:28,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:28,985 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 15:10:29,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:29,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:10:29,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:29,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:10:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:10:29,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:10:29,004 INFO L87 Difference]: Start difference. First operand 1394 states and 3250 transitions. Second operand 17 states. [2018-12-03 15:10:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:42,463 INFO L93 Difference]: Finished difference Result 2988 states and 6781 transitions. [2018-12-03 15:10:42,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:10:42,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:10:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:42,468 INFO L225 Difference]: With dead ends: 2988 [2018-12-03 15:10:42,468 INFO L226 Difference]: Without dead ends: 2980 [2018-12-03 15:10:42,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3769 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2006, Invalid=10650, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:10:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2018-12-03 15:10:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1474. [2018-12-03 15:10:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-12-03 15:10:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 3434 transitions. [2018-12-03 15:10:44,068 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 3434 transitions. Word has length 16 [2018-12-03 15:10:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:44,068 INFO L480 AbstractCegarLoop]: Abstraction has 1474 states and 3434 transitions. [2018-12-03 15:10:44,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:10:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 3434 transitions. [2018-12-03 15:10:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:44,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:44,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:44,069 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:44,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash 714972923, now seen corresponding path program 1 times [2018-12-03 15:10:44,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:44,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:44,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:44,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:44,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:44,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:44,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:44,214 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:10:44,215 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [98], [179], [203], [217], [236], [245], [292], [298], [310], [349] [2018-12-03 15:10:44,215 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:44,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:44,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:44,229 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:10:44,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:44,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:44,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:44,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:44,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:44,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:44,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:44,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:44,571 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:10:44,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 15:10:44,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:10:44,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:10:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:10:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:10:44,572 INFO L87 Difference]: Start difference. First operand 1474 states and 3434 transitions. Second operand 10 states. [2018-12-03 15:10:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:53,187 INFO L93 Difference]: Finished difference Result 2474 states and 5589 transitions. [2018-12-03 15:10:53,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:10:53,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 15:10:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:53,190 INFO L225 Difference]: With dead ends: 2474 [2018-12-03 15:10:53,190 INFO L226 Difference]: Without dead ends: 2466 [2018-12-03 15:10:53,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=556, Invalid=2750, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:10:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-12-03 15:10:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1583. [2018-12-03 15:10:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2018-12-03 15:10:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 3719 transitions. [2018-12-03 15:10:54,878 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 3719 transitions. Word has length 16 [2018-12-03 15:10:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:54,878 INFO L480 AbstractCegarLoop]: Abstraction has 1583 states and 3719 transitions. [2018-12-03 15:10:54,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:10:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 3719 transitions. [2018-12-03 15:10:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:10:54,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:54,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:10:54,879 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:54,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash 715074789, now seen corresponding path program 1 times [2018-12-03 15:10:54,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:54,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:54,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:54,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:54,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:54,965 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:10:54,965 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [102], [179], [203], [217], [227], [236], [292], [298], [310], [349] [2018-12-03 15:10:54,966 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:10:54,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:10:54,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:10:54,978 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:10:54,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:54,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:10:54,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:54,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:54,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:54,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:55,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:55,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:10:55,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 15:10:55,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:10:55,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:10:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:10:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:10:55,302 INFO L87 Difference]: Start difference. First operand 1583 states and 3719 transitions. Second operand 10 states. [2018-12-03 15:11:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:03,721 INFO L93 Difference]: Finished difference Result 2352 states and 5291 transitions. [2018-12-03 15:11:03,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:11:03,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 15:11:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:03,724 INFO L225 Difference]: With dead ends: 2352 [2018-12-03 15:11:03,724 INFO L226 Difference]: Without dead ends: 2344 [2018-12-03 15:11:03,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=712, Invalid=3578, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:11:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2018-12-03 15:11:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1572. [2018-12-03 15:11:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2018-12-03 15:11:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3690 transitions. [2018-12-03 15:11:05,550 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3690 transitions. Word has length 16 [2018-12-03 15:11:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:05,550 INFO L480 AbstractCegarLoop]: Abstraction has 1572 states and 3690 transitions. [2018-12-03 15:11:05,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:11:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3690 transitions. [2018-12-03 15:11:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:11:05,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:05,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:05,552 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:05,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:05,552 INFO L82 PathProgramCache]: Analyzing trace with hash 715075068, now seen corresponding path program 1 times [2018-12-03 15:11:05,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:05,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:05,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:05,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:05,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:05,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:05,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:05,644 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:11:05,644 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [102], [179], [183], [203], [217], [229], [292], [298], [310], [349] [2018-12-03 15:11:05,645 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:05,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:05,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:05,658 INFO L272 AbstractInterpreter]: Visited 16 different actions 21 times. Merged at 4 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:11:05,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:05,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:05,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:05,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:05,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:05,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:05,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:05,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:05,981 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:11:05,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [8] total 24 [2018-12-03 15:11:05,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:11:05,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:11:05,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:11:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:11:05,982 INFO L87 Difference]: Start difference. First operand 1572 states and 3690 transitions. Second operand 10 states. [2018-12-03 15:11:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:13,671 INFO L93 Difference]: Finished difference Result 2200 states and 4966 transitions. [2018-12-03 15:11:13,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:11:13,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 15:11:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:13,675 INFO L225 Difference]: With dead ends: 2200 [2018-12-03 15:11:13,675 INFO L226 Difference]: Without dead ends: 2192 [2018-12-03 15:11:13,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=528, Invalid=2664, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:11:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2018-12-03 15:11:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1409. [2018-12-03 15:11:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1409 states. [2018-12-03 15:11:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 3284 transitions. [2018-12-03 15:11:15,397 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 3284 transitions. Word has length 16 [2018-12-03 15:11:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:15,397 INFO L480 AbstractCegarLoop]: Abstraction has 1409 states and 3284 transitions. [2018-12-03 15:11:15,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:11:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 3284 transitions. [2018-12-03 15:11:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:11:15,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:15,398 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:15,399 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:15,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-12-03 15:11:15,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:15,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:15,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:15,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:15,810 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 15:11:15,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:15,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:15,811 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:11:15,811 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [67], [72], [78], [98], [199], [203], [207], [236], [245], [292], [349] [2018-12-03 15:11:15,812 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:15,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:15,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:15,820 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:11:15,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:15,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:15,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:15,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:15,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:15,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:15,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:16,021 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 15:11:16,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:16,162 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 15:11:16,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:16,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 15:11:16,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:16,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:11:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:11:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:11:16,182 INFO L87 Difference]: Start difference. First operand 1409 states and 3284 transitions. Second operand 17 states. [2018-12-03 15:11:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:31,808 INFO L93 Difference]: Finished difference Result 2816 states and 6400 transitions. [2018-12-03 15:11:31,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:11:31,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:11:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:31,811 INFO L225 Difference]: With dead ends: 2816 [2018-12-03 15:11:31,812 INFO L226 Difference]: Without dead ends: 2808 [2018-12-03 15:11:31,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2779 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1562, Invalid=7944, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:11:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2018-12-03 15:11:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1325. [2018-12-03 15:11:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2018-12-03 15:11:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 3094 transitions. [2018-12-03 15:11:33,330 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 3094 transitions. Word has length 16 [2018-12-03 15:11:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:33,330 INFO L480 AbstractCegarLoop]: Abstraction has 1325 states and 3094 transitions. [2018-12-03 15:11:33,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:11:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 3094 transitions. [2018-12-03 15:11:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:11:33,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:33,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:33,331 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:33,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash -688951426, now seen corresponding path program 1 times [2018-12-03 15:11:33,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:33,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:33,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:33,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:11:33,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 15:11:33,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:11:33,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:11:33,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:11:33,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:11:33,440 INFO L87 Difference]: Start difference. First operand 1325 states and 3094 transitions. Second operand 9 states. [2018-12-03 15:11:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:38,725 INFO L93 Difference]: Finished difference Result 1894 states and 4354 transitions. [2018-12-03 15:11:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:11:38,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:11:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:38,727 INFO L225 Difference]: With dead ends: 1894 [2018-12-03 15:11:38,728 INFO L226 Difference]: Without dead ends: 1886 [2018-12-03 15:11:38,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:11:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-12-03 15:11:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1302. [2018-12-03 15:11:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2018-12-03 15:11:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 3023 transitions. [2018-12-03 15:11:40,233 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 3023 transitions. Word has length 16 [2018-12-03 15:11:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:40,233 INFO L480 AbstractCegarLoop]: Abstraction has 1302 states and 3023 transitions. [2018-12-03 15:11:40,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:11:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 3023 transitions. [2018-12-03 15:11:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:11:40,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:40,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:40,234 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:40,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash -688849281, now seen corresponding path program 1 times [2018-12-03 15:11:40,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:40,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:40,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:40,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:40,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:40,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:11:40,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 15:11:40,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:11:40,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:11:40,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:11:40,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:11:40,328 INFO L87 Difference]: Start difference. First operand 1302 states and 3023 transitions. Second operand 9 states. [2018-12-03 15:11:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:45,145 INFO L93 Difference]: Finished difference Result 1676 states and 3773 transitions. [2018-12-03 15:11:45,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:11:45,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:11:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:45,148 INFO L225 Difference]: With dead ends: 1676 [2018-12-03 15:11:45,148 INFO L226 Difference]: Without dead ends: 1668 [2018-12-03 15:11:45,149 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 15:11:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2018-12-03 15:11:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1300. [2018-12-03 15:11:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-12-03 15:11:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3016 transitions. [2018-12-03 15:11:46,786 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3016 transitions. Word has length 16 [2018-12-03 15:11:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:46,786 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 3016 transitions. [2018-12-03 15:11:46,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:11:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3016 transitions. [2018-12-03 15:11:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:11:46,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:46,787 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:11:46,787 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:46,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:46,787 INFO L82 PathProgramCache]: Analyzing trace with hash -679935045, now seen corresponding path program 1 times [2018-12-03 15:11:46,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:46,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:46,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:46,888 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 15:11:46,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:46,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:46,889 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:11:46,889 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [67], [72], [78], [174], [179], [183], [203], [217], [298], [310], [349] [2018-12-03 15:11:46,890 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:11:46,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:11:46,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:11:46,898 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:11:46,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:46,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:11:46,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:46,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:46,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:46,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:46,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:47,063 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 15:11:47,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:47,212 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 15:11:47,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:47,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 25 [2018-12-03 15:11:47,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:47,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:11:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:11:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:11:47,234 INFO L87 Difference]: Start difference. First operand 1300 states and 3016 transitions. Second operand 18 states. [2018-12-03 15:12:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:01,328 INFO L93 Difference]: Finished difference Result 2025 states and 4585 transitions. [2018-12-03 15:12:01,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:12:01,329 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-12-03 15:12:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:01,331 INFO L225 Difference]: With dead ends: 2025 [2018-12-03 15:12:01,331 INFO L226 Difference]: Without dead ends: 2017 [2018-12-03 15:12:01,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2462 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1473, Invalid=7457, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:12:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2018-12-03 15:12:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1069. [2018-12-03 15:12:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-12-03 15:12:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-12-03 15:12:02,672 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-12-03 15:12:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:02,673 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-12-03 15:12:02,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:12:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-12-03 15:12:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:02,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:02,674 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:02,674 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:02,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-12-03 15:12:02,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:02,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:02,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:02,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:02,753 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 15:12:02,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:02,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:02,754 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:02,754 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [199], [203], [207], [236], [245], [254], [337], [345], [351] [2018-12-03 15:12:02,755 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:02,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:02,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:02,763 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:12:02,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:02,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:02,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:02,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:02,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:02,782 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:02,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:02,791 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 15:12:02,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:02,824 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 15:12:02,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:02,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:02,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:02,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:02,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:02,845 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-12-03 15:12:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:06,806 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-12-03 15:12:06,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:12:06,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:06,808 INFO L225 Difference]: With dead ends: 1522 [2018-12-03 15:12:06,808 INFO L226 Difference]: Without dead ends: 1514 [2018-12-03 15:12:06,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:12:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-12-03 15:12:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-12-03 15:12:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-12-03 15:12:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-12-03 15:12:08,496 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-12-03 15:12:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:08,497 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-12-03 15:12:08,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-12-03 15:12:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:08,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:08,498 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:08,498 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:08,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-12-03 15:12:08,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:08,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:08,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:08,577 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 15:12:08,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:08,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:08,577 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:08,577 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [102], [186], [192], [203], [227], [229], [236], [337], [345], [351] [2018-12-03 15:12:08,578 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:08,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:08,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:08,591 INFO L272 AbstractInterpreter]: Visited 15 different actions 19 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:12:08,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:08,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:08,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:08,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:08,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:08,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:08,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:08,614 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 15:12:08,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:08,662 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 15:12:08,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:08,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:08,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:08,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:08,682 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-12-03 15:12:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:12,563 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-12-03 15:12:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:12:12,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:12,566 INFO L225 Difference]: With dead ends: 1661 [2018-12-03 15:12:12,566 INFO L226 Difference]: Without dead ends: 1653 [2018-12-03 15:12:12,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:12:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-12-03 15:12:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-12-03 15:12:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-12-03 15:12:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-12-03 15:12:14,068 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-12-03 15:12:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:14,069 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-12-03 15:12:14,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-12-03 15:12:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:14,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:14,069 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:14,070 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:14,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:14,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-12-03 15:12:14,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:14,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:14,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:14,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:14,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:14,183 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 15:12:14,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:14,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:14,184 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:14,184 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [102], [183], [186], [192], [203], [229], [337], [345], [351] [2018-12-03 15:12:14,185 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:14,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:14,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:14,192 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:12:14,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:14,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:14,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:14,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:14,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:14,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:14,225 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 15:12:14,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:14,256 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 15:12:14,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:14,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:14,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:14,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:14,276 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-12-03 15:12:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:18,838 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-12-03 15:12:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:12:18,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:18,840 INFO L225 Difference]: With dead ends: 1772 [2018-12-03 15:12:18,841 INFO L226 Difference]: Without dead ends: 1764 [2018-12-03 15:12:18,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:12:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-12-03 15:12:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-12-03 15:12:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-12-03 15:12:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-12-03 15:12:20,461 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-12-03 15:12:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:20,461 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-12-03 15:12:20,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-12-03 15:12:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:20,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:20,462 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:20,462 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:20,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-12-03 15:12:20,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:20,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:20,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:20,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:20,544 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 15:12:20,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:20,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:20,545 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:20,545 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [203], [213], [227], [236], [277], [279], [286], [337], [345], [351] [2018-12-03 15:12:20,546 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:20,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:20,558 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:20,558 INFO L272 AbstractInterpreter]: Visited 15 different actions 21 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:12:20,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:20,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:20,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:20,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:20,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:20,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:20,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:20,590 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 15:12:20,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:20,643 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 15:12:20,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:20,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:20,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:20,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:20,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:20,663 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-12-03 15:12:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:24,722 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-12-03 15:12:24,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:12:24,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:24,724 INFO L225 Difference]: With dead ends: 1789 [2018-12-03 15:12:24,724 INFO L226 Difference]: Without dead ends: 1781 [2018-12-03 15:12:24,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:12:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-12-03 15:12:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-12-03 15:12:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-12-03 15:12:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-12-03 15:12:26,353 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-12-03 15:12:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:26,353 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-12-03 15:12:26,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-12-03 15:12:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:26,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:26,354 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:26,354 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:26,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:26,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-12-03 15:12:26,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:26,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:26,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:26,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:26,436 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 15:12:26,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:26,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:26,437 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:26,437 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [183], [203], [213], [229], [277], [279], [286], [337], [345], [351] [2018-12-03 15:12:26,438 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:26,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:26,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:26,446 INFO L272 AbstractInterpreter]: Visited 15 different actions 20 times. Merged at 4 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:12:26,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:26,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:26,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:26,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:26,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:26,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:26,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:26,474 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 15:12:26,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:26,507 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 15:12:26,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:26,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:26,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:26,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:26,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:26,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:26,528 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. [2018-12-03 15:12:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:31,566 INFO L93 Difference]: Finished difference Result 2013 states and 4457 transitions. [2018-12-03 15:12:31,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:12:31,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:31,568 INFO L225 Difference]: With dead ends: 2013 [2018-12-03 15:12:31,569 INFO L226 Difference]: Without dead ends: 2005 [2018-12-03 15:12:31,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:12:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-03 15:12:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1324. [2018-12-03 15:12:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-12-03 15:12:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 3031 transitions. [2018-12-03 15:12:33,239 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 3031 transitions. Word has length 16 [2018-12-03 15:12:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:33,239 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 3031 transitions. [2018-12-03 15:12:33,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 3031 transitions. [2018-12-03 15:12:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:33,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:33,240 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:33,240 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:33,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1137226608, now seen corresponding path program 1 times [2018-12-03 15:12:33,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:33,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:33,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:33,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:33,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:33,565 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 15:12:33,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:33,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:33,566 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:33,566 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [174], [183], [203], [279], [283], [286], [337], [345], [351] [2018-12-03 15:12:33,566 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:33,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:33,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:33,573 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:12:33,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:33,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:33,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:33,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:33,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:33,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:33,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:33,603 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 15:12:33,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:33,631 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 15:12:33,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:33,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:33,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:33,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:33,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:33,651 INFO L87 Difference]: Start difference. First operand 1324 states and 3031 transitions. Second operand 8 states. [2018-12-03 15:12:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:38,426 INFO L93 Difference]: Finished difference Result 1884 states and 4184 transitions. [2018-12-03 15:12:38,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:12:38,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:38,429 INFO L225 Difference]: With dead ends: 1884 [2018-12-03 15:12:38,429 INFO L226 Difference]: Without dead ends: 1876 [2018-12-03 15:12:38,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:12:38,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2018-12-03 15:12:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1338. [2018-12-03 15:12:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2018-12-03 15:12:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 3063 transitions. [2018-12-03 15:12:40,153 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 3063 transitions. Word has length 16 [2018-12-03 15:12:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:40,154 INFO L480 AbstractCegarLoop]: Abstraction has 1338 states and 3063 transitions. [2018-12-03 15:12:40,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 3063 transitions. [2018-12-03 15:12:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:40,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:40,154 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:40,154 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:40,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-12-03 15:12:40,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:40,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:40,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:40,236 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 15:12:40,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:40,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:40,237 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:40,237 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [203], [213], [227], [236], [277], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 15:12:40,238 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:40,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:40,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:40,258 INFO L272 AbstractInterpreter]: Visited 15 different actions 22 times. Merged at 6 different actions 6 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:12:40,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:40,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:40,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:40,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:40,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:40,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:40,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:40,300 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 15:12:40,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:40,330 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 15:12:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:40,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:40,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:40,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:40,352 INFO L87 Difference]: Start difference. First operand 1338 states and 3063 transitions. Second operand 8 states. [2018-12-03 15:12:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:44,068 INFO L93 Difference]: Finished difference Result 1644 states and 3666 transitions. [2018-12-03 15:12:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:12:44,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:44,070 INFO L225 Difference]: With dead ends: 1644 [2018-12-03 15:12:44,071 INFO L226 Difference]: Without dead ends: 1636 [2018-12-03 15:12:44,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:12:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2018-12-03 15:12:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1321. [2018-12-03 15:12:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2018-12-03 15:12:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 3020 transitions. [2018-12-03 15:12:45,727 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 3020 transitions. Word has length 16 [2018-12-03 15:12:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:45,727 INFO L480 AbstractCegarLoop]: Abstraction has 1321 states and 3020 transitions. [2018-12-03 15:12:45,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 3020 transitions. [2018-12-03 15:12:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:45,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:45,728 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:45,728 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:45,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:45,729 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-12-03 15:12:45,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:45,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:45,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:45,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:45,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:45,792 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 15:12:45,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:45,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:45,792 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:45,793 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [183], [203], [213], [229], [277], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 15:12:45,793 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:45,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:45,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:45,801 INFO L272 AbstractInterpreter]: Visited 15 different actions 21 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:12:45,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:45,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:45,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:45,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:45,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:45,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:45,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:45,826 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 15:12:45,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:45,863 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 15:12:45,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:45,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:45,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:45,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:45,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:45,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:45,883 INFO L87 Difference]: Start difference. First operand 1321 states and 3020 transitions. Second operand 8 states. [2018-12-03 15:12:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:50,640 INFO L93 Difference]: Finished difference Result 1868 states and 4167 transitions. [2018-12-03 15:12:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:12:50,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:50,642 INFO L225 Difference]: With dead ends: 1868 [2018-12-03 15:12:50,643 INFO L226 Difference]: Without dead ends: 1860 [2018-12-03 15:12:50,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:12:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2018-12-03 15:12:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1300. [2018-12-03 15:12:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-12-03 15:12:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2975 transitions. [2018-12-03 15:12:52,296 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2975 transitions. Word has length 16 [2018-12-03 15:12:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:52,296 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 2975 transitions. [2018-12-03 15:12:52,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2975 transitions. [2018-12-03 15:12:52,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:52,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:52,296 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:52,297 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:52,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:52,297 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-12-03 15:12:52,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:52,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:52,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:52,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:52,362 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 15:12:52,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:52,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:52,363 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:52,363 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [174], [183], [203], [279], [283], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 15:12:52,364 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:52,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:52,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:52,370 INFO L272 AbstractInterpreter]: Visited 15 different actions 19 times. Merged at 3 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:12:52,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:52,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:52,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:52,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:52,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:52,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:52,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:52,399 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 15:12:52,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:52,439 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 15:12:52,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:52,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:52,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:52,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:52,460 INFO L87 Difference]: Start difference. First operand 1300 states and 2975 transitions. Second operand 8 states. [2018-12-03 15:12:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:57,420 INFO L93 Difference]: Finished difference Result 1963 states and 4379 transitions. [2018-12-03 15:12:57,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:12:57,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:12:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:57,424 INFO L225 Difference]: With dead ends: 1963 [2018-12-03 15:12:57,424 INFO L226 Difference]: Without dead ends: 1955 [2018-12-03 15:12:57,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:12:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-12-03 15:12:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1294. [2018-12-03 15:12:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2018-12-03 15:12:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2963 transitions. [2018-12-03 15:12:59,098 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2963 transitions. Word has length 16 [2018-12-03 15:12:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:59,098 INFO L480 AbstractCegarLoop]: Abstraction has 1294 states and 2963 transitions. [2018-12-03 15:12:59,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:12:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2963 transitions. [2018-12-03 15:12:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:12:59,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:59,099 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:12:59,100 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:59,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1012397261, now seen corresponding path program 1 times [2018-12-03 15:12:59,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:59,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:59,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:59,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:59,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:59,158 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 15:12:59,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:59,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:59,159 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 15:12:59,159 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [174], [183], [203], [283], [314], [317], [323], [331], [339], [345], [351] [2018-12-03 15:12:59,160 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:12:59,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:12:59,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:12:59,166 INFO L272 AbstractInterpreter]: Visited 14 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:12:59,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:59,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:12:59,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:59,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:59,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:59,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:59,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:59,231 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 15:12:59,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:59,253 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 15:12:59,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:59,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:12:59,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:59,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:12:59,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:12:59,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:12:59,273 INFO L87 Difference]: Start difference. First operand 1294 states and 2963 transitions. Second operand 8 states. [2018-12-03 15:13:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:03,113 INFO L93 Difference]: Finished difference Result 1586 states and 3547 transitions. [2018-12-03 15:13:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:13:03,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 15:13:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:03,116 INFO L225 Difference]: With dead ends: 1586 [2018-12-03 15:13:03,116 INFO L226 Difference]: Without dead ends: 1578 [2018-12-03 15:13:03,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:13:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2018-12-03 15:13:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1230. [2018-12-03 15:13:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2018-12-03 15:13:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2809 transitions. [2018-12-03 15:13:04,772 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2809 transitions. Word has length 16 [2018-12-03 15:13:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:04,772 INFO L480 AbstractCegarLoop]: Abstraction has 1230 states and 2809 transitions. [2018-12-03 15:13:04,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:13:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2809 transitions. [2018-12-03 15:13:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:13:04,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:04,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:13:04,773 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:04,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1223690942, now seen corresponding path program 1 times [2018-12-03 15:13:04,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:04,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:04,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:04,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:04,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:04,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:04,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:04,886 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-03 15:13:04,886 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [59], [65], [72], [78], [113], [120], [126], [260], [262], [274], [279], [285], [343], [349] [2018-12-03 15:13:04,887 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:13:04,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:13:04,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:13:04,899 INFO L272 AbstractInterpreter]: Visited 17 different actions 27 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:13:04,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:04,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:13:04,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:04,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:04,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:04,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:13:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:04,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:05,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:05,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:05,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2018-12-03 15:13:05,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:05,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:13:05,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:13:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:13:05,161 INFO L87 Difference]: Start difference. First operand 1230 states and 2809 transitions. Second operand 18 states. [2018-12-03 15:13:18,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:18,669 INFO L93 Difference]: Finished difference Result 3844 states and 8615 transitions. [2018-12-03 15:13:18,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:13:18,670 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 15:13:18,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:18,674 INFO L225 Difference]: With dead ends: 3844 [2018-12-03 15:13:18,674 INFO L226 Difference]: Without dead ends: 3836 [2018-12-03 15:13:18,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1981, Invalid=6575, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 15:13:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2018-12-03 15:13:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 2181. [2018-12-03 15:13:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2018-12-03 15:13:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 5032 transitions. [2018-12-03 15:13:21,906 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 5032 transitions. Word has length 17 [2018-12-03 15:13:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:21,906 INFO L480 AbstractCegarLoop]: Abstraction has 2181 states and 5032 transitions. [2018-12-03 15:13:21,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:13:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 5032 transitions. [2018-12-03 15:13:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:13:21,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:21,907 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 15:13:21,907 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:21,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash 523391216, now seen corresponding path program 1 times [2018-12-03 15:13:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:21,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:21,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:21,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:21,992 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 15:13:21,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:21,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:21,993 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:13:21,993 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [94], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [254], [260], [274], [349] [2018-12-03 15:13:21,994 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:13:21,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:13:22,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:13:22,005 INFO L272 AbstractInterpreter]: Visited 19 different actions 29 times. Merged at 8 different actions 8 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:13:22,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:22,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:13:22,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:22,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:22,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:22,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:13:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:22,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:22,232 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 15:13:22,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:22,735 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 15:13:22,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:22,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2018-12-03 15:13:22,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:22,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:13:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:13:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:13:22,755 INFO L87 Difference]: Start difference. First operand 2181 states and 5032 transitions. Second operand 14 states. [2018-12-03 15:13:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:38,952 INFO L93 Difference]: Finished difference Result 5886 states and 13337 transitions. [2018-12-03 15:13:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:13:38,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 15:13:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:38,959 INFO L225 Difference]: With dead ends: 5886 [2018-12-03 15:13:38,959 INFO L226 Difference]: Without dead ends: 5878 [2018-12-03 15:13:38,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1131, Invalid=3981, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:13:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2018-12-03 15:13:43,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 3157. [2018-12-03 15:13:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2018-12-03 15:13:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 7416 transitions. [2018-12-03 15:13:43,683 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 7416 transitions. Word has length 20 [2018-12-03 15:13:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:43,683 INFO L480 AbstractCegarLoop]: Abstraction has 3157 states and 7416 transitions. [2018-12-03 15:13:43,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:13:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 7416 transitions. [2018-12-03 15:13:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:13:43,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:43,684 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 15:13:43,684 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:43,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:43,685 INFO L82 PathProgramCache]: Analyzing trace with hash 520590862, now seen corresponding path program 1 times [2018-12-03 15:13:43,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:43,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:43,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:43,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:43,774 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:13:43,774 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [260], [274], [349] [2018-12-03 15:13:43,776 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:13:43,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:13:43,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:13:43,785 INFO L272 AbstractInterpreter]: Visited 18 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:13:43,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:43,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:13:43,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:43,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:43,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:43,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:13:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:43,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:43,888 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 15:13:43,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:43,969 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 15:13:43,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:43,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2018-12-03 15:13:43,989 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:43,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:13:43,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:13:43,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:13:43,990 INFO L87 Difference]: Start difference. First operand 3157 states and 7416 transitions. Second operand 14 states. [2018-12-03 15:13:52,551 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 15:14:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:00,550 INFO L93 Difference]: Finished difference Result 5901 states and 13371 transitions. [2018-12-03 15:14:00,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:14:00,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 15:14:00,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:00,557 INFO L225 Difference]: With dead ends: 5901 [2018-12-03 15:14:00,557 INFO L226 Difference]: Without dead ends: 5893 [2018-12-03 15:14:00,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3523, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:14:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-12-03 15:14:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 3101. [2018-12-03 15:14:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2018-12-03 15:14:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7261 transitions. [2018-12-03 15:14:05,075 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7261 transitions. Word has length 20 [2018-12-03 15:14:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:05,075 INFO L480 AbstractCegarLoop]: Abstraction has 3101 states and 7261 transitions. [2018-12-03 15:14:05,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:14:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7261 transitions. [2018-12-03 15:14:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:14:05,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:05,076 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:14:05,076 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:05,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 520693007, now seen corresponding path program 1 times [2018-12-03 15:14:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:05,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:05,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:05,332 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 15:14:05,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:05,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:05,333 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:14:05,333 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [102], [104], [110], [115], [183], [186], [192], [203], [229], [260], [274], [349] [2018-12-03 15:14:05,334 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:14:05,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:14:05,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:14:05,341 INFO L272 AbstractInterpreter]: Visited 16 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:14:05,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:05,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:14:05,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:05,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:05,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:05,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:05,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:05,431 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 15:14:05,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:05,518 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 15:14:05,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:05,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2018-12-03 15:14:05,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:05,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:14:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:14:05,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:14:05,537 INFO L87 Difference]: Start difference. First operand 3101 states and 7261 transitions. Second operand 14 states. [2018-12-03 15:14:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:20,243 INFO L93 Difference]: Finished difference Result 5075 states and 11387 transitions. [2018-12-03 15:14:20,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:14:20,243 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 15:14:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:20,248 INFO L225 Difference]: With dead ends: 5075 [2018-12-03 15:14:20,249 INFO L226 Difference]: Without dead ends: 5067 [2018-12-03 15:14:20,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=730, Invalid=2240, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:14:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-12-03 15:14:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 3178. [2018-12-03 15:14:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2018-12-03 15:14:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 7413 transitions. [2018-12-03 15:14:24,877 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 7413 transitions. Word has length 20 [2018-12-03 15:14:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:24,878 INFO L480 AbstractCegarLoop]: Abstraction has 3178 states and 7413 transitions. [2018-12-03 15:14:24,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:14:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 7413 transitions. [2018-12-03 15:14:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:14:24,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:24,879 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 15:14:24,879 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:24,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash -740478461, now seen corresponding path program 1 times [2018-12-03 15:14:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:24,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:25,180 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 15:14:25,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:25,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:25,181 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:14:25,181 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [92], [94], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [254], [349] [2018-12-03 15:14:25,182 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:14:25,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:14:25,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:14:25,191 INFO L272 AbstractInterpreter]: Visited 20 different actions 30 times. Merged at 8 different actions 8 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:14:25,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:25,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:14:25,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:25,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:25,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:25,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:25,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:25,331 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 15:14:25,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:25,465 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 15:14:25,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:25,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 15:14:25,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:25,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:14:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:14:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:14:25,486 INFO L87 Difference]: Start difference. First operand 3178 states and 7413 transitions. Second operand 14 states. [2018-12-03 15:14:30,752 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 15:14:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:42,189 INFO L93 Difference]: Finished difference Result 5795 states and 13131 transitions. [2018-12-03 15:14:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:14:42,190 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 15:14:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:42,197 INFO L225 Difference]: With dead ends: 5795 [2018-12-03 15:14:42,197 INFO L226 Difference]: Without dead ends: 5787 [2018-12-03 15:14:42,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=694, Invalid=2846, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:14:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2018-12-03 15:14:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 3418. [2018-12-03 15:14:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2018-12-03 15:14:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 7942 transitions. [2018-12-03 15:14:47,382 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 7942 transitions. Word has length 20 [2018-12-03 15:14:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:47,382 INFO L480 AbstractCegarLoop]: Abstraction has 3418 states and 7942 transitions. [2018-12-03 15:14:47,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:14:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 7942 transitions. [2018-12-03 15:14:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:14:47,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:47,383 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 15:14:47,384 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:47,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash -743278815, now seen corresponding path program 1 times [2018-12-03 15:14:47,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:47,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:47,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:47,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:47,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:47,473 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 15:14:47,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:47,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:47,473 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:14:47,474 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [98], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [349] [2018-12-03 15:14:47,475 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:14:47,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:14:47,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:14:47,483 INFO L272 AbstractInterpreter]: Visited 19 different actions 28 times. Merged at 7 different actions 7 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:14:47,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:47,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:14:47,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:47,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:47,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:47,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:47,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:47,598 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 15:14:47,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:47,699 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 15:14:47,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:47,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 15:14:47,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:47,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:14:47,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:14:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:14:47,722 INFO L87 Difference]: Start difference. First operand 3418 states and 7942 transitions. Second operand 14 states. [2018-12-03 15:15:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:03,544 INFO L93 Difference]: Finished difference Result 5717 states and 12951 transitions. [2018-12-03 15:15:03,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:15:03,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 15:15:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:03,551 INFO L225 Difference]: With dead ends: 5717 [2018-12-03 15:15:03,551 INFO L226 Difference]: Without dead ends: 5709 [2018-12-03 15:15:03,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=652, Invalid=2540, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:15:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2018-12-03 15:15:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 3401. [2018-12-03 15:15:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-12-03 15:15:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 7902 transitions. [2018-12-03 15:15:08,814 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 7902 transitions. Word has length 20 [2018-12-03 15:15:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:08,814 INFO L480 AbstractCegarLoop]: Abstraction has 3401 states and 7902 transitions. [2018-12-03 15:15:08,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:15:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 7902 transitions. [2018-12-03 15:15:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:15:08,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:08,815 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 15:15:08,816 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:08,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash -743176670, now seen corresponding path program 1 times [2018-12-03 15:15:08,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:08,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:08,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:08,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:08,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:08,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:08,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:08,902 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:15:08,902 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [102], [104], [110], [115], [183], [186], [192], [203], [229], [349] [2018-12-03 15:15:08,902 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:15:08,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:15:08,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:15:08,910 INFO L272 AbstractInterpreter]: Visited 17 different actions 23 times. Merged at 5 different actions 5 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:15:08,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:08,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:15:08,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:08,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:08,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:08,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:08,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:09,189 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 15:15:09,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:09,289 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 15:15:09,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:09,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 15:15:09,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:15:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:15:09,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:15:09,309 INFO L87 Difference]: Start difference. First operand 3401 states and 7902 transitions. Second operand 14 states. [2018-12-03 15:15:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:22,969 INFO L93 Difference]: Finished difference Result 4907 states and 11065 transitions. [2018-12-03 15:15:22,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:15:22,969 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 15:15:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:22,974 INFO L225 Difference]: With dead ends: 4907 [2018-12-03 15:15:22,974 INFO L226 Difference]: Without dead ends: 4899 [2018-12-03 15:15:22,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:15:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2018-12-03 15:15:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 3264. [2018-12-03 15:15:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2018-12-03 15:15:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 7570 transitions. [2018-12-03 15:15:28,302 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 7570 transitions. Word has length 20 [2018-12-03 15:15:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:28,302 INFO L480 AbstractCegarLoop]: Abstraction has 3264 states and 7570 transitions. [2018-12-03 15:15:28,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:15:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 7570 transitions. [2018-12-03 15:15:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:15:28,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:28,304 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 15:15:28,304 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:28,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:28,304 INFO L82 PathProgramCache]: Analyzing trace with hash -245402134, now seen corresponding path program 1 times [2018-12-03 15:15:28,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:28,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:28,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:28,389 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 15:15:28,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:28,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:28,389 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:15:28,390 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [61], [67], [72], [76], [78], [84], [92], [203], [236], [245], [254], [279], [286], [349] [2018-12-03 15:15:28,391 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:15:28,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:15:28,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:15:28,400 INFO L272 AbstractInterpreter]: Visited 18 different actions 30 times. Merged at 10 different actions 10 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:15:28,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:28,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:15:28,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:28,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:28,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:28,446 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:28,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:28,511 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 15:15:28,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:28,586 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 15:15:28,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:28,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:15:28,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:28,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:15:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:15:28,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:15:28,605 INFO L87 Difference]: Start difference. First operand 3264 states and 7570 transitions. Second operand 11 states. [2018-12-03 15:15:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:37,934 INFO L93 Difference]: Finished difference Result 3785 states and 8617 transitions. [2018-12-03 15:15:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:15:37,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:15:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:37,939 INFO L225 Difference]: With dead ends: 3785 [2018-12-03 15:15:37,939 INFO L226 Difference]: Without dead ends: 3777 [2018-12-03 15:15:37,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:15:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2018-12-03 15:15:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3318. [2018-12-03 15:15:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3318 states. [2018-12-03 15:15:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 7706 transitions. [2018-12-03 15:15:43,191 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 7706 transitions. Word has length 20 [2018-12-03 15:15:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:43,191 INFO L480 AbstractCegarLoop]: Abstraction has 3318 states and 7706 transitions. [2018-12-03 15:15:43,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:15:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 7706 transitions. [2018-12-03 15:15:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:15:43,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:43,193 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 15:15:43,193 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:43,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash -248202488, now seen corresponding path program 1 times [2018-12-03 15:15:43,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:43,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:43,273 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 15:15:43,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:43,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:43,274 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:15:43,274 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [61], [67], [72], [76], [78], [84], [94], [98], [203], [236], [245], [279], [286], [349] [2018-12-03 15:15:43,276 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:15:43,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:15:43,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:15:43,286 INFO L272 AbstractInterpreter]: Visited 18 different actions 30 times. Merged at 10 different actions 10 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:15:43,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:43,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:15:43,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:43,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:43,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:43,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:43,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:43,349 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 15:15:43,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:43,435 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 15:15:43,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:43,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:15:43,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:43,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:15:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:15:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:15:43,456 INFO L87 Difference]: Start difference. First operand 3318 states and 7706 transitions. Second operand 11 states. [2018-12-03 15:15:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:53,453 INFO L93 Difference]: Finished difference Result 4067 states and 9262 transitions. [2018-12-03 15:15:53,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:15:53,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:15:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:53,459 INFO L225 Difference]: With dead ends: 4067 [2018-12-03 15:15:53,459 INFO L226 Difference]: Without dead ends: 4059 [2018-12-03 15:15:53,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=913, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:15:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4059 states. [2018-12-03 15:15:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4059 to 3390. [2018-12-03 15:15:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3390 states. [2018-12-03 15:15:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 7874 transitions. [2018-12-03 15:15:58,935 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 7874 transitions. Word has length 20 [2018-12-03 15:15:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:58,935 INFO L480 AbstractCegarLoop]: Abstraction has 3390 states and 7874 transitions. [2018-12-03 15:15:58,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:15:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 7874 transitions. [2018-12-03 15:15:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:15:58,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:58,936 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 15:15:58,937 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:58,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash -248100343, now seen corresponding path program 1 times [2018-12-03 15:15:58,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:58,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:58,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:58,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:59,018 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 15:15:59,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:59,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:59,019 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:15:59,019 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [61], [67], [72], [76], [78], [84], [94], [102], [183], [203], [229], [279], [286], [349] [2018-12-03 15:15:59,021 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:15:59,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:15:59,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:15:59,029 INFO L272 AbstractInterpreter]: Visited 18 different actions 29 times. Merged at 9 different actions 9 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:15:59,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:59,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:15:59,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:59,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:59,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:59,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:59,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:59,099 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 15:15:59,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:59,177 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 15:15:59,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:59,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:15:59,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:59,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:15:59,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:15:59,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:15:59,196 INFO L87 Difference]: Start difference. First operand 3390 states and 7874 transitions. Second operand 11 states. [2018-12-03 15:16:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:08,644 INFO L93 Difference]: Finished difference Result 3913 states and 8914 transitions. [2018-12-03 15:16:08,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:16:08,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:16:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:08,650 INFO L225 Difference]: With dead ends: 3913 [2018-12-03 15:16:08,650 INFO L226 Difference]: Without dead ends: 3905 [2018-12-03 15:16:08,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:16:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2018-12-03 15:16:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3398. [2018-12-03 15:16:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2018-12-03 15:16:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 7878 transitions. [2018-12-03 15:16:14,034 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 7878 transitions. Word has length 20 [2018-12-03 15:16:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:14,034 INFO L480 AbstractCegarLoop]: Abstraction has 3398 states and 7878 transitions. [2018-12-03 15:16:14,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:16:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 7878 transitions. [2018-12-03 15:16:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:16:14,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:14,036 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 15:16:14,036 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:14,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash 879416653, now seen corresponding path program 1 times [2018-12-03 15:16:14,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:14,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:14,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:14,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:14,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:14,117 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 15:16:14,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:14,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:14,118 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:16:14,118 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [55], [59], [61], [67], [72], [78], [98], [203], [236], [245], [279], [286], [292], [349] [2018-12-03 15:16:14,119 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:16:14,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:16:14,127 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:16:14,127 INFO L272 AbstractInterpreter]: Visited 17 different actions 28 times. Merged at 9 different actions 9 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:16:14,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:14,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:16:14,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:14,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:14,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:14,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:16:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:14,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:14,190 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 15:16:14,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:14,346 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 15:16:14,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:14,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:16:14,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:14,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:16:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:16:14,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:16:14,367 INFO L87 Difference]: Start difference. First operand 3398 states and 7878 transitions. Second operand 11 states. [2018-12-03 15:16:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:24,189 INFO L93 Difference]: Finished difference Result 3927 states and 8941 transitions. [2018-12-03 15:16:24,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:16:24,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:16:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:24,194 INFO L225 Difference]: With dead ends: 3927 [2018-12-03 15:16:24,194 INFO L226 Difference]: Without dead ends: 3919 [2018-12-03 15:16:24,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:16:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2018-12-03 15:16:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3287. [2018-12-03 15:16:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3287 states. [2018-12-03 15:16:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 7609 transitions. [2018-12-03 15:16:29,451 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 7609 transitions. Word has length 20 [2018-12-03 15:16:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:29,452 INFO L480 AbstractCegarLoop]: Abstraction has 3287 states and 7609 transitions. [2018-12-03 15:16:29,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:16:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 7609 transitions. [2018-12-03 15:16:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:16:29,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:29,453 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 15:16:29,453 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:29,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:29,454 INFO L82 PathProgramCache]: Analyzing trace with hash 879518798, now seen corresponding path program 1 times [2018-12-03 15:16:29,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:29,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:29,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:29,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:29,537 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 15:16:29,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:29,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:29,537 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:16:29,538 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [55], [59], [61], [67], [72], [78], [102], [183], [203], [229], [279], [286], [292], [349] [2018-12-03 15:16:29,538 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:16:29,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:16:29,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:16:29,546 INFO L272 AbstractInterpreter]: Visited 17 different actions 27 times. Merged at 8 different actions 8 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:16:29,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:29,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:16:29,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:29,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:29,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:29,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:16:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:29,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:29,600 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 15:16:29,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:29,680 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 15:16:29,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:29,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:16:29,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:29,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:16:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:16:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:16:29,701 INFO L87 Difference]: Start difference. First operand 3287 states and 7609 transitions. Second operand 11 states. [2018-12-03 15:16:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:39,509 INFO L93 Difference]: Finished difference Result 3927 states and 8925 transitions. [2018-12-03 15:16:39,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:16:39,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:16:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:39,515 INFO L225 Difference]: With dead ends: 3927 [2018-12-03 15:16:39,515 INFO L226 Difference]: Without dead ends: 3919 [2018-12-03 15:16:39,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:16:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2018-12-03 15:16:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3255. [2018-12-03 15:16:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2018-12-03 15:16:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 7545 transitions. [2018-12-03 15:16:44,812 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 7545 transitions. Word has length 20 [2018-12-03 15:16:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:44,813 INFO L480 AbstractCegarLoop]: Abstraction has 3255 states and 7545 transitions. [2018-12-03 15:16:44,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:16:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 7545 transitions. [2018-12-03 15:16:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:16:44,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:44,815 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:16:44,815 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:44,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:44,815 INFO L82 PathProgramCache]: Analyzing trace with hash 987368945, now seen corresponding path program 1 times [2018-12-03 15:16:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:44,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:44,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:16:44,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:44,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:44,950 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 15:16:44,950 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [61], [67], [72], [78], [174], [183], [203], [279], [283], [286], [349] [2018-12-03 15:16:44,951 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:16:44,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:16:44,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:16:44,957 INFO L272 AbstractInterpreter]: Visited 15 different actions 21 times. Merged at 5 different actions 5 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:16:44,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:44,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:16:44,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:44,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:44,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:44,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:16:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:44,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:16:45,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:16:45,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:45,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:16:45,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:45,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:16:45,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:16:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:16:45,101 INFO L87 Difference]: Start difference. First operand 3255 states and 7545 transitions. Second operand 11 states. [2018-12-03 15:16:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:54,595 INFO L93 Difference]: Finished difference Result 3749 states and 8537 transitions. [2018-12-03 15:16:54,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:16:54,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:16:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:54,599 INFO L225 Difference]: With dead ends: 3749 [2018-12-03 15:16:54,600 INFO L226 Difference]: Without dead ends: 3741 [2018-12-03 15:16:54,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:16:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2018-12-03 15:16:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3159. [2018-12-03 15:16:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2018-12-03 15:16:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 7307 transitions. [2018-12-03 15:16:59,803 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 7307 transitions. Word has length 20 [2018-12-03 15:16:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:59,803 INFO L480 AbstractCegarLoop]: Abstraction has 3159 states and 7307 transitions. [2018-12-03 15:16:59,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:16:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 7307 transitions. [2018-12-03 15:16:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:16:59,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:59,805 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:16:59,805 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:59,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -461254251, now seen corresponding path program 1 times [2018-12-03 15:16:59,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:59,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:59,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:59,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:59,924 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 15:16:59,924 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [76], [84], [92], [251], [317], [323], [331], [333], [337], [339], [345], [351] [2018-12-03 15:16:59,924 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:16:59,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:16:59,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:16:59,940 INFO L272 AbstractInterpreter]: Visited 15 different actions 26 times. Merged at 10 different actions 10 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:16:59,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:59,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:16:59,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:59,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:59,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:59,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:16:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:00,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:17:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:00,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:17:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:00,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:17:00,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2018-12-03 15:17:00,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:17:00,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:17:00,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:17:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:17:00,236 INFO L87 Difference]: Start difference. First operand 3159 states and 7307 transitions. Second operand 16 states. [2018-12-03 15:17:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:17:23,297 INFO L93 Difference]: Finished difference Result 7375 states and 16617 transitions. [2018-12-03 15:17:23,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:17:23,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-03 15:17:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:17:23,305 INFO L225 Difference]: With dead ends: 7375 [2018-12-03 15:17:23,305 INFO L226 Difference]: Without dead ends: 7367 [2018-12-03 15:17:23,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1282, Invalid=5524, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:17:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2018-12-03 15:17:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 4599. [2018-12-03 15:17:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2018-12-03 15:17:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 10707 transitions. [2018-12-03 15:17:31,765 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 10707 transitions. Word has length 21 [2018-12-03 15:17:31,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:17:31,766 INFO L480 AbstractCegarLoop]: Abstraction has 4599 states and 10707 transitions. [2018-12-03 15:17:31,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:17:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 10707 transitions. [2018-12-03 15:17:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:17:31,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:17:31,768 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:17:31,768 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:17:31,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:17:31,769 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-12-03 15:17:31,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:17:31,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:31,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:17:31,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:31,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:17:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:32,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:32,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:17:32,135 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:17:32,135 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [113], [120], [122], [128], [132], [199], [203], [207], [224], [236], [245], [247], [254], [260], [274], [349] [2018-12-03 15:17:32,136 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:17:32,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:17:32,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:17:32,145 INFO L272 AbstractInterpreter]: Visited 21 different actions 32 times. Merged at 9 different actions 9 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:17:32,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:17:32,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:17:32,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:32,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:17:32,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:17:32,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:17:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:32,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:17:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:32,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:17:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:32,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:17:32,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2018-12-03 15:17:32,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:17:32,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:17:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:17:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:17:32,498 INFO L87 Difference]: Start difference. First operand 4599 states and 10707 transitions. Second operand 18 states. [2018-12-03 15:18:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:18:05,676 INFO L93 Difference]: Finished difference Result 14286 states and 33130 transitions. [2018-12-03 15:18:05,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 15:18:05,677 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-12-03 15:18:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:18:05,688 INFO L225 Difference]: With dead ends: 14286 [2018-12-03 15:18:05,688 INFO L226 Difference]: Without dead ends: 9688 [2018-12-03 15:18:05,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4492 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1570, Invalid=12472, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:18:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2018-12-03 15:18:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 5855. [2018-12-03 15:18:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5855 states. [2018-12-03 15:18:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5855 states to 5855 states and 13668 transitions. [2018-12-03 15:18:17,123 INFO L78 Accepts]: Start accepts. Automaton has 5855 states and 13668 transitions. Word has length 24 [2018-12-03 15:18:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:18:17,123 INFO L480 AbstractCegarLoop]: Abstraction has 5855 states and 13668 transitions. [2018-12-03 15:18:17,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:18:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5855 states and 13668 transitions. [2018-12-03 15:18:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:18:17,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:18:17,126 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, 1, 1, 1, 1] [2018-12-03 15:18:17,126 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:18:17,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:18:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 509499548, now seen corresponding path program 1 times [2018-12-03 15:18:17,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:18:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:17,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:18:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:17,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:18:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:18:17,215 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 15:18:17,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:17,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:18:17,216 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:18:17,216 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [92], [102], [104], [110], [113], [115], [120], [128], [132], [186], [192], [203], [229], [236], [245], [254], [260], [274], [292], [349] [2018-12-03 15:18:17,217 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:18:17,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:18:17,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:18:17,237 INFO L272 AbstractInterpreter]: Visited 24 different actions 42 times. Merged at 13 different actions 15 times. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:18:17,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:18:17,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:18:17,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:17,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:18:17,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:18:17,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:18:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:18:17,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:18:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:18:17,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:18:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:18:17,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:18:17,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2018-12-03 15:18:17,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:18:17,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:18:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:18:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:18:17,662 INFO L87 Difference]: Start difference. First operand 5855 states and 13668 transitions. Second operand 19 states. [2018-12-03 15:18:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:18:53,975 INFO L93 Difference]: Finished difference Result 16129 states and 37112 transitions. [2018-12-03 15:18:53,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:18:53,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 15:18:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:18:53,988 INFO L225 Difference]: With dead ends: 16129 [2018-12-03 15:18:53,989 INFO L226 Difference]: Without dead ends: 10275 [2018-12-03 15:18:53,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3187 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1141, Invalid=9989, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:18:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2018-12-03 15:19:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 5769. [2018-12-03 15:19:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-12-03 15:19:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 13438 transitions. [2018-12-03 15:19:05,706 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 13438 transitions. Word has length 24 [2018-12-03 15:19:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:19:05,706 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 13438 transitions. [2018-12-03 15:19:05,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:19:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 13438 transitions. [2018-12-03 15:19:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:19:05,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:19:05,709 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, 1, 1, 1, 1] [2018-12-03 15:19:05,709 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:19:05,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:05,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1404455971, now seen corresponding path program 1 times [2018-12-03 15:19:05,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:19:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:05,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:05,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:19:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:05,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:05,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:19:05,921 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:19:05,921 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [94], [98], [104], [110], [113], [115], [120], [128], [132], [179], [203], [217], [236], [245], [260], [274], [292], [298], [310], [349] [2018-12-03 15:19:05,922 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:19:05,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:19:05,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:19:05,935 INFO L272 AbstractInterpreter]: Visited 24 different actions 45 times. Merged at 12 different actions 16 times. Never widened. Found 8 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 15:19:05,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:05,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:19:05,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:05,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:19:05,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:05,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:19:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:05,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:19:06,178 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 15:19:06,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:19:06,325 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 15:19:06,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:19:06,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2018-12-03 15:19:06,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:19:06,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:19:06,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:19:06,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:19:06,346 INFO L87 Difference]: Start difference. First operand 5769 states and 13438 transitions. Second operand 19 states. [2018-12-03 15:19:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:19:40,117 INFO L93 Difference]: Finished difference Result 14938 states and 34438 transitions. [2018-12-03 15:19:40,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:19:40,117 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 15:19:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:19:40,128 INFO L225 Difference]: With dead ends: 14938 [2018-12-03 15:19:40,128 INFO L226 Difference]: Without dead ends: 9170 [2018-12-03 15:19:40,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1084, Invalid=8228, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:19:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9170 states. [2018-12-03 15:19:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9170 to 5949. [2018-12-03 15:19:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5949 states. [2018-12-03 15:19:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5949 states to 5949 states and 13878 transitions. [2018-12-03 15:19:52,614 INFO L78 Accepts]: Start accepts. Automaton has 5949 states and 13878 transitions. Word has length 24 [2018-12-03 15:19:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:19:52,614 INFO L480 AbstractCegarLoop]: Abstraction has 5949 states and 13878 transitions. [2018-12-03 15:19:52,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:19:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5949 states and 13878 transitions. [2018-12-03 15:19:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:19:52,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:19:52,617 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:19:52,617 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:19:52,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash -263596200, now seen corresponding path program 1 times [2018-12-03 15:19:52,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:19:52,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:52,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:52,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:52,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:19:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:52,753 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 15:19:52,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:52,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:19:52,753 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:19:52,753 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [94], [102], [113], [115], [120], [128], [132], [179], [183], [203], [217], [229], [260], [274], [298], [300], [310], [349] [2018-12-03 15:19:52,754 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:19:52,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:19:52,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:19:52,767 INFO L272 AbstractInterpreter]: Visited 22 different actions 44 times. Merged at 13 different actions 19 times. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:19:52,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:52,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:19:52,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:52,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:19:52,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:52,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:19:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:52,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:19:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:53,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:19:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:53,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:19:53,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2018-12-03 15:19:53,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:19:53,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:19:53,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:19:53,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:19:53,207 INFO L87 Difference]: Start difference. First operand 5949 states and 13878 transitions. Second operand 20 states. [2018-12-03 15:20:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:22,042 INFO L93 Difference]: Finished difference Result 14210 states and 32884 transitions. [2018-12-03 15:20:22,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:20:22,042 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-03 15:20:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:22,052 INFO L225 Difference]: With dead ends: 14210 [2018-12-03 15:20:22,052 INFO L226 Difference]: Without dead ends: 8262 [2018-12-03 15:20:22,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=804, Invalid=5358, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:20:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8262 states. [2018-12-03 15:20:34,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8262 to 5994. [2018-12-03 15:20:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-03 15:20:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13948 transitions. [2018-12-03 15:20:34,450 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13948 transitions. Word has length 24 [2018-12-03 15:20:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:34,450 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13948 transitions. [2018-12-03 15:20:34,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:20:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13948 transitions. [2018-12-03 15:20:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:20:34,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:34,453 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:20:34,453 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:34,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash 792000147, now seen corresponding path program 1 times [2018-12-03 15:20:34,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:34,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:34,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:34,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:34,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:34,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:34,964 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:20:34,964 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [113], [120], [128], [134], [142], [144], [148], [155], [162], [168], [203], [236], [245], [254], [260], [264], [274], [349] [2018-12-03 15:20:34,965 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:20:34,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:20:34,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:20:34,981 INFO L272 AbstractInterpreter]: Visited 23 different actions 45 times. Merged at 14 different actions 19 times. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:20:34,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:34,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:20:34,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:34,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:35,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:20:35,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:20:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:35,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:35,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:35,742 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 15:20:35,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:35,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 15:20:35,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:35,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:20:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:20:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:20:35,762 INFO L87 Difference]: Start difference. First operand 5994 states and 13948 transitions. Second operand 19 states. [2018-12-03 15:21:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:11,992 INFO L93 Difference]: Finished difference Result 17571 states and 41216 transitions. [2018-12-03 15:21:11,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:21:11,992 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 15:21:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:12,077 INFO L225 Difference]: With dead ends: 17571 [2018-12-03 15:21:12,077 INFO L226 Difference]: Without dead ends: 11578 [2018-12-03 15:21:12,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=810, Invalid=6162, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:21:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11578 states. [2018-12-03 15:21:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11578 to 6512. [2018-12-03 15:21:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2018-12-03 15:21:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 15245 transitions. [2018-12-03 15:21:25,353 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 15245 transitions. Word has length 24 [2018-12-03 15:21:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:25,353 INFO L480 AbstractCegarLoop]: Abstraction has 6512 states and 15245 transitions. [2018-12-03 15:21:25,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:21:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 15245 transitions. [2018-12-03 15:21:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:21:25,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:25,356 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:21:25,356 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:25,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2113109391, now seen corresponding path program 1 times [2018-12-03 15:21:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:25,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:25,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:25,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:25,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:25,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:25,476 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 15:21:25,476 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [94], [98], [113], [120], [128], [134], [138], [142], [155], [162], [168], [203], [236], [245], [260], [264], [274], [300], [349] [2018-12-03 15:21:25,476 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:25,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:25,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:25,490 INFO L272 AbstractInterpreter]: Visited 23 different actions 46 times. Merged at 14 different actions 20 times. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 15:21:25,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:25,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:25,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:25,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:25,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:25,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:25,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:25,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:26,264 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 15:21:26,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:26,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2018-12-03 15:21:26,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:26,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:21:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:21:26,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:21:26,285 INFO L87 Difference]: Start difference. First operand 6512 states and 15245 transitions. Second operand 20 states.