java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:13:29,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:13:29,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:13:29,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:13:29,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:13:29,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:13:29,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:13:29,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:13:29,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:13:29,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:13:29,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:13:29,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:13:29,826 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:13:29,827 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:13:29,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:13:29,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:13:29,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:13:29,832 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:13:29,834 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:13:29,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:13:29,837 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:13:29,838 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:13:29,841 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:13:29,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:13:29,841 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:13:29,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:13:29,843 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:13:29,844 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:13:29,845 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:13:29,846 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:13:29,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:13:29,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:13:29,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:13:29,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:13:29,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:13:29,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:13:29,850 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:13:29,866 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:13:29,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:13:29,867 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:13:29,867 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:13:29,867 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:13:29,867 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:13:29,868 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:13:29,868 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:13:29,868 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:13:29,868 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:13:29,868 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:13:29,869 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:13:29,869 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:13:29,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:13:29,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:13:29,870 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:13:29,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:13:29,870 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:13:29,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:13:29,872 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:13:29,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:13:29,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:13:29,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:13:29,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:13:29,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:13:29,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:13:29,874 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:13:29,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:13:29,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:13:29,875 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:13:29,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:29,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:13:29,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:13:29,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:13:29,876 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:13:29,876 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:13:29,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:13:29,877 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:13:29,877 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:13:29,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:13:29,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:13:29,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:13:29,953 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:13:29,954 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:13:29,955 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-12-03 17:13:29,955 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-12-03 17:13:30,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:13:30,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:13:30,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:30,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:13:30,047 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:13:30,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,090 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:13:30,091 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:13:30,091 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:13:30,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:30,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:13:30,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:13:30,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:13:30,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... [2018-12-03 17:13:30,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:13:30,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:13:30,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:13:30,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:13:30,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:30,222 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 17:13:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 17:13:30,223 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 17:13:31,127 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:13:31,127 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:13:31,128 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:31 BoogieIcfgContainer [2018-12-03 17:13:31,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:13:31,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:13:31,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:13:31,132 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:13:31,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:30" (1/2) ... [2018-12-03 17:13:31,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3d799e and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:13:31, skipping insertion in model container [2018-12-03 17:13:31,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:31" (2/2) ... [2018-12-03 17:13:31,136 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-12-03 17:13:31,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:13:31,155 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-12-03 17:13:31,173 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-12-03 17:13:31,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:13:31,210 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:13:31,211 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:13:31,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:13:31,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:13:31,211 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:13:31,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:13:31,211 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:13:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-03 17:13:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:13:31,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:31,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:31,243 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:31,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:31,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-12-03 17:13:31,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:31,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:31,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:31,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:31,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:13:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:13:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:13:31,610 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-12-03 17:13:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:33,450 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-12-03 17:13:33,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:13:33,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 17:13:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:33,469 INFO L225 Difference]: With dead ends: 163 [2018-12-03 17:13:33,470 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 17:13:33,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 17:13:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-12-03 17:13:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:13:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-12-03 17:13:33,535 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-12-03 17:13:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:33,536 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-12-03 17:13:33,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:13:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-12-03 17:13:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:13:33,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:33,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:33,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:33,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-12-03 17:13:33,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:33,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:33,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:33,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:33,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:33,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:33,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:33,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:13:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:13:33,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:13:33,649 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-12-03 17:13:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:34,475 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-12-03 17:13:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:13:34,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 17:13:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:34,482 INFO L225 Difference]: With dead ends: 188 [2018-12-03 17:13:34,482 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 17:13:34,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 17:13:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-12-03 17:13:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 17:13:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-12-03 17:13:34,519 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-12-03 17:13:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:34,519 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-12-03 17:13:34,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:13:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-12-03 17:13:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:13:34,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:34,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:34,525 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:34,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-12-03 17:13:34,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:34,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:34,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:34,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 17:13:34,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:34,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:13:34,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:34,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:34,620 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-12-03 17:13:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:36,082 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-12-03 17:13:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:13:36,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 17:13:36,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:36,086 INFO L225 Difference]: With dead ends: 283 [2018-12-03 17:13:36,086 INFO L226 Difference]: Without dead ends: 278 [2018-12-03 17:13:36,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:13:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-03 17:13:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-12-03 17:13:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 17:13:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-12-03 17:13:36,117 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-12-03 17:13:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:36,118 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-12-03 17:13:36,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-12-03 17:13:36,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:13:36,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:36,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:36,120 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:36,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:36,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-12-03 17:13:36,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:36,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:36,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:13:36,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:36,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:13:36,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:13:36,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:13:36,239 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-12-03 17:13:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:37,901 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-12-03 17:13:37,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:13:37,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 17:13:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:37,905 INFO L225 Difference]: With dead ends: 387 [2018-12-03 17:13:37,906 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 17:13:37,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 17:13:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-12-03 17:13:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 17:13:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-12-03 17:13:37,956 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-12-03 17:13:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:37,957 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-12-03 17:13:37,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:13:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-12-03 17:13:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:37,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:37,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:37,963 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:37,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:37,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-12-03 17:13:37,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:37,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:37,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:37,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:37,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:38,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:38,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:38,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:38,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:38,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:38,258 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-12-03 17:13:39,577 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:13:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:42,999 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-12-03 17:13:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:13:43,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:13:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:43,006 INFO L225 Difference]: With dead ends: 725 [2018-12-03 17:13:43,006 INFO L226 Difference]: Without dead ends: 717 [2018-12-03 17:13:43,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:13:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-12-03 17:13:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-12-03 17:13:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 17:13:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-12-03 17:13:43,076 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-12-03 17:13:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:43,076 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-12-03 17:13:43,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:13:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-12-03 17:13:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:43,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:43,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:43,079 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:43,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-12-03 17:13:43,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:43,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:43,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:43,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:43,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:43,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:43,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:43,187 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-12-03 17:13:45,964 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 17:13:46,917 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:13:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:49,420 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-12-03 17:13:49,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:13:49,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:13:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:49,428 INFO L225 Difference]: With dead ends: 1008 [2018-12-03 17:13:49,428 INFO L226 Difference]: Without dead ends: 1000 [2018-12-03 17:13:49,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:13:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-12-03 17:13:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-12-03 17:13:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 17:13:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-12-03 17:13:49,494 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-12-03 17:13:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:49,494 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-12-03 17:13:49,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:13:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-12-03 17:13:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:49,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:49,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:49,497 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:49,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-12-03 17:13:49,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:49,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:49,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:49,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:49,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:49,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:49,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:49,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:49,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:49,599 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-12-03 17:13:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:52,217 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-12-03 17:13:52,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:13:52,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:13:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:52,225 INFO L225 Difference]: With dead ends: 924 [2018-12-03 17:13:52,225 INFO L226 Difference]: Without dead ends: 916 [2018-12-03 17:13:52,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:13:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-12-03 17:13:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-12-03 17:13:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-12-03 17:13:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-12-03 17:13:52,323 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-12-03 17:13:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:52,323 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-12-03 17:13:52,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:13:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-12-03 17:13:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:52,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:52,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:52,325 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:52,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-12-03 17:13:52,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:52,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:52,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:52,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:52,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:52,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:52,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:52,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:52,487 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-12-03 17:13:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:54,327 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-12-03 17:13:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:13:54,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:13:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:54,332 INFO L225 Difference]: With dead ends: 791 [2018-12-03 17:13:54,333 INFO L226 Difference]: Without dead ends: 783 [2018-12-03 17:13:54,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-03 17:13:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-12-03 17:13:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-03 17:13:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-12-03 17:13:54,421 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-12-03 17:13:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:54,421 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-12-03 17:13:54,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:13:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-12-03 17:13:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:54,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:54,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:54,423 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:54,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-12-03 17:13:54,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:54,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:54,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:54,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:54,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:54,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:54,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:54,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:54,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:54,512 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-12-03 17:13:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:56,730 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-12-03 17:13:56,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:13:56,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:13:56,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:56,737 INFO L225 Difference]: With dead ends: 1040 [2018-12-03 17:13:56,737 INFO L226 Difference]: Without dead ends: 1032 [2018-12-03 17:13:56,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:13:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-12-03 17:13:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-12-03 17:13:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-03 17:13:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-12-03 17:13:56,862 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-12-03 17:13:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:56,862 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-12-03 17:13:56,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:13:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-12-03 17:13:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:56,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:56,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:56,864 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:56,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-12-03 17:13:56,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:56,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:56,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:56,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:56,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:56,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:56,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:13:56,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:56,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:56,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:56,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:13:56,952 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-12-03 17:13:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:59,717 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-12-03 17:13:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:13:59,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:13:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:59,724 INFO L225 Difference]: With dead ends: 1166 [2018-12-03 17:13:59,725 INFO L226 Difference]: Without dead ends: 1158 [2018-12-03 17:13:59,726 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 17:13:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-12-03 17:13:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-12-03 17:13:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-12-03 17:13:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-12-03 17:13:59,897 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-12-03 17:13:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:59,898 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-12-03 17:13:59,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:13:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-12-03 17:13:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:13:59,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:59,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:59,899 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:59,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:59,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-12-03 17:13:59,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:59,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:59,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:59,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:59,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:00,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 17:14:00,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:00,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:00,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:00,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:00,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:00,292 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-12-03 17:14:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:02,955 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-12-03 17:14:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:14:02,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:02,961 INFO L225 Difference]: With dead ends: 1127 [2018-12-03 17:14:02,962 INFO L226 Difference]: Without dead ends: 1119 [2018-12-03 17:14:02,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:14:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-03 17:14:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-12-03 17:14:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-03 17:14:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-12-03 17:14:03,101 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-12-03 17:14:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:03,101 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-12-03 17:14:03,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-12-03 17:14:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:03,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:03,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:03,103 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:03,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:03,103 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-12-03 17:14:03,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:03,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:03,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:03,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:03,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:03,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:03,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:03,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:03,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:03,207 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-12-03 17:14:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:05,562 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-12-03 17:14:05,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:14:05,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:05,569 INFO L225 Difference]: With dead ends: 975 [2018-12-03 17:14:05,569 INFO L226 Difference]: Without dead ends: 967 [2018-12-03 17:14:05,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:14:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-12-03 17:14:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-12-03 17:14:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-03 17:14:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-12-03 17:14:05,736 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-12-03 17:14:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:05,738 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-12-03 17:14:05,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-12-03 17:14:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:05,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:05,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:05,739 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:05,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-12-03 17:14:05,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:05,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:05,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:05,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:05,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:05,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:05,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:05,852 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-12-03 17:14:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:08,607 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-12-03 17:14:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:14:08,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:08,612 INFO L225 Difference]: With dead ends: 1011 [2018-12-03 17:14:08,612 INFO L226 Difference]: Without dead ends: 1003 [2018-12-03 17:14:08,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:14:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-12-03 17:14:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-12-03 17:14:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-03 17:14:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-12-03 17:14:08,813 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-12-03 17:14:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:08,814 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-12-03 17:14:08,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-12-03 17:14:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:08,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:08,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:08,815 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:08,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-12-03 17:14:08,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:08,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:08,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:08,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:08,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:08,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:08,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:08,901 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-12-03 17:14:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:10,921 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-12-03 17:14:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:14:10,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 17:14:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:10,929 INFO L225 Difference]: With dead ends: 859 [2018-12-03 17:14:10,929 INFO L226 Difference]: Without dead ends: 851 [2018-12-03 17:14:10,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:14:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-12-03 17:14:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-12-03 17:14:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 17:14:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-12-03 17:14:11,095 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-12-03 17:14:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:11,095 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-12-03 17:14:11,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-12-03 17:14:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:11,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:11,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:11,096 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:11,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-12-03 17:14:11,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:11,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:11,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:11,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:11,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:11,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:11,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:11,174 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-12-03 17:14:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:13,476 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-12-03 17:14:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:14:13,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:13,483 INFO L225 Difference]: With dead ends: 962 [2018-12-03 17:14:13,483 INFO L226 Difference]: Without dead ends: 954 [2018-12-03 17:14:13,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:14:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-03 17:14:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-12-03 17:14:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-12-03 17:14:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-12-03 17:14:13,732 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-12-03 17:14:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:13,732 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-12-03 17:14:13,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-12-03 17:14:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:13,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:13,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:13,733 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:13,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-12-03 17:14:13,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:13,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:13,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:13,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:13,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:13,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:13,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:13,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:13,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:13,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:13,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:13,819 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-12-03 17:14:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:16,418 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-12-03 17:14:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:14:16,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:16,424 INFO L225 Difference]: With dead ends: 1064 [2018-12-03 17:14:16,424 INFO L226 Difference]: Without dead ends: 1056 [2018-12-03 17:14:16,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:14:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-12-03 17:14:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-12-03 17:14:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-12-03 17:14:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-12-03 17:14:16,745 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-12-03 17:14:16,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:16,746 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-12-03 17:14:16,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-12-03 17:14:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:16,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:16,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:16,747 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:16,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:16,748 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-12-03 17:14:16,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:16,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:16,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:16,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:16,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:16,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:16,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:16,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:16,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:16,839 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-12-03 17:14:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:20,109 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-12-03 17:14:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:14:20,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:20,114 INFO L225 Difference]: With dead ends: 1241 [2018-12-03 17:14:20,114 INFO L226 Difference]: Without dead ends: 1233 [2018-12-03 17:14:20,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:14:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-03 17:14:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-12-03 17:14:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 17:14:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-12-03 17:14:20,443 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-12-03 17:14:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:20,444 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-12-03 17:14:20,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-12-03 17:14:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:20,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:20,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:20,445 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:20,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-12-03 17:14:20,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:20,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:20,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:20,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:20,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:20,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:20,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:20,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:20,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:20,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:20,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:20,530 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-12-03 17:14:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:22,930 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-12-03 17:14:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:22,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:22,936 INFO L225 Difference]: With dead ends: 1139 [2018-12-03 17:14:22,936 INFO L226 Difference]: Without dead ends: 1131 [2018-12-03 17:14:22,937 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 17:14:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-12-03 17:14:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-12-03 17:14:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-12-03 17:14:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-12-03 17:14:23,275 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-12-03 17:14:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:23,275 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-12-03 17:14:23,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-12-03 17:14:23,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:23,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:23,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:23,277 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:23,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:23,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-12-03 17:14:23,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:23,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:23,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:23,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:23,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:23,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:23,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:23,343 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-12-03 17:14:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:26,356 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-12-03 17:14:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:14:26,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:26,362 INFO L225 Difference]: With dead ends: 1325 [2018-12-03 17:14:26,362 INFO L226 Difference]: Without dead ends: 1317 [2018-12-03 17:14:26,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:14:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-12-03 17:14:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-12-03 17:14:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-12-03 17:14:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-12-03 17:14:26,696 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-12-03 17:14:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:26,696 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-12-03 17:14:26,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-12-03 17:14:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:26,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:26,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:26,697 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:26,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:26,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-12-03 17:14:26,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:26,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:26,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:26,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:27,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:27,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:27,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:27,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:27,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:27,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:27,006 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-12-03 17:14:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:30,528 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-12-03 17:14:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:30,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:30,534 INFO L225 Difference]: With dead ends: 1334 [2018-12-03 17:14:30,534 INFO L226 Difference]: Without dead ends: 1326 [2018-12-03 17:14:30,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:14:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-12-03 17:14:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-12-03 17:14:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-12-03 17:14:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-12-03 17:14:30,878 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-12-03 17:14:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:30,878 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-12-03 17:14:30,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-12-03 17:14:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:30,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:30,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:30,879 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:30,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-12-03 17:14:30,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:30,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:30,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:30,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:30,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:30,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:30,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:30,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:30,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:30,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:30,953 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-12-03 17:14:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:32,976 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-12-03 17:14:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:32,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:32,981 INFO L225 Difference]: With dead ends: 919 [2018-12-03 17:14:32,982 INFO L226 Difference]: Without dead ends: 911 [2018-12-03 17:14:32,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:14:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-12-03 17:14:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-12-03 17:14:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 17:14:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-12-03 17:14:33,356 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-12-03 17:14:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:33,356 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-12-03 17:14:33,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-12-03 17:14:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:33,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:33,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:33,357 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:33,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-12-03 17:14:33,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:33,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:33,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:33,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:33,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:33,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:33,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:33,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:33,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:33,435 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-12-03 17:14:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:36,119 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-12-03 17:14:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:14:36,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:36,127 INFO L225 Difference]: With dead ends: 1095 [2018-12-03 17:14:36,127 INFO L226 Difference]: Without dead ends: 1087 [2018-12-03 17:14:36,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:14:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-12-03 17:14:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-12-03 17:14:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-03 17:14:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-12-03 17:14:36,491 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-12-03 17:14:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:36,491 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-12-03 17:14:36,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-12-03 17:14:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:36,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:36,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:36,492 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:36,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-12-03 17:14:36,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:36,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:36,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:36,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:36,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:36,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:36,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:36,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:36,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:36,560 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-12-03 17:14:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:40,547 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-12-03 17:14:40,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:14:40,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:40,551 INFO L225 Difference]: With dead ends: 1304 [2018-12-03 17:14:40,551 INFO L226 Difference]: Without dead ends: 1296 [2018-12-03 17:14:40,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:14:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-12-03 17:14:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-12-03 17:14:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-03 17:14:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-12-03 17:14:40,927 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-12-03 17:14:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:40,927 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-12-03 17:14:40,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-12-03 17:14:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:40,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:40,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:40,929 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:40,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:40,929 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-12-03 17:14:40,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:40,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:40,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:40,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:40,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:40,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:41,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:41,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:41,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:41,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:41,001 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-12-03 17:14:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:44,404 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-12-03 17:14:44,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:14:44,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 17:14:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:44,407 INFO L225 Difference]: With dead ends: 1192 [2018-12-03 17:14:44,407 INFO L226 Difference]: Without dead ends: 1184 [2018-12-03 17:14:44,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:14:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-12-03 17:14:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-12-03 17:14:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 17:14:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-12-03 17:14:44,882 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-12-03 17:14:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:44,882 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-12-03 17:14:44,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-12-03 17:14:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:44,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:44,883 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:44,883 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:44,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-12-03 17:14:44,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:44,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:44,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:44,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:44,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:44,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:44,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:14:44,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:44,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:14:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:14:44,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:14:44,932 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-12-03 17:14:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:45,751 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-12-03 17:14:45,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:14:45,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 17:14:45,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:45,752 INFO L225 Difference]: With dead ends: 1139 [2018-12-03 17:14:45,753 INFO L226 Difference]: Without dead ends: 625 [2018-12-03 17:14:45,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-12-03 17:14:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-12-03 17:14:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 17:14:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-12-03 17:14:46,228 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-12-03 17:14:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:46,228 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-12-03 17:14:46,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:14:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-12-03 17:14:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:14:46,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:46,229 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:46,229 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:46,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-12-03 17:14:46,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:46,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:46,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:46,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:46,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:46,304 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 17:14:46,306 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [132], [251], [252], [337], [345], [351] [2018-12-03 17:14:46,359 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:46,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:46,795 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:46,797 INFO L272 AbstractInterpreter]: Visited 11 different actions 36 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:46,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:46,840 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:46,931 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 55.44% of their original sizes. [2018-12-03 17:14:46,931 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:47,118 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 17:14:47,118 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:47,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:47,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-12-03 17:14:47,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:47,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:47,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:47,120 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 9 states. [2018-12-03 17:14:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:52,116 INFO L93 Difference]: Finished difference Result 915 states and 2147 transitions. [2018-12-03 17:14:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:14:52,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-12-03 17:14:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:52,119 INFO L225 Difference]: With dead ends: 915 [2018-12-03 17:14:52,120 INFO L226 Difference]: Without dead ends: 910 [2018-12-03 17:14:52,121 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:14:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-12-03 17:14:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 715. [2018-12-03 17:14:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-12-03 17:14:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1688 transitions. [2018-12-03 17:14:53,195 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1688 transitions. Word has length 13 [2018-12-03 17:14:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:53,195 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1688 transitions. [2018-12-03 17:14:53,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1688 transitions. [2018-12-03 17:14:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:14:53,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:53,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:53,197 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:53,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-12-03 17:14:53,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:53,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:53,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:53,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:53,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:53,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:53,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:53,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:53,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:53,281 INFO L87 Difference]: Start difference. First operand 715 states and 1688 transitions. Second operand 8 states. [2018-12-03 17:14:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:59,287 INFO L93 Difference]: Finished difference Result 2192 states and 4977 transitions. [2018-12-03 17:14:59,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:14:59,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:14:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:59,292 INFO L225 Difference]: With dead ends: 2192 [2018-12-03 17:14:59,292 INFO L226 Difference]: Without dead ends: 2184 [2018-12-03 17:14:59,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:14:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2018-12-03 17:15:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 934. [2018-12-03 17:15:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2018-12-03 17:15:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2191 transitions. [2018-12-03 17:15:00,295 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2191 transitions. Word has length 16 [2018-12-03 17:15:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:00,295 INFO L480 AbstractCegarLoop]: Abstraction has 934 states and 2191 transitions. [2018-12-03 17:15:00,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2191 transitions. [2018-12-03 17:15:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:00,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:00,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:00,297 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:00,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-12-03 17:15:00,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:00,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:00,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:00,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:00,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:00,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:00,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:15:00,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:00,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:00,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:00,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:00,419 INFO L87 Difference]: Start difference. First operand 934 states and 2191 transitions. Second operand 8 states. [2018-12-03 17:15:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:05,683 INFO L93 Difference]: Finished difference Result 2340 states and 5305 transitions. [2018-12-03 17:15:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:15:05,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:05,690 INFO L225 Difference]: With dead ends: 2340 [2018-12-03 17:15:05,690 INFO L226 Difference]: Without dead ends: 2332 [2018-12-03 17:15:05,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:15:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2018-12-03 17:15:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 966. [2018-12-03 17:15:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-12-03 17:15:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2273 transitions. [2018-12-03 17:15:06,723 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2273 transitions. Word has length 16 [2018-12-03 17:15:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:06,723 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2273 transitions. [2018-12-03 17:15:06,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2273 transitions. [2018-12-03 17:15:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:06,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:06,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 17:15:06,724 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:06,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-12-03 17:15:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:06,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:06,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:06,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:06,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:15:06,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:06,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:06,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:06,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:06,932 INFO L87 Difference]: Start difference. First operand 966 states and 2273 transitions. Second operand 8 states. [2018-12-03 17:15:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:11,372 INFO L93 Difference]: Finished difference Result 2042 states and 4629 transitions. [2018-12-03 17:15:11,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:15:11,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:11,379 INFO L225 Difference]: With dead ends: 2042 [2018-12-03 17:15:11,380 INFO L226 Difference]: Without dead ends: 2034 [2018-12-03 17:15:11,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:15:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2018-12-03 17:15:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 966. [2018-12-03 17:15:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-12-03 17:15:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2267 transitions. [2018-12-03 17:15:12,609 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2267 transitions. Word has length 16 [2018-12-03 17:15:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:12,610 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2267 transitions. [2018-12-03 17:15:12,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2267 transitions. [2018-12-03 17:15:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:12,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:12,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:12,611 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:12,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-12-03 17:15:12,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:12,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:12,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:12,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:12,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:15:12,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:12,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:12,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:12,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:12,678 INFO L87 Difference]: Start difference. First operand 966 states and 2267 transitions. Second operand 8 states. [2018-12-03 17:15:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:17,782 INFO L93 Difference]: Finished difference Result 2175 states and 4951 transitions. [2018-12-03 17:15:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:15:17,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:17,785 INFO L225 Difference]: With dead ends: 2175 [2018-12-03 17:15:17,786 INFO L226 Difference]: Without dead ends: 2167 [2018-12-03 17:15:17,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:15:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2018-12-03 17:15:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1132. [2018-12-03 17:15:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-03 17:15:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2705 transitions. [2018-12-03 17:15:18,944 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2705 transitions. Word has length 16 [2018-12-03 17:15:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:18,944 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 2705 transitions. [2018-12-03 17:15:18,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2705 transitions. [2018-12-03 17:15:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:18,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:18,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:18,945 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:18,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-12-03 17:15:18,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:19,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:19,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:15:19,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:19,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:19,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:19,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:19,049 INFO L87 Difference]: Start difference. First operand 1132 states and 2705 transitions. Second operand 8 states. [2018-12-03 17:15:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:23,755 INFO L93 Difference]: Finished difference Result 2031 states and 4610 transitions. [2018-12-03 17:15:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:15:23,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:23,758 INFO L225 Difference]: With dead ends: 2031 [2018-12-03 17:15:23,758 INFO L226 Difference]: Without dead ends: 2023 [2018-12-03 17:15:23,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:15:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-12-03 17:15:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1116. [2018-12-03 17:15:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-03 17:15:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 2665 transitions. [2018-12-03 17:15:24,943 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 2665 transitions. Word has length 16 [2018-12-03 17:15:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:24,943 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 2665 transitions. [2018-12-03 17:15:24,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 2665 transitions. [2018-12-03 17:15:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:24,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:24,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:24,945 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:24,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-12-03 17:15:24,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:24,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:24,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:24,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:24,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:25,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:25,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:15:25,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:25,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:25,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:25,403 INFO L87 Difference]: Start difference. First operand 1116 states and 2665 transitions. Second operand 8 states. [2018-12-03 17:15:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:29,998 INFO L93 Difference]: Finished difference Result 1919 states and 4358 transitions. [2018-12-03 17:15:29,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:15:29,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:30,000 INFO L225 Difference]: With dead ends: 1919 [2018-12-03 17:15:30,001 INFO L226 Difference]: Without dead ends: 1911 [2018-12-03 17:15:30,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:15:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2018-12-03 17:15:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1215. [2018-12-03 17:15:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-12-03 17:15:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 2891 transitions. [2018-12-03 17:15:31,400 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 2891 transitions. Word has length 16 [2018-12-03 17:15:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:31,400 INFO L480 AbstractCegarLoop]: Abstraction has 1215 states and 2891 transitions. [2018-12-03 17:15:31,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 2891 transitions. [2018-12-03 17:15:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:31,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:31,401 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:31,401 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:31,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:31,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-12-03 17:15:31,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:31,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:31,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:31,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:31,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:31,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:31,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:31,995 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:31,995 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [120], [122], [126], [203], [236], [245], [254], [260], [274], [349] [2018-12-03 17:15:31,997 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:31,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:32,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:32,066 INFO L272 AbstractInterpreter]: Visited 14 different actions 43 times. Merged at 9 different actions 29 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:15:32,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:32,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:32,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:32,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:32,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:32,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:32,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:32,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:32,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:32,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 17:15:32,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:32,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:32,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:32,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:32,183 INFO L87 Difference]: Start difference. First operand 1215 states and 2891 transitions. Second operand 8 states. [2018-12-03 17:15:34,360 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-03 17:15:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:38,420 INFO L93 Difference]: Finished difference Result 1839 states and 4254 transitions. [2018-12-03 17:15:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:15:38,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:38,423 INFO L225 Difference]: With dead ends: 1839 [2018-12-03 17:15:38,423 INFO L226 Difference]: Without dead ends: 1831 [2018-12-03 17:15:38,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:15:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2018-12-03 17:15:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1223. [2018-12-03 17:15:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-12-03 17:15:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2906 transitions. [2018-12-03 17:15:39,844 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2906 transitions. Word has length 16 [2018-12-03 17:15:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:39,845 INFO L480 AbstractCegarLoop]: Abstraction has 1223 states and 2906 transitions. [2018-12-03 17:15:39,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2906 transitions. [2018-12-03 17:15:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:39,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:39,845 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:39,846 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:39,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-12-03 17:15:39,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:39,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:39,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:39,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:39,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:39,946 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:39,946 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [113], [115], [120], [126], [203], [236], [245], [254], [260], [274], [349] [2018-12-03 17:15:39,949 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:39,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:39,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:39,990 INFO L272 AbstractInterpreter]: Visited 15 different actions 49 times. Merged at 10 different actions 33 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:15:39,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:39,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:39,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:39,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:40,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:40,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:40,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:40,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:40,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:40,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 17:15:40,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:40,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:40,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:40,064 INFO L87 Difference]: Start difference. First operand 1223 states and 2906 transitions. Second operand 8 states. [2018-12-03 17:15:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:45,280 INFO L93 Difference]: Finished difference Result 2214 states and 5067 transitions. [2018-12-03 17:15:45,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:15:45,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:45,284 INFO L225 Difference]: With dead ends: 2214 [2018-12-03 17:15:45,284 INFO L226 Difference]: Without dead ends: 2206 [2018-12-03 17:15:45,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:15:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2018-12-03 17:15:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1214. [2018-12-03 17:15:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-12-03 17:15:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2885 transitions. [2018-12-03 17:15:46,715 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2885 transitions. Word has length 16 [2018-12-03 17:15:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:46,715 INFO L480 AbstractCegarLoop]: Abstraction has 1214 states and 2885 transitions. [2018-12-03 17:15:46,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2885 transitions. [2018-12-03 17:15:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:46,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:46,716 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:46,716 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:46,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:46,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-12-03 17:15:46,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:46,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:46,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:46,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:46,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:46,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:46,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:46,786 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:46,786 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [113], [115], [120], [126], [203], [236], [245], [260], [274], [349] [2018-12-03 17:15:46,787 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:46,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:46,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:46,829 INFO L272 AbstractInterpreter]: Visited 15 different actions 50 times. Merged at 10 different actions 34 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:15:46,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:46,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:46,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:46,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:46,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:46,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:46,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:46,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:46,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 17:15:46,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:46,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:46,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:46,953 INFO L87 Difference]: Start difference. First operand 1214 states and 2885 transitions. Second operand 8 states. [2018-12-03 17:15:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:51,993 INFO L93 Difference]: Finished difference Result 2055 states and 4701 transitions. [2018-12-03 17:15:51,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:15:51,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:51,996 INFO L225 Difference]: With dead ends: 2055 [2018-12-03 17:15:51,996 INFO L226 Difference]: Without dead ends: 2047 [2018-12-03 17:15:51,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:15:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2018-12-03 17:15:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1178. [2018-12-03 17:15:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2018-12-03 17:15:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 2786 transitions. [2018-12-03 17:15:53,358 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 2786 transitions. Word has length 16 [2018-12-03 17:15:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:53,358 INFO L480 AbstractCegarLoop]: Abstraction has 1178 states and 2786 transitions. [2018-12-03 17:15:53,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 2786 transitions. [2018-12-03 17:15:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:53,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:53,359 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:53,359 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:53,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-12-03 17:15:53,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:53,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:53,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:53,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:53,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:53,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:53,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:53,425 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:53,425 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [102], [113], [115], [120], [126], [183], [203], [229], [260], [274], [349] [2018-12-03 17:15:53,427 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:53,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:53,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:53,466 INFO L272 AbstractInterpreter]: Visited 15 different actions 52 times. Merged at 10 different actions 36 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:15:53,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:53,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:53,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:53,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:53,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:53,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:53,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:53,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:53,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:53,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 17:15:53,556 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:53,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:53,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:53,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:15:53,557 INFO L87 Difference]: Start difference. First operand 1178 states and 2786 transitions. Second operand 8 states. [2018-12-03 17:15:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:57,807 INFO L93 Difference]: Finished difference Result 1725 states and 3950 transitions. [2018-12-03 17:15:57,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:15:57,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 17:15:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:57,811 INFO L225 Difference]: With dead ends: 1725 [2018-12-03 17:15:57,811 INFO L226 Difference]: Without dead ends: 1717 [2018-12-03 17:15:57,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:15:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2018-12-03 17:15:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1127. [2018-12-03 17:15:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2018-12-03 17:15:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 2660 transitions. [2018-12-03 17:15:59,164 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 2660 transitions. Word has length 16 [2018-12-03 17:15:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:59,165 INFO L480 AbstractCegarLoop]: Abstraction has 1127 states and 2660 transitions. [2018-12-03 17:15:59,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 2660 transitions. [2018-12-03 17:15:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:15:59,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:59,165 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:59,166 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:59,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-12-03 17:15:59,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:59,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:59,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:59,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:59,268 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:15:59,268 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [132], [203], [236], [245], [252], [254], [337], [345], [351] [2018-12-03 17:15:59,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:59,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:59,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:59,300 INFO L272 AbstractInterpreter]: Visited 14 different actions 40 times. Merged at 7 different actions 23 times. Widened at 1 different actions 1 times. Found 4 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:15:59,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:59,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:59,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:59,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:59,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:59,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:59,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:59,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:00,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2018-12-03 17:16:00,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:00,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:16:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:16:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:16:00,206 INFO L87 Difference]: Start difference. First operand 1127 states and 2660 transitions. Second operand 17 states. [2018-12-03 17:16:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:08,249 INFO L93 Difference]: Finished difference Result 1796 states and 4100 transitions. [2018-12-03 17:16:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:16:08,250 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:16:08,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:08,252 INFO L225 Difference]: With dead ends: 1796 [2018-12-03 17:16:08,252 INFO L226 Difference]: Without dead ends: 1788 [2018-12-03 17:16:08,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=725, Invalid=3181, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:16:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2018-12-03 17:16:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1219. [2018-12-03 17:16:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-12-03 17:16:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2889 transitions. [2018-12-03 17:16:09,732 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2889 transitions. Word has length 16 [2018-12-03 17:16:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:09,732 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2889 transitions. [2018-12-03 17:16:09,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:16:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2889 transitions. [2018-12-03 17:16:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:09,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:09,733 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:09,733 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:09,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-12-03 17:16:09,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:09,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:09,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:09,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:09,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:09,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:09,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 17:16:09,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:09,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:16:09,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:16:09,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:16:09,968 INFO L87 Difference]: Start difference. First operand 1219 states and 2889 transitions. Second operand 9 states. [2018-12-03 17:16:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:14,197 INFO L93 Difference]: Finished difference Result 1559 states and 3553 transitions. [2018-12-03 17:16:14,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:16:14,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:16:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:14,199 INFO L225 Difference]: With dead ends: 1559 [2018-12-03 17:16:14,199 INFO L226 Difference]: Without dead ends: 1551 [2018-12-03 17:16:14,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:16:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2018-12-03 17:16:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1192. [2018-12-03 17:16:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-12-03 17:16:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2823 transitions. [2018-12-03 17:16:15,691 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2823 transitions. Word has length 16 [2018-12-03 17:16:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:15,691 INFO L480 AbstractCegarLoop]: Abstraction has 1192 states and 2823 transitions. [2018-12-03 17:16:15,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:16:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2823 transitions. [2018-12-03 17:16:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:15,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:15,692 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:15,692 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:15,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:15,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-12-03 17:16:15,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:15,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:15,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:15,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:15,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:15,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:15,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 17:16:15,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:15,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:16:15,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:16:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:16:15,840 INFO L87 Difference]: Start difference. First operand 1192 states and 2823 transitions. Second operand 9 states. [2018-12-03 17:16:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:20,697 INFO L93 Difference]: Finished difference Result 1673 states and 3849 transitions. [2018-12-03 17:16:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:16:20,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:16:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:20,699 INFO L225 Difference]: With dead ends: 1673 [2018-12-03 17:16:20,699 INFO L226 Difference]: Without dead ends: 1665 [2018-12-03 17:16:20,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:16:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2018-12-03 17:16:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1246. [2018-12-03 17:16:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1246 states. [2018-12-03 17:16:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 2961 transitions. [2018-12-03 17:16:22,383 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 2961 transitions. Word has length 16 [2018-12-03 17:16:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:22,383 INFO L480 AbstractCegarLoop]: Abstraction has 1246 states and 2961 transitions. [2018-12-03 17:16:22,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:16:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 2961 transitions. [2018-12-03 17:16:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:22,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:22,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:22,384 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:22,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-12-03 17:16:22,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:22,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:22,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:22,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 17:16:22,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:22,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:16:22,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:16:22,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:16:22,494 INFO L87 Difference]: Start difference. First operand 1246 states and 2961 transitions. Second operand 9 states. [2018-12-03 17:16:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:28,636 INFO L93 Difference]: Finished difference Result 2122 states and 4935 transitions. [2018-12-03 17:16:28,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:16:28,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:16:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:28,639 INFO L225 Difference]: With dead ends: 2122 [2018-12-03 17:16:28,639 INFO L226 Difference]: Without dead ends: 2114 [2018-12-03 17:16:28,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:16:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2018-12-03 17:16:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1331. [2018-12-03 17:16:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-12-03 17:16:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 3148 transitions. [2018-12-03 17:16:30,386 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 3148 transitions. Word has length 16 [2018-12-03 17:16:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:30,386 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 3148 transitions. [2018-12-03 17:16:30,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:16:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 3148 transitions. [2018-12-03 17:16:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:30,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:30,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:30,387 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:30,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-12-03 17:16:30,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:30,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:30,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:30,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:30,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 17:16:30,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:30,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:16:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:16:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:16:30,466 INFO L87 Difference]: Start difference. First operand 1331 states and 3148 transitions. Second operand 9 states. [2018-12-03 17:16:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:37,082 INFO L93 Difference]: Finished difference Result 2172 states and 4979 transitions. [2018-12-03 17:16:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:16:37,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:16:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:37,086 INFO L225 Difference]: With dead ends: 2172 [2018-12-03 17:16:37,086 INFO L226 Difference]: Without dead ends: 2164 [2018-12-03 17:16:37,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:16:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-12-03 17:16:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1340. [2018-12-03 17:16:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2018-12-03 17:16:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 3166 transitions. [2018-12-03 17:16:38,861 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 3166 transitions. Word has length 16 [2018-12-03 17:16:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:38,861 INFO L480 AbstractCegarLoop]: Abstraction has 1340 states and 3166 transitions. [2018-12-03 17:16:38,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:16:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 3166 transitions. [2018-12-03 17:16:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:38,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:38,862 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:38,862 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:38,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-12-03 17:16:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:38,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:38,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:38,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:38,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:38,943 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:16:38,943 INFO L205 CegarAbsIntRunner]: [0], [4], [59], [78], [159], [174], [183], [203], [204], [279], [283], [337], [345], [351] [2018-12-03 17:16:38,944 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:38,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:38,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:38,975 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 4 different actions 18 times. Widened at 3 different actions 3 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:16:39,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:39,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:39,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:39,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:39,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:39,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:39,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:39,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:39,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:39,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 17:16:39,386 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:39,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:16:39,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:16:39,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:16:39,387 INFO L87 Difference]: Start difference. First operand 1340 states and 3166 transitions. Second operand 17 states. [2018-12-03 17:16:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:53,822 INFO L93 Difference]: Finished difference Result 2859 states and 6605 transitions. [2018-12-03 17:16:53,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:16:53,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:16:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:53,826 INFO L225 Difference]: With dead ends: 2859 [2018-12-03 17:16:53,827 INFO L226 Difference]: Without dead ends: 2851 [2018-12-03 17:16:53,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3532 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1901, Invalid=9871, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 17:16:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-12-03 17:16:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 1362. [2018-12-03 17:16:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-12-03 17:16:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 3216 transitions. [2018-12-03 17:16:55,795 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 3216 transitions. Word has length 16 [2018-12-03 17:16:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:55,795 INFO L480 AbstractCegarLoop]: Abstraction has 1362 states and 3216 transitions. [2018-12-03 17:16:55,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:16:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 3216 transitions. [2018-12-03 17:16:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:16:55,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:55,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:55,796 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:55,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-12-03 17:16:55,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:55,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:55,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:55,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:55,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:16:55,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 17:16:55,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:16:55,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:16:55,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:16:55,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:16:55,881 INFO L87 Difference]: Start difference. First operand 1362 states and 3216 transitions. Second operand 9 states. [2018-12-03 17:17:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:02,078 INFO L93 Difference]: Finished difference Result 1943 states and 4487 transitions. [2018-12-03 17:17:02,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:17:02,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:17:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:02,081 INFO L225 Difference]: With dead ends: 1943 [2018-12-03 17:17:02,081 INFO L226 Difference]: Without dead ends: 1935 [2018-12-03 17:17:02,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:17:02,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2018-12-03 17:17:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1270. [2018-12-03 17:17:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-12-03 17:17:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2986 transitions. [2018-12-03 17:17:03,859 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2986 transitions. Word has length 16 [2018-12-03 17:17:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:03,859 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 2986 transitions. [2018-12-03 17:17:03,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:17:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2986 transitions. [2018-12-03 17:17:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:17:03,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:03,860 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:03,860 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:03,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:03,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-12-03 17:17:03,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:03,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:03,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:03,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:03,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:03,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:03,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:03,941 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:17:03,941 INFO L205 CegarAbsIntRunner]: [0], [4], [159], [174], [183], [203], [204], [279], [283], [321], [331], [339], [345], [351] [2018-12-03 17:17:03,943 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:03,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:03,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:03,974 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 4 different actions 18 times. Widened at 3 different actions 3 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:17:04,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:04,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:04,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:04,011 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 17:17:04,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:04,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:04,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:04,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:04,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:04,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 17:17:04,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:04,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:17:04,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:17:04,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:17:04,502 INFO L87 Difference]: Start difference. First operand 1270 states and 2986 transitions. Second operand 17 states. [2018-12-03 17:17:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:22,592 INFO L93 Difference]: Finished difference Result 3947 states and 9069 transitions. [2018-12-03 17:17:22,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-12-03 17:17:22,592 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:17:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:22,597 INFO L225 Difference]: With dead ends: 3947 [2018-12-03 17:17:22,598 INFO L226 Difference]: Without dead ends: 3939 [2018-12-03 17:17:22,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6865 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3042, Invalid=17838, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 17:17:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2018-12-03 17:17:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 1446. [2018-12-03 17:17:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2018-12-03 17:17:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 3396 transitions. [2018-12-03 17:17:24,590 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 3396 transitions. Word has length 16 [2018-12-03 17:17:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:24,590 INFO L480 AbstractCegarLoop]: Abstraction has 1446 states and 3396 transitions. [2018-12-03 17:17:24,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:17:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 3396 transitions. [2018-12-03 17:17:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:17:24,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:24,591 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:24,591 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:24,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-12-03 17:17:24,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:24,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:24,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:24,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:24,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:24,678 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 17:17:24,679 INFO L205 CegarAbsIntRunner]: [0], [4], [159], [174], [183], [203], [204], [283], [314], [323], [331], [339], [345], [351] [2018-12-03 17:17:24,680 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:24,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:24,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:24,710 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 4 different actions 18 times. Widened at 3 different actions 3 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:17:24,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:24,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:24,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:24,728 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 17:17:24,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:24,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:24,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:24,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:25,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:25,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2018-12-03 17:17:25,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:25,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:17:25,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:17:25,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:17:25,038 INFO L87 Difference]: Start difference. First operand 1446 states and 3396 transitions. Second operand 17 states. [2018-12-03 17:17:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:43,587 INFO L93 Difference]: Finished difference Result 3737 states and 8599 transitions. [2018-12-03 17:17:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-12-03 17:17:43,587 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:17:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:43,593 INFO L225 Difference]: With dead ends: 3737 [2018-12-03 17:17:43,593 INFO L226 Difference]: Without dead ends: 3729 [2018-12-03 17:17:43,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10390 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3961, Invalid=25795, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 17:17:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2018-12-03 17:17:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 1695. [2018-12-03 17:17:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2018-12-03 17:17:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 3978 transitions. [2018-12-03 17:17:46,313 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 3978 transitions. Word has length 16 [2018-12-03 17:17:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:46,313 INFO L480 AbstractCegarLoop]: Abstraction has 1695 states and 3978 transitions. [2018-12-03 17:17:46,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:17:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3978 transitions. [2018-12-03 17:17:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:17:46,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:46,315 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:46,315 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:46,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-12-03 17:17:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:46,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:46,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:46,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:46,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:46,447 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-03 17:17:46,447 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [76], [84], [92], [251], [317], [323], [331], [333], [337], [339], [345], [351] [2018-12-03 17:17:46,449 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:46,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:46,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:46,492 INFO L272 AbstractInterpreter]: Visited 15 different actions 58 times. Merged at 13 different actions 37 times. Widened at 2 different actions 2 times. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:17:46,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:46,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:46,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:46,504 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 17:17:46,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:46,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:46,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:46,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:46,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:46,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 17:17:46,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:46,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:17:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:17:46,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:17:46,730 INFO L87 Difference]: Start difference. First operand 1695 states and 3978 transitions. Second operand 19 states. [2018-12-03 17:17:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:58,995 INFO L93 Difference]: Finished difference Result 5743 states and 13322 transitions. [2018-12-03 17:17:58,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:17:58,995 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-12-03 17:17:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:59,000 INFO L225 Difference]: With dead ends: 5743 [2018-12-03 17:17:59,000 INFO L226 Difference]: Without dead ends: 4049 [2018-12-03 17:17:59,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1245, Invalid=4011, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:17:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2018-12-03 17:18:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 2136. [2018-12-03 17:18:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-12-03 17:18:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4956 transitions. [2018-12-03 17:18:01,961 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4956 transitions. Word has length 17 [2018-12-03 17:18:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:01,962 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4956 transitions. [2018-12-03 17:18:01,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:18:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4956 transitions. [2018-12-03 17:18:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:18:01,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:01,963 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:01,963 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:01,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:01,963 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-12-03 17:18:01,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:01,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:01,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:02,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:02,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:02,085 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:18:02,085 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [132], [203], [236], [245], [252], [254], [337], [345], [351] [2018-12-03 17:18:02,087 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:02,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:02,194 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:18:02,194 INFO L272 AbstractInterpreter]: Visited 16 different actions 107 times. Merged at 12 different actions 78 times. Widened at 9 different actions 32 times. Found 15 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:18:02,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:02,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:18:02,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:02,236 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 17:18:02,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:02,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:02,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:02,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:02,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:02,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:18:02,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:02,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:18:02,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:18:02,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:18:02,720 INFO L87 Difference]: Start difference. First operand 2136 states and 4956 transitions. Second operand 11 states. [2018-12-03 17:18:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:09,755 INFO L93 Difference]: Finished difference Result 2950 states and 6783 transitions. [2018-12-03 17:18:09,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:18:09,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:18:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:09,760 INFO L225 Difference]: With dead ends: 2950 [2018-12-03 17:18:09,760 INFO L226 Difference]: Without dead ends: 2942 [2018-12-03 17:18:09,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:18:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-12-03 17:18:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2216. [2018-12-03 17:18:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-12-03 17:18:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5164 transitions. [2018-12-03 17:18:12,780 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5164 transitions. Word has length 20 [2018-12-03 17:18:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:12,780 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5164 transitions. [2018-12-03 17:18:12,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:18:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5164 transitions. [2018-12-03 17:18:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:18:12,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:12,781 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:12,781 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:12,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:12,782 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-12-03 17:18:12,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:12,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:12,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:12,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:12,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:12,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:12,863 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:18:12,863 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [94], [98], [132], [203], [236], [245], [252], [337], [345], [351] [2018-12-03 17:18:12,865 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:12,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:12,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:18:12,967 INFO L272 AbstractInterpreter]: Visited 17 different actions 119 times. Merged at 13 different actions 87 times. Widened at 10 different actions 37 times. Found 17 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:18:13,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:13,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:18:13,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:13,008 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 17:18:13,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:13,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:13,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:13,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:13,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:13,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:18:13,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:13,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:18:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:18:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:18:13,151 INFO L87 Difference]: Start difference. First operand 2216 states and 5164 transitions. Second operand 11 states. [2018-12-03 17:18:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:21,047 INFO L93 Difference]: Finished difference Result 3468 states and 7990 transitions. [2018-12-03 17:18:21,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:18:21,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:18:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:21,052 INFO L225 Difference]: With dead ends: 3468 [2018-12-03 17:18:21,052 INFO L226 Difference]: Without dead ends: 3460 [2018-12-03 17:18:21,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:18:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2018-12-03 17:18:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 2248. [2018-12-03 17:18:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-12-03 17:18:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5244 transitions. [2018-12-03 17:18:24,053 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5244 transitions. Word has length 20 [2018-12-03 17:18:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:24,053 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5244 transitions. [2018-12-03 17:18:24,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:18:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5244 transitions. [2018-12-03 17:18:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:18:24,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:24,054 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:24,054 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:24,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-12-03 17:18:24,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:24,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:24,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:24,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:24,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:24,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:24,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:24,472 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:18:24,472 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [76], [84], [86], [92], [94], [102], [132], [183], [203], [229], [252], [337], [345], [351] [2018-12-03 17:18:24,473 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:24,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:24,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:18:24,569 INFO L272 AbstractInterpreter]: Visited 17 different actions 124 times. Merged at 13 different actions 92 times. Widened at 10 different actions 41 times. Found 17 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:18:24,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:24,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:18:24,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:24,607 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 17:18:24,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:24,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:24,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:24,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:24,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:24,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:18:24,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:24,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:18:24,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:18:24,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:18:24,729 INFO L87 Difference]: Start difference. First operand 2248 states and 5244 transitions. Second operand 11 states. [2018-12-03 17:18:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:32,654 INFO L93 Difference]: Finished difference Result 3268 states and 7513 transitions. [2018-12-03 17:18:32,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:18:32,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:18:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:32,659 INFO L225 Difference]: With dead ends: 3268 [2018-12-03 17:18:32,659 INFO L226 Difference]: Without dead ends: 3260 [2018-12-03 17:18:32,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:18:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2018-12-03 17:18:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2246. [2018-12-03 17:18:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-12-03 17:18:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5240 transitions. [2018-12-03 17:18:35,752 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5240 transitions. Word has length 20 [2018-12-03 17:18:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:35,752 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5240 transitions. [2018-12-03 17:18:35,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:18:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5240 transitions. [2018-12-03 17:18:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:18:35,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:35,753 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:35,754 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:35,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-12-03 17:18:35,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:35,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:35,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:35,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:35,837 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:18:35,838 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [55], [76], [78], [84], [86], [92], [98], [132], [203], [236], [245], [252], [292], [337], [345], [351] [2018-12-03 17:18:35,839 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:35,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:35,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:18:35,929 INFO L272 AbstractInterpreter]: Visited 19 different actions 118 times. Merged at 15 different actions 85 times. Widened at 10 different actions 31 times. Found 16 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:18:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:35,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:18:35,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:35,966 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 17:18:35,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:35,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:36,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:36,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:36,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:18:36,451 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:36,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:18:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:18:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:18:36,452 INFO L87 Difference]: Start difference. First operand 2246 states and 5240 transitions. Second operand 11 states. [2018-12-03 17:18:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:46,044 INFO L93 Difference]: Finished difference Result 3632 states and 8364 transitions. [2018-12-03 17:18:46,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:18:46,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:18:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:46,050 INFO L225 Difference]: With dead ends: 3632 [2018-12-03 17:18:46,050 INFO L226 Difference]: Without dead ends: 3624 [2018-12-03 17:18:46,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:18:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2018-12-03 17:18:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 2328. [2018-12-03 17:18:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-12-03 17:18:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 5456 transitions. [2018-12-03 17:18:49,640 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 5456 transitions. Word has length 20 [2018-12-03 17:18:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:49,641 INFO L480 AbstractCegarLoop]: Abstraction has 2328 states and 5456 transitions. [2018-12-03 17:18:49,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:18:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 5456 transitions. [2018-12-03 17:18:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:18:49,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:49,642 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:18:49,642 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:49,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 718975582, now seen corresponding path program 1 times [2018-12-03 17:18:49,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:49,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:49,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:49,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:49,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:49,723 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:18:49,724 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [55], [76], [78], [84], [86], [92], [102], [132], [183], [203], [229], [252], [292], [337], [345], [351] [2018-12-03 17:18:49,725 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:49,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:49,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:18:49,836 INFO L272 AbstractInterpreter]: Visited 19 different actions 122 times. Merged at 15 different actions 89 times. Widened at 12 different actions 35 times. Found 16 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:18:49,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:49,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:18:49,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:49,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:18:49,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:49,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:49,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:49,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:49,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:49,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:18:49,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:49,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:18:49,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:18:49,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:18:49,963 INFO L87 Difference]: Start difference. First operand 2328 states and 5456 transitions. Second operand 11 states. [2018-12-03 17:18:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:59,637 INFO L93 Difference]: Finished difference Result 3838 states and 8826 transitions. [2018-12-03 17:18:59,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:18:59,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:18:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:59,643 INFO L225 Difference]: With dead ends: 3838 [2018-12-03 17:18:59,643 INFO L226 Difference]: Without dead ends: 3830 [2018-12-03 17:18:59,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=897, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:18:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2018-12-03 17:19:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 2262. [2018-12-03 17:19:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-12-03 17:19:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5280 transitions. [2018-12-03 17:19:02,858 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5280 transitions. Word has length 20 [2018-12-03 17:19:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:02,858 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5280 transitions. [2018-12-03 17:19:02,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:19:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5280 transitions. [2018-12-03 17:19:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:19:02,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:02,860 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:02,860 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:02,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash 826825729, now seen corresponding path program 1 times [2018-12-03 17:19:02,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:02,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:02,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:03,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:03,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:03,006 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:19:03,007 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [59], [76], [78], [84], [86], [92], [132], [174], [183], [203], [252], [279], [283], [337], [345], [351] [2018-12-03 17:19:03,008 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:03,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:03,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:19:03,098 INFO L272 AbstractInterpreter]: Visited 19 different actions 122 times. Merged at 15 different actions 89 times. Widened at 12 different actions 35 times. Found 16 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:19:03,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:03,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:19:03,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:03,125 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 17:19:03,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:03,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:03,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:03,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:03,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:03,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:19:03,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:03,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:19:03,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:19:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:19:03,287 INFO L87 Difference]: Start difference. First operand 2262 states and 5280 transitions. Second operand 11 states. [2018-12-03 17:19:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:11,617 INFO L93 Difference]: Finished difference Result 3310 states and 7610 transitions. [2018-12-03 17:19:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:19:11,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:19:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:11,622 INFO L225 Difference]: With dead ends: 3310 [2018-12-03 17:19:11,622 INFO L226 Difference]: Without dead ends: 3302 [2018-12-03 17:19:11,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:19:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2018-12-03 17:19:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 2262. [2018-12-03 17:19:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-12-03 17:19:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5280 transitions. [2018-12-03 17:19:14,913 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5280 transitions. Word has length 20 [2018-12-03 17:19:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:14,914 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5280 transitions. [2018-12-03 17:19:14,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:19:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5280 transitions. [2018-12-03 17:19:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:19:14,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:14,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:14,916 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:14,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:14,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1854611284, now seen corresponding path program 1 times [2018-12-03 17:19:14,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:14,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:14,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:15,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:15,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:15,375 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:19:15,375 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [55], [76], [84], [86], [92], [98], [132], [203], [236], [245], [252], [292], [327], [337], [339], [345], [351] [2018-12-03 17:19:15,376 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:15,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:15,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:19:15,460 INFO L272 AbstractInterpreter]: Visited 20 different actions 124 times. Merged at 16 different actions 90 times. Widened at 11 different actions 30 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:19:15,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:15,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:19:15,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:15,498 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 17:19:15,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:15,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:15,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:15,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:15,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:15,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:19:15,627 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:15,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:19:15,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:19:15,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:19:15,628 INFO L87 Difference]: Start difference. First operand 2262 states and 5280 transitions. Second operand 11 states. [2018-12-03 17:19:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:23,873 INFO L93 Difference]: Finished difference Result 3425 states and 7804 transitions. [2018-12-03 17:19:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:19:23,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:19:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:23,877 INFO L225 Difference]: With dead ends: 3425 [2018-12-03 17:19:23,877 INFO L226 Difference]: Without dead ends: 3417 [2018-12-03 17:19:23,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:19:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2018-12-03 17:19:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 2202. [2018-12-03 17:19:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-12-03 17:19:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 5116 transitions. [2018-12-03 17:19:27,007 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 5116 transitions. Word has length 20 [2018-12-03 17:19:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:27,007 INFO L480 AbstractCegarLoop]: Abstraction has 2202 states and 5116 transitions. [2018-12-03 17:19:27,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:19:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 5116 transitions. [2018-12-03 17:19:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:19:27,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:27,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:27,008 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:27,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:27,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1854713429, now seen corresponding path program 1 times [2018-12-03 17:19:27,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:27,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:27,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:27,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:27,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:27,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:27,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:27,085 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:19:27,085 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [55], [76], [84], [86], [92], [102], [132], [183], [203], [229], [252], [292], [327], [337], [339], [345], [351] [2018-12-03 17:19:27,085 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:27,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:27,179 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:19:27,179 INFO L272 AbstractInterpreter]: Visited 20 different actions 131 times. Merged at 16 different actions 96 times. Widened at 13 different actions 37 times. Found 17 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:19:27,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:27,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:19:27,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:27,215 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 17:19:27,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:27,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:27,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:27,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:27,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:27,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:19:27,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:27,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:19:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:19:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:19:27,358 INFO L87 Difference]: Start difference. First operand 2202 states and 5116 transitions. Second operand 11 states. [2018-12-03 17:19:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:37,162 INFO L93 Difference]: Finished difference Result 3637 states and 8278 transitions. [2018-12-03 17:19:37,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:19:37,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:19:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:37,166 INFO L225 Difference]: With dead ends: 3637 [2018-12-03 17:19:37,166 INFO L226 Difference]: Without dead ends: 3629 [2018-12-03 17:19:37,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:19:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2018-12-03 17:19:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 2136. [2018-12-03 17:19:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-12-03 17:19:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4940 transitions. [2018-12-03 17:19:40,366 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4940 transitions. Word has length 20 [2018-12-03 17:19:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:40,366 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4940 transitions. [2018-12-03 17:19:40,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:19:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4940 transitions. [2018-12-03 17:19:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:19:40,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:40,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:40,367 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:40,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1962563576, now seen corresponding path program 1 times [2018-12-03 17:19:40,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:40,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:40,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:40,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:40,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:40,605 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 17:19:40,606 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [59], [76], [84], [86], [92], [132], [174], [183], [203], [252], [279], [283], [327], [337], [339], [345], [351] [2018-12-03 17:19:40,607 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:40,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:40,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:19:40,697 INFO L272 AbstractInterpreter]: Visited 20 different actions 128 times. Merged at 16 different actions 94 times. Widened at 13 different actions 34 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:19:40,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:40,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:19:40,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:40,733 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 17:19:40,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:40,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:40,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:41,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:19:41,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:41,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 17:19:41,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:41,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:19:41,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:19:41,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:19:41,229 INFO L87 Difference]: Start difference. First operand 2136 states and 4940 transitions. Second operand 11 states. [2018-12-03 17:19:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:50,904 INFO L93 Difference]: Finished difference Result 3470 states and 7894 transitions. [2018-12-03 17:19:50,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:19:50,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:19:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:50,909 INFO L225 Difference]: With dead ends: 3470 [2018-12-03 17:19:50,909 INFO L226 Difference]: Without dead ends: 3462 [2018-12-03 17:19:50,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:19:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2018-12-03 17:19:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 1834. [2018-12-03 17:19:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2018-12-03 17:19:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 4242 transitions. [2018-12-03 17:19:53,871 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 4242 transitions. Word has length 20 [2018-12-03 17:19:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:53,871 INFO L480 AbstractCegarLoop]: Abstraction has 1834 states and 4242 transitions. [2018-12-03 17:19:53,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:19:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 4242 transitions. [2018-12-03 17:19:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:19:53,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:53,872 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:19:53,872 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:53,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash 371911669, now seen corresponding path program 1 times [2018-12-03 17:19:53,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:53,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:53,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:53,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:53,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:53,990 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:19:53,990 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [59], [65], [72], [78], [113], [120], [126], [260], [262], [274], [279], [285], [343], [349] [2018-12-03 17:19:53,991 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:19:53,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:19:54,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:19:54,017 INFO L272 AbstractInterpreter]: Visited 17 different actions 52 times. Merged at 11 different actions 31 times. Widened at 1 different actions 2 times. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:19:54,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:54,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:19:54,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:54,045 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 17:19:54,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:54,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:54,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:54,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:54,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:54,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2018-12-03 17:19:54,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:54,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:19:54,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:19:54,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:19:54,340 INFO L87 Difference]: Start difference. First operand 1834 states and 4242 transitions. Second operand 20 states. [2018-12-03 17:20:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:19,097 INFO L93 Difference]: Finished difference Result 6211 states and 13924 transitions. [2018-12-03 17:20:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 17:20:19,098 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-12-03 17:20:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:19,105 INFO L225 Difference]: With dead ends: 6211 [2018-12-03 17:20:19,106 INFO L226 Difference]: Without dead ends: 6203 [2018-12-03 17:20:19,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7241 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3262, Invalid=17330, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:20:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6203 states. [2018-12-03 17:20:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6203 to 3377. [2018-12-03 17:20:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-12-03 17:20:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 7841 transitions. [2018-12-03 17:20:24,325 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 7841 transitions. Word has length 21 [2018-12-03 17:20:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:24,325 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 7841 transitions. [2018-12-03 17:20:24,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:20:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 7841 transitions. [2018-12-03 17:20:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:20:24,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:24,327 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:24,327 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:24,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash -461254251, now seen corresponding path program 2 times [2018-12-03 17:20:24,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:24,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:24,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:25,252 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 17:20:25,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:25,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:25,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:25,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:25,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:25,253 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 17:20:25,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:20:25,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:20:25,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:20:25,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:25,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:25,437 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 17:20:25,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:25,585 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 17:20:25,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:25,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2018-12-03 17:20:25,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:25,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:20:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:20:25,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:20:25,605 INFO L87 Difference]: Start difference. First operand 3377 states and 7841 transitions. Second operand 21 states. [2018-12-03 17:20:32,981 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-03 17:20:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:48,417 INFO L93 Difference]: Finished difference Result 6959 states and 15836 transitions. [2018-12-03 17:20:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:20:48,417 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 17:20:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:48,425 INFO L225 Difference]: With dead ends: 6959 [2018-12-03 17:20:48,425 INFO L226 Difference]: Without dead ends: 6951 [2018-12-03 17:20:48,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3785 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2202, Invalid=10454, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 17:20:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6951 states. [2018-12-03 17:20:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6951 to 2459. [2018-12-03 17:20:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2018-12-03 17:20:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 5716 transitions. [2018-12-03 17:20:52,722 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 5716 transitions. Word has length 21 [2018-12-03 17:20:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:52,722 INFO L480 AbstractCegarLoop]: Abstraction has 2459 states and 5716 transitions. [2018-12-03 17:20:52,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:20:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 5716 transitions. [2018-12-03 17:20:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:20:52,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:52,723 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 17:20:52,724 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:52,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-12-03 17:20:52,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:52,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:52,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:20:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:52,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:52,851 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 17:20:52,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:52,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:52,852 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:20:52,852 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 17:20:52,853 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:20:52,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:20:52,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:20:52,986 INFO L272 AbstractInterpreter]: Visited 21 different actions 167 times. Merged at 14 different actions 119 times. Widened at 11 different actions 55 times. Found 30 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:20:53,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:53,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:20:53,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:53,013 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 17:20:53,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:53,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:20:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:53,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:53,217 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 17:20:53,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:53,271 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 17:20:53,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:53,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:20:53,290 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:53,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:20:53,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:20:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:20:53,291 INFO L87 Difference]: Start difference. First operand 2459 states and 5716 transitions. Second operand 13 states. [2018-12-03 17:21:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:07,609 INFO L93 Difference]: Finished difference Result 8151 states and 18935 transitions. [2018-12-03 17:21:07,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:21:07,610 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 17:21:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:07,617 INFO L225 Difference]: With dead ends: 8151 [2018-12-03 17:21:07,617 INFO L226 Difference]: Without dead ends: 5693 [2018-12-03 17:21:07,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=533, Invalid=1537, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:21:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2018-12-03 17:21:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 3353. [2018-12-03 17:21:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3353 states. [2018-12-03 17:21:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 7688 transitions. [2018-12-03 17:21:13,667 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 7688 transitions. Word has length 24 [2018-12-03 17:21:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:13,667 INFO L480 AbstractCegarLoop]: Abstraction has 3353 states and 7688 transitions. [2018-12-03 17:21:13,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:21:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 7688 transitions. [2018-12-03 17:21:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:21:13,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:13,669 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 17:21:13,669 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:13,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1269424552, now seen corresponding path program 1 times [2018-12-03 17:21:13,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:13,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:13,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:13,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:13,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:13,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:13,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:13,746 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:21:13,746 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [113], [120], [122], [128], [132], [199], [203], [207], [224], [236], [245], [247], [254], [260], [274], [292], [349] [2018-12-03 17:21:13,747 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:13,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:13,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:21:13,873 INFO L272 AbstractInterpreter]: Visited 22 different actions 172 times. Merged at 15 different actions 125 times. Widened at 12 different actions 56 times. Found 28 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:21:13,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:13,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:21:13,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:13,901 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 17:21:13,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:13,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:21:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:13,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:14,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:14,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:14,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 17:21:14,167 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:14,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:21:14,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:21:14,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:21:14,168 INFO L87 Difference]: Start difference. First operand 3353 states and 7688 transitions. Second operand 14 states. [2018-12-03 17:21:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:28,559 INFO L93 Difference]: Finished difference Result 9205 states and 21053 transitions. [2018-12-03 17:21:28,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:21:28,560 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 17:21:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:28,567 INFO L225 Difference]: With dead ends: 9205 [2018-12-03 17:21:28,567 INFO L226 Difference]: Without dead ends: 5853 [2018-12-03 17:21:28,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:21:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2018-12-03 17:21:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 3433. [2018-12-03 17:21:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3433 states. [2018-12-03 17:21:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 7931 transitions. [2018-12-03 17:21:34,703 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 7931 transitions. Word has length 24 [2018-12-03 17:21:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:34,704 INFO L480 AbstractCegarLoop]: Abstraction has 3433 states and 7931 transitions. [2018-12-03 17:21:34,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:21:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 7931 transitions. [2018-12-03 17:21:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:21:34,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:34,705 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 17:21:34,705 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:34,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:34,706 INFO L82 PathProgramCache]: Analyzing trace with hash -277435291, now seen corresponding path program 1 times [2018-12-03 17:21:34,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:34,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:34,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:34,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:34,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:34,858 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:21:34,859 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [113], [120], [122], [128], [132], [179], [203], [217], [224], [236], [245], [247], [254], [260], [274], [292], [298], [310], [349] [2018-12-03 17:21:34,860 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:34,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:35,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:21:35,020 INFO L272 AbstractInterpreter]: Visited 24 different actions 208 times. Merged at 17 different actions 156 times. Widened at 15 different actions 76 times. Found 31 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 17:21:35,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:35,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:21:35,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:35,056 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 17:21:35,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:35,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:21:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:35,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:35,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:35,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:35,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-12-03 17:21:35,885 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:35,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:21:35,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:21:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:21:35,886 INFO L87 Difference]: Start difference. First operand 3433 states and 7931 transitions. Second operand 15 states. [2018-12-03 17:21:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:52,215 INFO L93 Difference]: Finished difference Result 9837 states and 22621 transitions. [2018-12-03 17:21:52,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:21:52,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-12-03 17:21:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:52,225 INFO L225 Difference]: With dead ends: 9837 [2018-12-03 17:21:52,225 INFO L226 Difference]: Without dead ends: 6405 [2018-12-03 17:21:52,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=766, Invalid=2204, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:21:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6405 states. [2018-12-03 17:21:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6405 to 4309. [2018-12-03 17:21:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4309 states. [2018-12-03 17:21:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 4309 states and 9988 transitions. [2018-12-03 17:21:59,728 INFO L78 Accepts]: Start accepts. Automaton has 4309 states and 9988 transitions. Word has length 24 [2018-12-03 17:21:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:59,728 INFO L480 AbstractCegarLoop]: Abstraction has 4309 states and 9988 transitions. [2018-12-03 17:21:59,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:21:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4309 states and 9988 transitions. [2018-12-03 17:21:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:21:59,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:59,730 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 17:21:59,730 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:59,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -290450663, now seen corresponding path program 1 times [2018-12-03 17:21:59,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:59,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:59,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:59,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:59,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:59,854 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:21:59,854 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [113], [120], [122], [128], [132], [179], [203], [217], [236], [245], [254], [260], [274], [298], [300], [310], [349] [2018-12-03 17:21:59,854 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:59,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:59,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:21:59,976 INFO L272 AbstractInterpreter]: Visited 21 different actions 169 times. Merged at 17 different actions 132 times. Widened at 14 different actions 63 times. Found 18 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:21:59,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:59,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:21:59,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:59,999 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 17:22:00,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:00,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:22:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:00,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:00,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:00,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:00,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-12-03 17:22:00,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:00,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:22:00,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:22:00,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:22:00,377 INFO L87 Difference]: Start difference. First operand 4309 states and 9988 transitions. Second operand 15 states. [2018-12-03 17:22:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:16,101 INFO L93 Difference]: Finished difference Result 10570 states and 24357 transitions. [2018-12-03 17:22:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:22:16,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-12-03 17:22:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:16,109 INFO L225 Difference]: With dead ends: 10570 [2018-12-03 17:22:16,109 INFO L226 Difference]: Without dead ends: 6262 [2018-12-03 17:22:16,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=762, Invalid=1994, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:22:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2018-12-03 17:22:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 4523. [2018-12-03 17:22:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4523 states. [2018-12-03 17:22:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4523 states to 4523 states and 10470 transitions. [2018-12-03 17:22:23,924 INFO L78 Accepts]: Start accepts. Automaton has 4523 states and 10470 transitions. Word has length 24 [2018-12-03 17:22:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:23,924 INFO L480 AbstractCegarLoop]: Abstraction has 4523 states and 10470 transitions. [2018-12-03 17:22:23,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:22:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4523 states and 10470 transitions. [2018-12-03 17:22:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:22:23,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:23,926 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 17:22:23,927 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:23,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:23,927 INFO L82 PathProgramCache]: Analyzing trace with hash 481433400, now seen corresponding path program 1 times [2018-12-03 17:22:23,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:23,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:23,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:23,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:23,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:24,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:24,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:24,023 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:22:24,024 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [98], [113], [120], [122], [128], [134], [138], [199], [203], [207], [224], [236], [245], [247], [254], [260], [274], [292], [349] [2018-12-03 17:22:24,025 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:22:24,025 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:22:24,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:22:24,150 INFO L272 AbstractInterpreter]: Visited 22 different actions 174 times. Merged at 15 different actions 126 times. Widened at 13 different actions 59 times. Found 29 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:22:24,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:24,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:22:24,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:24,170 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 17:22:24,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:24,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:22:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:24,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:24,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:24,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:24,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 17:22:24,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:24,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:22:24,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:22:24,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:22:24,506 INFO L87 Difference]: Start difference. First operand 4523 states and 10470 transitions. Second operand 14 states. [2018-12-03 17:22:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:42,138 INFO L93 Difference]: Finished difference Result 11972 states and 27509 transitions. [2018-12-03 17:22:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:22:42,138 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 17:22:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:42,147 INFO L225 Difference]: With dead ends: 11972 [2018-12-03 17:22:42,147 INFO L226 Difference]: Without dead ends: 7450 [2018-12-03 17:22:42,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:22:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7450 states. [2018-12-03 17:22:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7450 to 5148. [2018-12-03 17:22:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5148 states. [2018-12-03 17:22:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 11945 transitions. [2018-12-03 17:22:50,991 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 11945 transitions. Word has length 24 [2018-12-03 17:22:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:50,991 INFO L480 AbstractCegarLoop]: Abstraction has 5148 states and 11945 transitions. [2018-12-03 17:22:50,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:22:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 11945 transitions. [2018-12-03 17:22:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:22:50,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:50,993 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 17:22:50,994 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:50,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:50,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1900063568, now seen corresponding path program 1 times [2018-12-03 17:22:50,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:50,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:50,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:50,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:50,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:51,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:51,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:51,467 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:22:51,467 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [120], [122], [128], [134], [142], [144], [148], [155], [162], [168], [203], [236], [245], [254], [260], [274], [349] [2018-12-03 17:22:51,468 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:22:51,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:22:51,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:22:51,603 INFO L272 AbstractInterpreter]: Visited 21 different actions 174 times. Merged at 17 different actions 136 times. Widened at 15 different actions 70 times. Found 19 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:22:51,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:51,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:22:51,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:51,639 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 17:22:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:51,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:22:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:51,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:51,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:51,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:51,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-12-03 17:22:51,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:51,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:22:51,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:22:51,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:22:51,932 INFO L87 Difference]: Start difference. First operand 5148 states and 11945 transitions. Second operand 14 states. [2018-12-03 17:23:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:10,507 INFO L93 Difference]: Finished difference Result 13475 states and 31313 transitions. [2018-12-03 17:23:10,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:23:10,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 17:23:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:10,517 INFO L225 Difference]: With dead ends: 13475 [2018-12-03 17:23:10,517 INFO L226 Difference]: Without dead ends: 8328 [2018-12-03 17:23:10,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=671, Invalid=1779, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:23:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2018-12-03 17:23:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 5834. [2018-12-03 17:23:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2018-12-03 17:23:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 13688 transitions. [2018-12-03 17:23:20,607 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 13688 transitions. Word has length 24 [2018-12-03 17:23:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:20,607 INFO L480 AbstractCegarLoop]: Abstraction has 5834 states and 13688 transitions. [2018-12-03 17:23:20,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:23:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 13688 transitions. [2018-12-03 17:23:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:23:20,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:20,610 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 17:23:20,610 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:20,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -563138598, now seen corresponding path program 1 times [2018-12-03 17:23:20,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:20,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:20,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:20,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:20,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:20,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:20,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:20,759 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:23:20,759 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [98], [113], [120], [122], [128], [134], [138], [142], [155], [162], [168], [203], [224], [236], [245], [247], [254], [260], [274], [292], [349] [2018-12-03 17:23:20,760 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:23:20,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:23:20,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:23:20,893 INFO L272 AbstractInterpreter]: Visited 24 different actions 212 times. Merged at 17 different actions 160 times. Widened at 15 different actions 81 times. Found 31 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 17:23:20,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:20,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:23:20,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:20,930 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 17:23:20,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:20,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:23:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:20,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:21,729 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-12-03 17:23:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:21,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:22,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:22,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2018-12-03 17:23:22,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:22,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:23:22,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:23:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:23:22,093 INFO L87 Difference]: Start difference. First operand 5834 states and 13688 transitions. Second operand 14 states. [2018-12-03 17:23:26,358 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:23:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:41,428 INFO L93 Difference]: Finished difference Result 13969 states and 32469 transitions. [2018-12-03 17:23:41,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:23:41,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 17:23:41,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:41,440 INFO L225 Difference]: With dead ends: 13969 [2018-12-03 17:23:41,440 INFO L226 Difference]: Without dead ends: 8136 [2018-12-03 17:23:41,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=730, Invalid=2026, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:23:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8136 states. [2018-12-03 17:23:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8136 to 5838. [2018-12-03 17:23:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5838 states. [2018-12-03 17:23:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 13680 transitions. [2018-12-03 17:23:52,064 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 13680 transitions. Word has length 24 [2018-12-03 17:23:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:52,064 INFO L480 AbstractCegarLoop]: Abstraction has 5838 states and 13680 transitions. [2018-12-03 17:23:52,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:23:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 13680 transitions. [2018-12-03 17:23:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:23:52,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:52,068 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:23:52,068 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:52,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1568457909, now seen corresponding path program 1 times [2018-12-03 17:23:52,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:52,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:52,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:52,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:52,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:23:52,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:52,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:52,377 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:23:52,377 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [113], [115], [120], [122], [126], [199], [203], [207], [224], [236], [245], [247], [254], [260], [274], [349] [2018-12-03 17:23:52,378 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:23:52,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:23:52,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:23:52,470 INFO L272 AbstractInterpreter]: Visited 20 different actions 149 times. Merged at 14 different actions 101 times. Widened at 10 different actions 39 times. Found 32 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:23:52,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:52,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:23:52,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:52,507 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 17:23:52,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:52,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:23:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:52,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:52,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:53,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:53,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2018-12-03 17:23:53,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:53,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:23:53,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:23:53,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:23:53,023 INFO L87 Difference]: Start difference. First operand 5838 states and 13680 transitions. Second operand 19 states. [2018-12-03 17:24:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:54,244 INFO L93 Difference]: Finished difference Result 25610 states and 59803 transitions. [2018-12-03 17:24:54,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2018-12-03 17:24:54,244 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 17:24:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:54,274 INFO L225 Difference]: With dead ends: 25610 [2018-12-03 17:24:54,274 INFO L226 Difference]: Without dead ends: 19773 [2018-12-03 17:24:54,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39201 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=8111, Invalid=83395, Unknown=0, NotChecked=0, Total=91506 [2018-12-03 17:24:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19773 states. [2018-12-03 17:25:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19773 to 10153. [2018-12-03 17:25:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10153 states. [2018-12-03 17:25:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10153 states to 10153 states and 23982 transitions. [2018-12-03 17:25:11,961 INFO L78 Accepts]: Start accepts. Automaton has 10153 states and 23982 transitions. Word has length 24 [2018-12-03 17:25:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:11,962 INFO L480 AbstractCegarLoop]: Abstraction has 10153 states and 23982 transitions. [2018-12-03 17:25:11,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:25:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 10153 states and 23982 transitions. [2018-12-03 17:25:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:25:11,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:11,965 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 17:25:11,965 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:11,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1340769778, now seen corresponding path program 1 times [2018-12-03 17:25:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:11,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:11,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:25:12,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:12,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:12,132 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:25:12,133 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [113], [120], [122], [126], [199], [203], [207], [224], [236], [245], [247], [254], [260], [264], [274], [349] [2018-12-03 17:25:12,134 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:25:12,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:25:12,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:25:12,223 INFO L272 AbstractInterpreter]: Visited 21 different actions 159 times. Merged at 15 different actions 110 times. Widened at 10 different actions 39 times. Found 32 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:25:12,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:12,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:25:12,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:12,250 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 17:25:12,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:12,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:25:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:12,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:12,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:12,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:12,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2018-12-03 17:25:12,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:12,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:25:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:25:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:25:12,521 INFO L87 Difference]: Start difference. First operand 10153 states and 23982 transitions. Second operand 19 states. [2018-12-03 17:26:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:08,608 INFO L93 Difference]: Finished difference Result 32679 states and 76382 transitions. [2018-12-03 17:26:08,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-12-03 17:26:08,608 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 17:26:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:08,639 INFO L225 Difference]: With dead ends: 32679 [2018-12-03 17:26:08,639 INFO L226 Difference]: Without dead ends: 22527 [2018-12-03 17:26:08,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8329 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2640, Invalid=20616, Unknown=0, NotChecked=0, Total=23256 [2018-12-03 17:26:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22527 states. [2018-12-03 17:26:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22527 to 11050. [2018-12-03 17:26:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2018-12-03 17:26:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 26107 transitions. [2018-12-03 17:26:28,789 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 26107 transitions. Word has length 24 [2018-12-03 17:26:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:28,789 INFO L480 AbstractCegarLoop]: Abstraction has 11050 states and 26107 transitions. [2018-12-03 17:26:28,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:26:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 26107 transitions. [2018-12-03 17:26:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:26:28,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:28,793 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 17:26:28,793 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:28,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1338856576, now seen corresponding path program 1 times [2018-12-03 17:26:28,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:28,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:28,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:28,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:28,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:26:28,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:28,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:28,901 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:26:28,901 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [94], [98], [102], [104], [110], [113], [115], [120], [126], [186], [192], [203], [229], [236], [245], [260], [264], [274], [292], [349] [2018-12-03 17:26:28,902 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:26:28,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:26:29,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:26:29,040 INFO L272 AbstractInterpreter]: Visited 24 different actions 243 times. Merged at 18 different actions 176 times. Widened at 15 different actions 83 times. Found 47 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:26:29,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:29,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:26:29,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:29,077 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 17:26:29,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:29,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:29,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:30,510 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-12-03 17:26:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:30,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:30,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:30,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-12-03 17:26:30,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:30,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:26:30,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:26:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:26:30,962 INFO L87 Difference]: Start difference. First operand 11050 states and 26107 transitions. Second operand 19 states. [2018-12-03 17:27:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:07,945 INFO L93 Difference]: Finished difference Result 26013 states and 60821 transitions. [2018-12-03 17:27:07,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:27:07,946 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 17:27:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:07,965 INFO L225 Difference]: With dead ends: 26013 [2018-12-03 17:27:07,965 INFO L226 Difference]: Without dead ends: 14964 [2018-12-03 17:27:07,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=790, Invalid=6016, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 17:27:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14964 states.