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_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:14:21,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:14:21,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:14:21,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:14:21,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:14:21,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:14:21,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:14:21,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:14:21,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:14:21,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:14:21,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:14:21,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:14:21,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:14:21,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:14:21,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:14:21,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:14:21,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:14:21,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:14:21,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:14:21,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:14:21,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:14:21,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:14:21,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:14:21,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:14:21,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:14:21,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:14:21,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:14:21,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:14:21,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:14:21,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:14:21,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:14:21,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:14:21,607 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:14:21,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:14:21,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:14:21,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:14:21,609 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:14:21,629 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:14:21,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:14:21,631 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:14:21,631 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:14:21,631 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:14:21,631 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:14:21,631 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:14:21,632 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:14:21,632 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:14:21,632 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:14:21,633 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:14:21,633 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:14:21,633 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:14:21,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:14:21,634 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:14:21,634 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:14:21,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:14:21,634 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:14:21,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:14:21,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:14:21,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:14:21,637 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:14:21,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:14:21,637 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:14:21,637 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:14:21,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:14:21,638 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:14:21,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:14:21,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:14:21,638 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:14:21,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:14:21,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:14:21,639 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:14:21,639 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:14:21,639 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:14:21,639 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:14:21,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:14:21,640 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:14:21,640 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:14:21,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:14:21,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:14:21,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:14:21,695 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:14:21,696 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:14:21,696 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-12-03 17:14:21,697 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-12-03 17:14:21,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:14:21,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:14:21,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:14:21,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:14:21,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:14:21,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,769 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:14:21,769 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:14:21,769 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:14:21,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:14:21,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:14:21,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:14:21,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:14:21,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/1) ... [2018-12-03 17:14:21,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:14:21,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:14:21,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:14:21,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:14:21,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (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:14:21,856 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 17:14:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 17:14:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 17:14:22,307 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:14:22,307 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:14:22,308 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:22 BoogieIcfgContainer [2018-12-03 17:14:22,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:14:22,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:14:22,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:14:22,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:14:22,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:14:21" (1/2) ... [2018-12-03 17:14:22,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182757eb and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:14:22, skipping insertion in model container [2018-12-03 17:14:22,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:14:22" (2/2) ... [2018-12-03 17:14:22,324 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-12-03 17:14:22,335 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:14:22,343 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-03 17:14:22,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-03 17:14:22,394 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:14:22,394 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:14:22,394 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:14:22,395 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:14:22,395 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:14:22,395 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:14:22,395 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:14:22,395 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:14:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 17:14:22,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:14:22,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:22,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:14:22,420 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:22,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-12-03 17:14:22,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:22,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:22,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:22,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:14:22,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:22,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:14:22,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:22,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:14:22,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:14:22,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:14:22,665 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-12-03 17:14:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:23,182 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-12-03 17:14:23,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:14:23,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 17:14:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:23,200 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:14:23,200 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:14:23,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:14:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:14:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-03 17:14:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:14:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-12-03 17:14:23,245 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-12-03 17:14:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:23,245 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-12-03 17:14:23,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:14:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-12-03 17:14:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:14:23,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:23,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:14:23,247 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:23,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:23,248 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-12-03 17:14:23,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:23,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:23,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:23,495 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,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:23,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:14:23,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:23,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:14:23,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:14:23,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:14:23,500 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-12-03 17:14:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:23,865 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-12-03 17:14:23,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:14:23,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 17:14:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:23,867 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:14:23,867 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:14:23,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:14:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:14:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-12-03 17:14:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:14:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-12-03 17:14:23,877 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-12-03 17:14:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:23,878 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-12-03 17:14:23,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:14:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-12-03 17:14:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:14:23,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:23,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:14:23,880 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:23,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-12-03 17:14:23,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:23,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:23,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:23,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:24,009 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:24,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:24,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:14:24,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:24,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:14:24,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:14:24,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:14:24,012 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-12-03 17:14:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:24,686 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-12-03 17:14:24,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:14:24,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 17:14:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:24,688 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:14:24,688 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:14:24,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:14:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:14:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-12-03 17:14:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:14:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-12-03 17:14:24,708 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-12-03 17:14:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:24,709 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-12-03 17:14:24,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:14:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-12-03 17:14:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:14:24,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:24,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:14:24,711 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:24,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-12-03 17:14:24,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:24,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:24,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:24,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:24,770 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:24,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:24,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:14:24,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:24,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:14:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:14:24,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:14:24,772 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-12-03 17:14:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:25,038 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-12-03 17:14:25,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:14:25,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 17:14:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:25,040 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:14:25,040 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:14:25,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:14:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-12-03 17:14:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:14:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-12-03 17:14:25,053 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-12-03 17:14:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:25,054 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-12-03 17:14:25,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:14:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-12-03 17:14:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:25,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:25,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:25,055 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:25,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-12-03 17:14:25,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:25,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:25,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:25,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:25,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:25,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:25,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:25,251 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:14:25,252 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46] [2018-12-03 17:14:25,308 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:25,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:25,437 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:25,438 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:25,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:25,448 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:25,615 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 47.02% of their original sizes. [2018-12-03 17:14:25,615 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:25,880 INFO L418 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2018-12-03 17:14:25,880 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:25,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:25,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-12-03 17:14:25,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:25,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:25,884 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 9 states. [2018-12-03 17:14:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:28,109 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2018-12-03 17:14:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:28,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 17:14:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:28,111 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:14:28,111 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:14:28,112 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:14:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:14:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2018-12-03 17:14:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:14:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2018-12-03 17:14:28,127 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 85 transitions. Word has length 8 [2018-12-03 17:14:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:28,127 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 85 transitions. [2018-12-03 17:14:28,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2018-12-03 17:14:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:28,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:28,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:28,129 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:28,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-12-03 17:14:28,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:28,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:28,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:28,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:28,326 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:28,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:28,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:14:28,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:28,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:28,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:28,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:28,329 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. Second operand 8 states. [2018-12-03 17:14:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:29,019 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2018-12-03 17:14:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:29,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:14:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:29,028 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:14:29,028 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:14:29,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:14:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2018-12-03 17:14:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:14:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 118 transitions. [2018-12-03 17:14:29,061 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 118 transitions. Word has length 8 [2018-12-03 17:14:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:29,061 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 118 transitions. [2018-12-03 17:14:29,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 118 transitions. [2018-12-03 17:14:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:29,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:29,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:29,064 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:29,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:29,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-12-03 17:14:29,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:29,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:29,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:29,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:29,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:29,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:29,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:29,234 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:14:29,235 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [45], [47], [50] [2018-12-03 17:14:29,237 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:29,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:29,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:29,276 INFO L272 AbstractInterpreter]: Visited 8 different actions 26 times. Merged at 5 different actions 17 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:29,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:29,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:29,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:29,319 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:14:29,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:29,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:29,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:29,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:30,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:30,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2018-12-03 17:14:30,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:30,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:14:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:14:30,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:30,175 INFO L87 Difference]: Start difference. First operand 69 states and 118 transitions. Second operand 13 states. [2018-12-03 17:14:31,855 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-03 17:14:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:33,322 INFO L93 Difference]: Finished difference Result 130 states and 207 transitions. [2018-12-03 17:14:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:14:33,322 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-03 17:14:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:33,325 INFO L225 Difference]: With dead ends: 130 [2018-12-03 17:14:33,325 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 17:14:33,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=422, Invalid=1300, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:14:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 17:14:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2018-12-03 17:14:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 17:14:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 150 transitions. [2018-12-03 17:14:33,362 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 150 transitions. Word has length 8 [2018-12-03 17:14:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:33,363 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 150 transitions. [2018-12-03 17:14:33,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:14:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 150 transitions. [2018-12-03 17:14:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:33,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:33,364 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:33,364 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:33,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-12-03 17:14:33,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:33,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:33,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:33,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:33,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:33,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:33,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:33,442 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:14:33,442 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [45], [46], [47], [50] [2018-12-03 17:14:33,444 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:33,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:33,476 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:33,476 INFO L272 AbstractInterpreter]: Visited 7 different actions 27 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:33,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:33,504 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:33,518 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 57.14% of their original sizes. [2018-12-03 17:14:33,518 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:33,629 INFO L418 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2018-12-03 17:14:33,630 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:33,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:33,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2018-12-03 17:14:33,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:33,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:33,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:33,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:33,632 INFO L87 Difference]: Start difference. First operand 87 states and 150 transitions. Second operand 9 states. [2018-12-03 17:14:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:34,363 INFO L93 Difference]: Finished difference Result 114 states and 198 transitions. [2018-12-03 17:14:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:14:34,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 17:14:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:34,364 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:14:34,365 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:14:34,365 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:14:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2018-12-03 17:14:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:14:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 162 transitions. [2018-12-03 17:14:34,398 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 162 transitions. Word has length 8 [2018-12-03 17:14:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:34,398 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 162 transitions. [2018-12-03 17:14:34,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 162 transitions. [2018-12-03 17:14:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:34,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:34,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:34,400 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:34,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-12-03 17:14:34,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:34,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:34,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:34,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:34,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:34,539 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:14:34,539 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [17], [25], [26] [2018-12-03 17:14:34,541 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:34,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:34,551 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:34,551 INFO L272 AbstractInterpreter]: Visited 8 different actions 13 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:34,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:34,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:34,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:34,586 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:14:34,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:34,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:34,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:35,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:35,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:35,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-12-03 17:14:35,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:35,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:14:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:14:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:35,829 INFO L87 Difference]: Start difference. First operand 93 states and 162 transitions. Second operand 12 states. [2018-12-03 17:14:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:36,605 INFO L93 Difference]: Finished difference Result 189 states and 321 transitions. [2018-12-03 17:14:36,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:36,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-03 17:14:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:36,607 INFO L225 Difference]: With dead ends: 189 [2018-12-03 17:14:36,607 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 17:14:36,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:14:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 17:14:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 147. [2018-12-03 17:14:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 17:14:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 260 transitions. [2018-12-03 17:14:36,638 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 260 transitions. Word has length 8 [2018-12-03 17:14:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:36,639 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 260 transitions. [2018-12-03 17:14:36,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:14:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 260 transitions. [2018-12-03 17:14:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:36,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:36,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:36,640 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:36,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-12-03 17:14:36,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:36,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:36,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:36,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:36,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:36,716 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:14:36,716 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [45], [46] [2018-12-03 17:14:36,717 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:36,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:36,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:36,738 INFO L272 AbstractInterpreter]: Visited 8 different actions 26 times. Merged at 5 different actions 17 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:36,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:36,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:36,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:36,746 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:14:36,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:36,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:36,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:36,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:36,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:36,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 17:14:36,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:36,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:14:36,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:14:36,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:36,928 INFO L87 Difference]: Start difference. First operand 147 states and 260 transitions. Second operand 10 states. [2018-12-03 17:14:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:37,900 INFO L93 Difference]: Finished difference Result 209 states and 352 transitions. [2018-12-03 17:14:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:37,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-03 17:14:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:37,904 INFO L225 Difference]: With dead ends: 209 [2018-12-03 17:14:37,905 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 17:14:37,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:14:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 17:14:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 168. [2018-12-03 17:14:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 17:14:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 300 transitions. [2018-12-03 17:14:37,958 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 300 transitions. Word has length 8 [2018-12-03 17:14:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:37,959 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 300 transitions. [2018-12-03 17:14:37,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:14:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 300 transitions. [2018-12-03 17:14:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:37,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:37,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:37,960 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:37,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-12-03 17:14:37,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:37,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:37,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:37,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:37,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:38,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:38,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:38,028 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:14:38,028 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [26], [36], [38], [43] [2018-12-03 17:14:38,029 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:38,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:38,058 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:38,058 INFO L272 AbstractInterpreter]: Visited 8 different actions 30 times. Merged at 6 different actions 21 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:38,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:38,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:38,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:38,090 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:14:38,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:38,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:38,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:38,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:38,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:38,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 17:14:38,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:38,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:38,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:38,324 INFO L87 Difference]: Start difference. First operand 168 states and 300 transitions. Second operand 7 states. [2018-12-03 17:14:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:38,812 INFO L93 Difference]: Finished difference Result 215 states and 373 transitions. [2018-12-03 17:14:38,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:14:38,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:38,814 INFO L225 Difference]: With dead ends: 215 [2018-12-03 17:14:38,814 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 17:14:38,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 17:14:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 177. [2018-12-03 17:14:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 17:14:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 317 transitions. [2018-12-03 17:14:38,868 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 317 transitions. Word has length 8 [2018-12-03 17:14:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:38,869 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 317 transitions. [2018-12-03 17:14:38,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 317 transitions. [2018-12-03 17:14:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:38,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:38,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:38,872 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:38,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-12-03 17:14:38,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:38,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:38,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:38,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:38,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:38,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:38,998 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:14:38,998 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [45], [47], [50] [2018-12-03 17:14:39,000 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:39,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:39,006 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:39,007 INFO L272 AbstractInterpreter]: Visited 8 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:39,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:39,012 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:39,024 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 47.02% of their original sizes. [2018-12-03 17:14:39,025 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:39,092 INFO L418 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2018-12-03 17:14:39,092 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:39,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:39,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-12-03 17:14:39,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:39,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:39,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:39,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:39,093 INFO L87 Difference]: Start difference. First operand 177 states and 317 transitions. Second operand 9 states. [2018-12-03 17:14:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:41,049 INFO L93 Difference]: Finished difference Result 205 states and 366 transitions. [2018-12-03 17:14:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:41,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 17:14:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:41,051 INFO L225 Difference]: With dead ends: 205 [2018-12-03 17:14:41,051 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 17:14:41,052 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:14:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 17:14:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 190. [2018-12-03 17:14:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 17:14:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 340 transitions. [2018-12-03 17:14:41,098 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 340 transitions. Word has length 8 [2018-12-03 17:14:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:41,098 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 340 transitions. [2018-12-03 17:14:41,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 340 transitions. [2018-12-03 17:14:41,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:41,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:41,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:41,099 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:41,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:41,100 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-12-03 17:14:41,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:41,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:41,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:41,176 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:41,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:41,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:41,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:41,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:41,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:41,178 INFO L87 Difference]: Start difference. First operand 190 states and 340 transitions. Second operand 7 states. [2018-12-03 17:14:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:41,563 INFO L93 Difference]: Finished difference Result 276 states and 487 transitions. [2018-12-03 17:14:41,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:41,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:41,565 INFO L225 Difference]: With dead ends: 276 [2018-12-03 17:14:41,565 INFO L226 Difference]: Without dead ends: 274 [2018-12-03 17:14:41,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-03 17:14:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 228. [2018-12-03 17:14:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-03 17:14:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 407 transitions. [2018-12-03 17:14:41,623 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 407 transitions. Word has length 8 [2018-12-03 17:14:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:41,623 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 407 transitions. [2018-12-03 17:14:41,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 407 transitions. [2018-12-03 17:14:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:14:41,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:41,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:41,624 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:41,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-12-03 17:14:41,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:41,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:41,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:41,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:41,703 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 17:14:41,703 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [25], [27], [32] [2018-12-03 17:14:41,705 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:41,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:41,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:41,712 INFO L272 AbstractInterpreter]: Visited 8 different actions 13 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:41,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:41,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:41,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:41,718 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:14:41,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:41,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:41,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:41,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:41,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:41,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 17:14:41,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:41,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:41,859 INFO L87 Difference]: Start difference. First operand 228 states and 407 transitions. Second operand 7 states. [2018-12-03 17:14:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:42,301 INFO L93 Difference]: Finished difference Result 368 states and 660 transitions. [2018-12-03 17:14:42,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:14:42,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 17:14:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:42,304 INFO L225 Difference]: With dead ends: 368 [2018-12-03 17:14:42,304 INFO L226 Difference]: Without dead ends: 366 [2018-12-03 17:14:42,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-03 17:14:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 303. [2018-12-03 17:14:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-03 17:14:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 546 transitions. [2018-12-03 17:14:42,401 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 546 transitions. Word has length 8 [2018-12-03 17:14:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:42,402 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 546 transitions. [2018-12-03 17:14:42,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 546 transitions. [2018-12-03 17:14:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:42,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:42,403 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:42,403 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:42,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-12-03 17:14:42,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:42,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:42,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:42,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:42,491 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:14:42,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:42,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:42,491 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:42,492 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [50] [2018-12-03 17:14:42,493 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:42,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:42,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:42,527 INFO L272 AbstractInterpreter]: Visited 10 different actions 44 times. Merged at 7 different actions 27 times. Widened at 1 different actions 4 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:42,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:42,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:42,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:42,553 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:14:42,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:42,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:42,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:42,623 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:14:42,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:42,663 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:14:42,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:42,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 17:14:42,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:42,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:14:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:14:42,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:14:42,684 INFO L87 Difference]: Start difference. First operand 303 states and 546 transitions. Second operand 10 states. [2018-12-03 17:14:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:43,886 INFO L93 Difference]: Finished difference Result 503 states and 892 transitions. [2018-12-03 17:14:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:43,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 17:14:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:43,890 INFO L225 Difference]: With dead ends: 503 [2018-12-03 17:14:43,890 INFO L226 Difference]: Without dead ends: 501 [2018-12-03 17:14:43,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:14:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-12-03 17:14:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 381. [2018-12-03 17:14:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 17:14:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 689 transitions. [2018-12-03 17:14:43,989 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 689 transitions. Word has length 11 [2018-12-03 17:14:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:43,990 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 689 transitions. [2018-12-03 17:14:43,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:14:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 689 transitions. [2018-12-03 17:14:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:43,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:43,991 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:43,991 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:43,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-12-03 17:14:43,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:43,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:43,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:44,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:44,171 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:44,171 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 17:14:44,172 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:44,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:44,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:44,208 INFO L272 AbstractInterpreter]: Visited 10 different actions 30 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:44,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:44,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:44,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:44,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:44,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:44,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:44,324 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,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:44,412 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,432 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:44,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 17 [2018-12-03 17:14:44,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:44,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:44,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:44,433 INFO L87 Difference]: Start difference. First operand 381 states and 689 transitions. Second operand 7 states. [2018-12-03 17:14:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:45,586 INFO L93 Difference]: Finished difference Result 818 states and 1449 transitions. [2018-12-03 17:14:45,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:45,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 17:14:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:45,589 INFO L225 Difference]: With dead ends: 818 [2018-12-03 17:14:45,589 INFO L226 Difference]: Without dead ends: 492 [2018-12-03 17:14:45,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:14:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-12-03 17:14:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 409. [2018-12-03 17:14:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-03 17:14:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 734 transitions. [2018-12-03 17:14:45,735 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 734 transitions. Word has length 11 [2018-12-03 17:14:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:45,735 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 734 transitions. [2018-12-03 17:14:45,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 734 transitions. [2018-12-03 17:14:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:45,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:45,736 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:45,737 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:45,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash 707063270, now seen corresponding path program 1 times [2018-12-03 17:14:45,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:45,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:45,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:45,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:45,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:46,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:46,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:46,475 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:46,476 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [50] [2018-12-03 17:14:46,477 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:46,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:46,504 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 17:14:46,504 INFO L272 AbstractInterpreter]: Visited 10 different actions 40 times. Merged at 6 different actions 21 times. Widened at 1 different actions 3 times. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:46,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:46,519 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 17:14:46,532 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 42.92% of their original sizes. [2018-12-03 17:14:46,533 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 17:14:46,677 INFO L418 sIntCurrentIteration]: We unified 10 AI predicates to 10 [2018-12-03 17:14:46,677 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 17:14:46,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:14:46,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 18 [2018-12-03 17:14:46,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:46,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:14:46,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:14:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:46,681 INFO L87 Difference]: Start difference. First operand 409 states and 734 transitions. Second operand 12 states. [2018-12-03 17:14:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:49,691 INFO L93 Difference]: Finished difference Result 513 states and 919 transitions. [2018-12-03 17:14:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:14:49,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 17:14:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:49,694 INFO L225 Difference]: With dead ends: 513 [2018-12-03 17:14:49,694 INFO L226 Difference]: Without dead ends: 509 [2018-12-03 17:14:49,695 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:14:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-03 17:14:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 461. [2018-12-03 17:14:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-12-03 17:14:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 824 transitions. [2018-12-03 17:14:49,838 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 824 transitions. Word has length 11 [2018-12-03 17:14:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:49,838 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 824 transitions. [2018-12-03 17:14:49,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:14:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 824 transitions. [2018-12-03 17:14:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:49,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:49,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:49,840 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:49,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-12-03 17:14:49,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:49,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:49,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:49,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:49,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 17:14:49,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:49,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:49,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:49,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:49,953 INFO L87 Difference]: Start difference. First operand 461 states and 824 transitions. Second operand 8 states. [2018-12-03 17:14:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:50,575 INFO L93 Difference]: Finished difference Result 577 states and 1011 transitions. [2018-12-03 17:14:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:50,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 17:14:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:50,578 INFO L225 Difference]: With dead ends: 577 [2018-12-03 17:14:50,579 INFO L226 Difference]: Without dead ends: 575 [2018-12-03 17:14:50,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:14:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-12-03 17:14:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 467. [2018-12-03 17:14:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-12-03 17:14:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 828 transitions. [2018-12-03 17:14:50,711 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 828 transitions. Word has length 11 [2018-12-03 17:14:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:50,712 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 828 transitions. [2018-12-03 17:14:50,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 828 transitions. [2018-12-03 17:14:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:50,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:50,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:50,713 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:50,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-12-03 17:14:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:50,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:50,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:50,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:50,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:50,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:50,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:14:50,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:50,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:14:50,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:14:50,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:14:50,812 INFO L87 Difference]: Start difference. First operand 467 states and 828 transitions. Second operand 8 states. [2018-12-03 17:14:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:51,203 INFO L93 Difference]: Finished difference Result 519 states and 899 transitions. [2018-12-03 17:14:51,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:51,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 17:14:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:51,206 INFO L225 Difference]: With dead ends: 519 [2018-12-03 17:14:51,206 INFO L226 Difference]: Without dead ends: 517 [2018-12-03 17:14:51,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:14:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-12-03 17:14:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 457. [2018-12-03 17:14:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-12-03 17:14:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 810 transitions. [2018-12-03 17:14:51,343 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 810 transitions. Word has length 11 [2018-12-03 17:14:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:51,344 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 810 transitions. [2018-12-03 17:14:51,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:14:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 810 transitions. [2018-12-03 17:14:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:51,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:51,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:51,345 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:51,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:51,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-12-03 17:14:51,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:51,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:51,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:51,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:51,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:51,424 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:51,424 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [36], [37], [45], [47], [50] [2018-12-03 17:14:51,425 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:51,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:51,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:51,444 INFO L272 AbstractInterpreter]: Visited 11 different actions 35 times. Merged at 7 different actions 21 times. Widened at 1 different actions 3 times. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:51,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:51,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:51,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:51,447 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:14:51,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:51,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:51,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:51,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:51,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:51,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-12-03 17:14:51,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:51,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:51,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:14:51,587 INFO L87 Difference]: Start difference. First operand 457 states and 810 transitions. Second operand 9 states. [2018-12-03 17:14:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:52,207 INFO L93 Difference]: Finished difference Result 532 states and 928 transitions. [2018-12-03 17:14:52,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:14:52,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-03 17:14:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:52,210 INFO L225 Difference]: With dead ends: 532 [2018-12-03 17:14:52,210 INFO L226 Difference]: Without dead ends: 530 [2018-12-03 17:14:52,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:14:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-12-03 17:14:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 461. [2018-12-03 17:14:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-12-03 17:14:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 816 transitions. [2018-12-03 17:14:52,368 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 816 transitions. Word has length 11 [2018-12-03 17:14:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:52,368 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 816 transitions. [2018-12-03 17:14:52,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 816 transitions. [2018-12-03 17:14:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:52,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:52,369 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:52,370 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:52,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-12-03 17:14:52,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:52,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:52,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:52,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:52,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:52,683 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:14:52,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:52,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:52,684 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:52,684 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [45], [46], [47], [50] [2018-12-03 17:14:52,685 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:52,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:52,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:52,707 INFO L272 AbstractInterpreter]: Visited 10 different actions 40 times. Merged at 7 different actions 24 times. Widened at 1 different actions 3 times. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:52,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:52,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:52,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:52,723 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:14:52,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:52,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:52,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:52,861 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:14:52,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:52,956 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:14:52,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:52,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 16 [2018-12-03 17:14:52,976 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:52,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:14:52,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:14:52,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:14:52,977 INFO L87 Difference]: Start difference. First operand 461 states and 816 transitions. Second operand 13 states. [2018-12-03 17:14:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:54,482 INFO L93 Difference]: Finished difference Result 623 states and 1070 transitions. [2018-12-03 17:14:54,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:54,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-12-03 17:14:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:54,485 INFO L225 Difference]: With dead ends: 623 [2018-12-03 17:14:54,485 INFO L226 Difference]: Without dead ends: 621 [2018-12-03 17:14:54,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:14:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-12-03 17:14:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 505. [2018-12-03 17:14:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-12-03 17:14:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 896 transitions. [2018-12-03 17:14:54,663 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 896 transitions. Word has length 11 [2018-12-03 17:14:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:54,664 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 896 transitions. [2018-12-03 17:14:54,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:14:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 896 transitions. [2018-12-03 17:14:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:54,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:54,665 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:54,665 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:54,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-12-03 17:14:54,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:54,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:54,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:54,732 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:14:54,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:54,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:54,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:54,733 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:14:54,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:54,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 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:14:54,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:54,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:54,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:14:54,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:54,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:54,755 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:14:54,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:54,835 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:14:54,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:54,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 17:14:54,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:54,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:54,856 INFO L87 Difference]: Start difference. First operand 505 states and 896 transitions. Second operand 7 states. [2018-12-03 17:14:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:55,349 INFO L93 Difference]: Finished difference Result 602 states and 1047 transitions. [2018-12-03 17:14:55,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:55,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 17:14:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:55,353 INFO L225 Difference]: With dead ends: 602 [2018-12-03 17:14:55,354 INFO L226 Difference]: Without dead ends: 600 [2018-12-03 17:14:55,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-12-03 17:14:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 508. [2018-12-03 17:14:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-12-03 17:14:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 903 transitions. [2018-12-03 17:14:55,493 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 903 transitions. Word has length 11 [2018-12-03 17:14:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:55,493 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 903 transitions. [2018-12-03 17:14:55,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 903 transitions. [2018-12-03 17:14:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:55,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:55,494 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:55,494 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:55,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-12-03 17:14:55,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:55,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:55,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:55,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:55,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:55,556 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:55,556 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [45], [47], [50], [52] [2018-12-03 17:14:55,557 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:55,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:55,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:55,559 INFO L272 AbstractInterpreter]: Visited 9 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:55,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:55,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:55,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:55,567 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:14:55,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:55,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:55,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:55,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:55,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:55,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 17:14:55,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:55,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:55,646 INFO L87 Difference]: Start difference. First operand 508 states and 903 transitions. Second operand 7 states. [2018-12-03 17:14:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:56,228 INFO L93 Difference]: Finished difference Result 626 states and 1096 transitions. [2018-12-03 17:14:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:14:56,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 17:14:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:56,231 INFO L225 Difference]: With dead ends: 626 [2018-12-03 17:14:56,231 INFO L226 Difference]: Without dead ends: 624 [2018-12-03 17:14:56,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-12-03 17:14:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 541. [2018-12-03 17:14:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-12-03 17:14:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 962 transitions. [2018-12-03 17:14:56,387 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 962 transitions. Word has length 11 [2018-12-03 17:14:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:56,388 INFO L480 AbstractCegarLoop]: Abstraction has 541 states and 962 transitions. [2018-12-03 17:14:56,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 962 transitions. [2018-12-03 17:14:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:56,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:56,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:56,389 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:56,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-12-03 17:14:56,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:56,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:56,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:56,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:56,498 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:56,498 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [38], [41], [45], [46] [2018-12-03 17:14:56,500 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:56,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:56,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:56,519 INFO L272 AbstractInterpreter]: Visited 11 different actions 36 times. Merged at 7 different actions 23 times. Widened at 1 different actions 3 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:14:56,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:56,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:56,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:56,532 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:14:56,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:56,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:56,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:56,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:56,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:56,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 17:14:56,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:56,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:56,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:56,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:56,616 INFO L87 Difference]: Start difference. First operand 541 states and 962 transitions. Second operand 7 states. [2018-12-03 17:14:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:57,022 INFO L93 Difference]: Finished difference Result 587 states and 1025 transitions. [2018-12-03 17:14:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:14:57,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 17:14:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:57,024 INFO L225 Difference]: With dead ends: 587 [2018-12-03 17:14:57,025 INFO L226 Difference]: Without dead ends: 585 [2018-12-03 17:14:57,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:14:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-12-03 17:14:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 546. [2018-12-03 17:14:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-12-03 17:14:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 969 transitions. [2018-12-03 17:14:57,160 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 969 transitions. Word has length 11 [2018-12-03 17:14:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:57,160 INFO L480 AbstractCegarLoop]: Abstraction has 546 states and 969 transitions. [2018-12-03 17:14:57,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 969 transitions. [2018-12-03 17:14:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:57,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:57,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:57,161 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:57,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-12-03 17:14:57,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:57,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:57,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:57,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:57,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:57,236 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:57,236 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [25], [27], [30], [45], [47], [52] [2018-12-03 17:14:57,237 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:57,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:57,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:57,242 INFO L272 AbstractInterpreter]: Visited 11 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:14:57,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:57,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:57,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:57,255 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:14:57,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:57,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:57,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:57,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:57,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:57,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 17:14:57,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:57,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:57,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:57,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:57,321 INFO L87 Difference]: Start difference. First operand 546 states and 969 transitions. Second operand 7 states. [2018-12-03 17:14:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:57,902 INFO L93 Difference]: Finished difference Result 614 states and 1073 transitions. [2018-12-03 17:14:57,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:14:57,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 17:14:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:57,905 INFO L225 Difference]: With dead ends: 614 [2018-12-03 17:14:57,905 INFO L226 Difference]: Without dead ends: 612 [2018-12-03 17:14:57,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:14:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-03 17:14:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 523. [2018-12-03 17:14:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-12-03 17:14:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 925 transitions. [2018-12-03 17:14:58,040 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 925 transitions. Word has length 11 [2018-12-03 17:14:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:58,041 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 925 transitions. [2018-12-03 17:14:58,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 925 transitions. [2018-12-03 17:14:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:14:58,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:58,042 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:58,042 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:58,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-12-03 17:14:58,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:58,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:58,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:58,102 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 17:14:58,102 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [25], [27], [30], [32] [2018-12-03 17:14:58,103 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:58,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:58,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:58,108 INFO L272 AbstractInterpreter]: Visited 9 different actions 15 times. Merged at 5 different actions 5 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:14:58,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:58,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:58,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:58,109 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:14:58,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:58,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:58,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:58,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:58,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:58,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 17:14:58,167 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:58,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:58,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:58,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:58,168 INFO L87 Difference]: Start difference. First operand 523 states and 925 transitions. Second operand 7 states. [2018-12-03 17:14:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:58,668 INFO L93 Difference]: Finished difference Result 592 states and 1033 transitions. [2018-12-03 17:14:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:14:58,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 17:14:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:58,670 INFO L225 Difference]: With dead ends: 592 [2018-12-03 17:14:58,670 INFO L226 Difference]: Without dead ends: 590 [2018-12-03 17:14:58,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:14:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-12-03 17:14:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 514. [2018-12-03 17:14:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-12-03 17:14:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 904 transitions. [2018-12-03 17:14:58,804 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 904 transitions. Word has length 11 [2018-12-03 17:14:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:58,804 INFO L480 AbstractCegarLoop]: Abstraction has 514 states and 904 transitions. [2018-12-03 17:14:58,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 904 transitions. [2018-12-03 17:14:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:58,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:58,805 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:58,805 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:58,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1730496153, now seen corresponding path program 1 times [2018-12-03 17:14:58,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:58,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:58,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:58,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:58,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:58,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:58,927 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 17:14:58,928 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [52] [2018-12-03 17:14:58,928 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:58,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:58,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:58,958 INFO L272 AbstractInterpreter]: Visited 10 different actions 50 times. Merged at 8 different actions 33 times. Widened at 2 different actions 5 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:14:58,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:58,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:58,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:58,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 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:14:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:59,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:59,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:59,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:59,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:14:59,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 16 [2018-12-03 17:14:59,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:59,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:14:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:14:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:14:59,275 INFO L87 Difference]: Start difference. First operand 514 states and 904 transitions. Second operand 7 states. [2018-12-03 17:14:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:59,583 INFO L93 Difference]: Finished difference Result 1037 states and 1819 transitions. [2018-12-03 17:14:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:14:59,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 17:14:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:59,589 INFO L225 Difference]: With dead ends: 1037 [2018-12-03 17:14:59,589 INFO L226 Difference]: Without dead ends: 612 [2018-12-03 17:14:59,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-03 17:14:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 568. [2018-12-03 17:14:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-03 17:14:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 990 transitions. [2018-12-03 17:14:59,782 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 990 transitions. Word has length 12 [2018-12-03 17:14:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:59,782 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 990 transitions. [2018-12-03 17:14:59,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:14:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 990 transitions. [2018-12-03 17:14:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:14:59,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:59,783 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:14:59,783 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:59,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-12-03 17:14:59,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:59,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:59,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:59,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:59,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:59,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:59,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:59,869 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 17:14:59,870 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [43], [45], [47], [52] [2018-12-03 17:14:59,871 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:59,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:59,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:59,898 INFO L272 AbstractInterpreter]: Visited 11 different actions 44 times. Merged at 9 different actions 32 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:14:59,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:59,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:59,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:59,934 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:14:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:59,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:59,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:00,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:00,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:00,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-12-03 17:15:00,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:00,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:15:00,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:15:00,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:00,298 INFO L87 Difference]: Start difference. First operand 568 states and 990 transitions. Second operand 12 states. [2018-12-03 17:15:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:01,364 INFO L93 Difference]: Finished difference Result 929 states and 1611 transitions. [2018-12-03 17:15:01,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:15:01,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:15:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:01,368 INFO L225 Difference]: With dead ends: 929 [2018-12-03 17:15:01,368 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 17:15:01,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:15:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 17:15:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 715. [2018-12-03 17:15:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-12-03 17:15:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1257 transitions. [2018-12-03 17:15:01,562 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1257 transitions. Word has length 12 [2018-12-03 17:15:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:01,562 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1257 transitions. [2018-12-03 17:15:01,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:15:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1257 transitions. [2018-12-03 17:15:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:15:01,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:01,563 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:01,563 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:01,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:01,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-12-03 17:15:01,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:01,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:01,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:01,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:01,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:01,670 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:15:01,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:01,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:01,671 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 17:15:01,671 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [32], [36], [37] [2018-12-03 17:15:01,671 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:01,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:01,677 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:01,677 INFO L272 AbstractInterpreter]: Visited 9 different actions 18 times. Merged at 5 different actions 7 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:15:01,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:01,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:01,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:01,682 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:15:01,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:01,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:01,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:01,760 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:15:01,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:01,848 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:15:01,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:01,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 17:15:01,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:01,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:15:01,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:15:01,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:15:01,869 INFO L87 Difference]: Start difference. First operand 715 states and 1257 transitions. Second operand 13 states. [2018-12-03 17:15:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:04,178 INFO L93 Difference]: Finished difference Result 1262 states and 2208 transitions. [2018-12-03 17:15:04,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:15:04,179 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 17:15:04,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:04,184 INFO L225 Difference]: With dead ends: 1262 [2018-12-03 17:15:04,184 INFO L226 Difference]: Without dead ends: 1260 [2018-12-03 17:15:04,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:15:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2018-12-03 17:15:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 927. [2018-12-03 17:15:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-12-03 17:15:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1628 transitions. [2018-12-03 17:15:04,435 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1628 transitions. Word has length 12 [2018-12-03 17:15:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:04,435 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 1628 transitions. [2018-12-03 17:15:04,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:15:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1628 transitions. [2018-12-03 17:15:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:15:04,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:04,436 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:04,437 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:04,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1489044045, now seen corresponding path program 1 times [2018-12-03 17:15:04,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:04,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:04,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:04,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:04,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:04,557 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:15:04,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:04,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:04,558 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 17:15:04,558 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [27], [30], [36], [38], [41], [43] [2018-12-03 17:15:04,559 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:04,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:04,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:04,579 INFO L272 AbstractInterpreter]: Visited 11 different actions 32 times. Merged at 5 different actions 21 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:15:04,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:04,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:04,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:04,614 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:15:04,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:04,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:04,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:04,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:05,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:05,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2018-12-03 17:15:05,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:05,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:15:05,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:15:05,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:05,032 INFO L87 Difference]: Start difference. First operand 927 states and 1628 transitions. Second operand 12 states. [2018-12-03 17:15:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:05,988 INFO L93 Difference]: Finished difference Result 1063 states and 1850 transitions. [2018-12-03 17:15:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:15:05,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 17:15:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:05,992 INFO L225 Difference]: With dead ends: 1063 [2018-12-03 17:15:05,992 INFO L226 Difference]: Without dead ends: 1061 [2018-12-03 17:15:05,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:15:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-12-03 17:15:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 917. [2018-12-03 17:15:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2018-12-03 17:15:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1614 transitions. [2018-12-03 17:15:06,279 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1614 transitions. Word has length 14 [2018-12-03 17:15:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:06,279 INFO L480 AbstractCegarLoop]: Abstraction has 917 states and 1614 transitions. [2018-12-03 17:15:06,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:15:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1614 transitions. [2018-12-03 17:15:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:15:06,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:06,281 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:06,281 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:06,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash -397032175, now seen corresponding path program 2 times [2018-12-03 17:15:06,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:06,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:06,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:06,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:06,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:06,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:06,388 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:06,388 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:15:06,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:06,389 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:15:06,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:06,400 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:06,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:15:06,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:06,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:06,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:06,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:06,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 17:15:06,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:06,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:15:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:15:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:15:06,526 INFO L87 Difference]: Start difference. First operand 917 states and 1614 transitions. Second operand 11 states. [2018-12-03 17:15:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:07,613 INFO L93 Difference]: Finished difference Result 1118 states and 1952 transitions. [2018-12-03 17:15:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:15:07,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 17:15:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:07,618 INFO L225 Difference]: With dead ends: 1118 [2018-12-03 17:15:07,618 INFO L226 Difference]: Without dead ends: 1114 [2018-12-03 17:15:07,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:15:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2018-12-03 17:15:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 951. [2018-12-03 17:15:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-12-03 17:15:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1674 transitions. [2018-12-03 17:15:07,895 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1674 transitions. Word has length 14 [2018-12-03 17:15:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:07,895 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1674 transitions. [2018-12-03 17:15:07,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:15:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1674 transitions. [2018-12-03 17:15:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:15:07,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:07,897 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:07,897 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:07,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:07,897 INFO L82 PathProgramCache]: Analyzing trace with hash -397031887, now seen corresponding path program 2 times [2018-12-03 17:15:07,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:07,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:07,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:07,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:07,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:07,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:07,976 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:15:07,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:07,976 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:15:07,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:07,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:07,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:15:07,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:07,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:08,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:08,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:08,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 17:15:08,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:08,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:15:08,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:15:08,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:15:08,178 INFO L87 Difference]: Start difference. First operand 951 states and 1674 transitions. Second operand 13 states. [2018-12-03 17:15:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:08,897 INFO L93 Difference]: Finished difference Result 1032 states and 1803 transitions. [2018-12-03 17:15:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:15:08,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-12-03 17:15:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:08,901 INFO L225 Difference]: With dead ends: 1032 [2018-12-03 17:15:08,901 INFO L226 Difference]: Without dead ends: 1031 [2018-12-03 17:15:08,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:15:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-12-03 17:15:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 947. [2018-12-03 17:15:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-12-03 17:15:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1666 transitions. [2018-12-03 17:15:09,169 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1666 transitions. Word has length 14 [2018-12-03 17:15:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:09,169 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1666 transitions. [2018-12-03 17:15:09,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:15:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1666 transitions. [2018-12-03 17:15:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:15:09,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:09,171 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:09,171 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:09,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:09,171 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-12-03 17:15:09,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:09,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:09,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:09,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:09,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:09,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:09,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:09,243 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 17:15:09,243 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [41], [43], [45], [47], [50] [2018-12-03 17:15:09,243 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:09,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:09,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:09,273 INFO L272 AbstractInterpreter]: Visited 12 different actions 53 times. Merged at 9 different actions 34 times. Widened at 1 different actions 4 times. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:09,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:09,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:09,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:09,302 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:15:09,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:09,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:09,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:09,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:09,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:09,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 17:15:09,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:09,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:15:09,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:15:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:15:09,458 INFO L87 Difference]: Start difference. First operand 947 states and 1666 transitions. Second operand 11 states. [2018-12-03 17:15:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:10,350 INFO L93 Difference]: Finished difference Result 1060 states and 1841 transitions. [2018-12-03 17:15:10,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:15:10,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 17:15:10,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:10,354 INFO L225 Difference]: With dead ends: 1060 [2018-12-03 17:15:10,354 INFO L226 Difference]: Without dead ends: 1058 [2018-12-03 17:15:10,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:15:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-12-03 17:15:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 941. [2018-12-03 17:15:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-12-03 17:15:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1656 transitions. [2018-12-03 17:15:10,629 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1656 transitions. Word has length 14 [2018-12-03 17:15:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:10,629 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1656 transitions. [2018-12-03 17:15:10,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:15:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1656 transitions. [2018-12-03 17:15:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:15:10,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:10,630 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:10,630 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:10,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-12-03 17:15:10,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:10,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:10,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:10,746 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:10,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:10,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:10,746 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 17:15:10,747 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 17:15:10,748 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:10,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:10,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:10,768 INFO L272 AbstractInterpreter]: Visited 13 different actions 36 times. Merged at 6 different actions 22 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:15:10,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:10,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:10,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:10,803 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:15:10,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:10,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:10,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:11,404 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:11,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:11,531 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:11,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:11,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2018-12-03 17:15:11,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:11,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:15:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:15:11,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:11,552 INFO L87 Difference]: Start difference. First operand 941 states and 1656 transitions. Second operand 12 states. [2018-12-03 17:15:12,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:12,554 INFO L93 Difference]: Finished difference Result 1161 states and 2017 transitions. [2018-12-03 17:15:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:15:12,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 17:15:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:12,559 INFO L225 Difference]: With dead ends: 1161 [2018-12-03 17:15:12,559 INFO L226 Difference]: Without dead ends: 1159 [2018-12-03 17:15:12,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:15:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-12-03 17:15:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 925. [2018-12-03 17:15:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2018-12-03 17:15:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1630 transitions. [2018-12-03 17:15:12,803 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1630 transitions. Word has length 14 [2018-12-03 17:15:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:12,804 INFO L480 AbstractCegarLoop]: Abstraction has 925 states and 1630 transitions. [2018-12-03 17:15:12,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:15:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1630 transitions. [2018-12-03 17:15:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:15:12,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:12,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:12,805 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:12,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:12,805 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-12-03 17:15:12,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:12,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:12,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:12,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:12,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:12,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:12,881 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 17:15:12,881 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [50] [2018-12-03 17:15:12,882 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:12,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:12,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:12,910 INFO L272 AbstractInterpreter]: Visited 14 different actions 51 times. Merged at 10 different actions 34 times. Widened at 1 different actions 3 times. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:12,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:12,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:12,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:12,947 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:15:12,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:12,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:12,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:13,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:13,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:13,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 17:15:13,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:13,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:15:13,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:15:13,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:15:13,175 INFO L87 Difference]: Start difference. First operand 925 states and 1630 transitions. Second operand 11 states. [2018-12-03 17:15:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:13,958 INFO L93 Difference]: Finished difference Result 1037 states and 1790 transitions. [2018-12-03 17:15:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:15:13,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 17:15:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:13,963 INFO L225 Difference]: With dead ends: 1037 [2018-12-03 17:15:13,963 INFO L226 Difference]: Without dead ends: 1035 [2018-12-03 17:15:13,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:15:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-12-03 17:15:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 919. [2018-12-03 17:15:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-03 17:15:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1618 transitions. [2018-12-03 17:15:14,244 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1618 transitions. Word has length 14 [2018-12-03 17:15:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:14,245 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1618 transitions. [2018-12-03 17:15:14,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:15:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1618 transitions. [2018-12-03 17:15:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:14,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:14,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:15:14,246 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:14,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-12-03 17:15:14,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:14,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:14,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:14,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:14,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:14,447 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:14,447 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [52] [2018-12-03 17:15:14,448 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:14,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:14,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:14,482 INFO L272 AbstractInterpreter]: Visited 10 different actions 51 times. Merged at 7 different actions 30 times. Widened at 2 different actions 5 times. Found 10 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:14,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:14,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:14,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:14,521 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:15:14,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:14,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:14,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:14,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:15,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:15:15,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 8] total 22 [2018-12-03 17:15:15,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:15,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:15:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:15:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:15:15,020 INFO L87 Difference]: Start difference. First operand 919 states and 1618 transitions. Second operand 8 states. [2018-12-03 17:15:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:15,584 INFO L93 Difference]: Finished difference Result 1919 states and 3361 transitions. [2018-12-03 17:15:15,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:15:15,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 17:15:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:15,590 INFO L225 Difference]: With dead ends: 1919 [2018-12-03 17:15:15,590 INFO L226 Difference]: Without dead ends: 1075 [2018-12-03 17:15:15,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:15:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2018-12-03 17:15:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1022. [2018-12-03 17:15:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-12-03 17:15:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1776 transitions. [2018-12-03 17:15:15,889 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1776 transitions. Word has length 15 [2018-12-03 17:15:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:15,889 INFO L480 AbstractCegarLoop]: Abstraction has 1022 states and 1776 transitions. [2018-12-03 17:15:15,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:15:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1776 transitions. [2018-12-03 17:15:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:15,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:15,890 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:15,890 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:15,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-12-03 17:15:15,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:15,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:15,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:15,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:15,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:16,730 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-12-03 17:15:16,926 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:15:16,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:16,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:16,926 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:16,927 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [32], [36], [38], [41], [43] [2018-12-03 17:15:16,928 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:16,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:16,941 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:16,941 INFO L272 AbstractInterpreter]: Visited 12 different actions 33 times. Merged at 11 different actions 17 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:15:16,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:16,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:16,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:16,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:16,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:16,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:16,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:17,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:17,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:15:17,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2018-12-03 17:15:17,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:17,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:15:17,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:15:17,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:15:17,174 INFO L87 Difference]: Start difference. First operand 1022 states and 1776 transitions. Second operand 7 states. [2018-12-03 17:15:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:17,799 INFO L93 Difference]: Finished difference Result 2074 states and 3589 transitions. [2018-12-03 17:15:17,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:15:17,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 17:15:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:17,803 INFO L225 Difference]: With dead ends: 2074 [2018-12-03 17:15:17,803 INFO L226 Difference]: Without dead ends: 1127 [2018-12-03 17:15:17,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:15:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2018-12-03 17:15:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 978. [2018-12-03 17:15:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-12-03 17:15:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1688 transitions. [2018-12-03 17:15:18,118 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1688 transitions. Word has length 15 [2018-12-03 17:15:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:18,118 INFO L480 AbstractCegarLoop]: Abstraction has 978 states and 1688 transitions. [2018-12-03 17:15:18,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1688 transitions. [2018-12-03 17:15:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:18,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:18,119 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:18,119 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:18,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-12-03 17:15:18,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:18,288 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:15:18,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:18,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:18,288 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:18,289 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [52] [2018-12-03 17:15:18,289 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:18,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:18,318 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:18,318 INFO L272 AbstractInterpreter]: Visited 14 different actions 62 times. Merged at 12 different actions 40 times. Widened at 3 different actions 6 times. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:15:18,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:18,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:18,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:18,344 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:15:18,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:18,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:18,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:18,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:18,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:15:18,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 17:15:18,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:18,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:15:18,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:15:18,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:18,617 INFO L87 Difference]: Start difference. First operand 978 states and 1688 transitions. Second operand 7 states. [2018-12-03 17:15:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:19,234 INFO L93 Difference]: Finished difference Result 2229 states and 3788 transitions. [2018-12-03 17:15:19,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:15:19,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 17:15:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:19,239 INFO L225 Difference]: With dead ends: 2229 [2018-12-03 17:15:19,239 INFO L226 Difference]: Without dead ends: 1315 [2018-12-03 17:15:19,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:15:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2018-12-03 17:15:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1099. [2018-12-03 17:15:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2018-12-03 17:15:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1854 transitions. [2018-12-03 17:15:19,628 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1854 transitions. Word has length 15 [2018-12-03 17:15:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:19,628 INFO L480 AbstractCegarLoop]: Abstraction has 1099 states and 1854 transitions. [2018-12-03 17:15:19,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1854 transitions. [2018-12-03 17:15:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:19,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:19,629 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:19,629 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:19,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-12-03 17:15:19,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:19,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:19,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:19,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:19,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:19,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:19,777 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:19,778 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [43], [45], [46], [47], [50] [2018-12-03 17:15:19,778 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:19,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:19,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:19,808 INFO L272 AbstractInterpreter]: Visited 11 different actions 59 times. Merged at 9 different actions 36 times. Widened at 1 different actions 3 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:19,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:19,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:19,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:19,813 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:15:19,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:19,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:19,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:15:19,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:15:19,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:19,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2018-12-03 17:15:19,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:19,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:15:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:15:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:19,972 INFO L87 Difference]: Start difference. First operand 1099 states and 1854 transitions. Second operand 15 states. [2018-12-03 17:15:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:24,142 INFO L93 Difference]: Finished difference Result 3108 states and 5171 transitions. [2018-12-03 17:15:24,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:15:24,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 17:15:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:24,154 INFO L225 Difference]: With dead ends: 3108 [2018-12-03 17:15:24,155 INFO L226 Difference]: Without dead ends: 2361 [2018-12-03 17:15:24,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1422, Invalid=5384, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 17:15:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2018-12-03 17:15:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1784. [2018-12-03 17:15:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-12-03 17:15:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2919 transitions. [2018-12-03 17:15:25,164 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2919 transitions. Word has length 15 [2018-12-03 17:15:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:25,164 INFO L480 AbstractCegarLoop]: Abstraction has 1784 states and 2919 transitions. [2018-12-03 17:15:25,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:15:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2919 transitions. [2018-12-03 17:15:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:25,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:25,165 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:15:25,165 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:25,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:25,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-12-03 17:15:25,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:25,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:25,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:25,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:25,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:25,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:25,267 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:25,268 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [38], [43], [45], [47], [50] [2018-12-03 17:15:25,268 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:25,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:25,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:25,295 INFO L272 AbstractInterpreter]: Visited 10 different actions 51 times. Merged at 7 different actions 30 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:25,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:25,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:25,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:25,331 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:15:25,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:25,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:25,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:25,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:25,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:15:25,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2018-12-03 17:15:25,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:25,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:15:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:15:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:15:25,573 INFO L87 Difference]: Start difference. First operand 1784 states and 2919 transitions. Second operand 7 states. [2018-12-03 17:15:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:26,279 INFO L93 Difference]: Finished difference Result 2347 states and 3766 transitions. [2018-12-03 17:15:26,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:15:26,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 17:15:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:26,285 INFO L225 Difference]: With dead ends: 2347 [2018-12-03 17:15:26,285 INFO L226 Difference]: Without dead ends: 1719 [2018-12-03 17:15:26,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:15:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-12-03 17:15:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1494. [2018-12-03 17:15:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2018-12-03 17:15:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2454 transitions. [2018-12-03 17:15:26,820 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2454 transitions. Word has length 15 [2018-12-03 17:15:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:26,820 INFO L480 AbstractCegarLoop]: Abstraction has 1494 states and 2454 transitions. [2018-12-03 17:15:26,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2454 transitions. [2018-12-03 17:15:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:26,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:26,821 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:26,822 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:26,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:26,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-12-03 17:15:26,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:26,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:26,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:26,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:26,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:26,922 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:15:26,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:26,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:26,923 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:26,923 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [36], [38], [43], [45], [47], [50], [52] [2018-12-03 17:15:26,924 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:26,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:26,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:26,953 INFO L272 AbstractInterpreter]: Visited 12 different actions 59 times. Merged at 10 different actions 40 times. Widened at 2 different actions 4 times. Found 9 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:26,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:26,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:26,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:26,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 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:15:27,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:27,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:27,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:27,619 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-12-03 17:15:27,860 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:15:27,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:27,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:15:27,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2018-12-03 17:15:27,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:27,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:15:27,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:15:27,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:15:27,975 INFO L87 Difference]: Start difference. First operand 1494 states and 2454 transitions. Second operand 7 states. [2018-12-03 17:15:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:28,985 INFO L93 Difference]: Finished difference Result 3208 states and 5225 transitions. [2018-12-03 17:15:28,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:15:28,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 17:15:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:28,989 INFO L225 Difference]: With dead ends: 3208 [2018-12-03 17:15:28,989 INFO L226 Difference]: Without dead ends: 1653 [2018-12-03 17:15:28,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:15:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-12-03 17:15:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1504. [2018-12-03 17:15:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2018-12-03 17:15:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2451 transitions. [2018-12-03 17:15:29,530 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2451 transitions. Word has length 15 [2018-12-03 17:15:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:29,531 INFO L480 AbstractCegarLoop]: Abstraction has 1504 states and 2451 transitions. [2018-12-03 17:15:29,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2451 transitions. [2018-12-03 17:15:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:29,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:29,532 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:29,532 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:29,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1457630053, now seen corresponding path program 1 times [2018-12-03 17:15:29,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:29,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:29,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:29,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:15:29,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:29,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:29,596 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:29,596 INFO L205 CegarAbsIntRunner]: [0], [6], [19], [23], [36], [38], [41], [45], [46], [47], [50], [52] [2018-12-03 17:15:29,596 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:29,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:29,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:29,621 INFO L272 AbstractInterpreter]: Visited 12 different actions 50 times. Merged at 9 different actions 28 times. Widened at 2 different actions 3 times. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:29,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:29,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:29,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:29,625 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:15:29,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:29,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:29,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:15:29,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:15:29,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:15:29,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2018-12-03 17:15:29,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:29,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:15:29,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:15:29,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:15:29,800 INFO L87 Difference]: Start difference. First operand 1504 states and 2451 transitions. Second operand 7 states. [2018-12-03 17:15:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:30,552 INFO L93 Difference]: Finished difference Result 2821 states and 4576 transitions. [2018-12-03 17:15:30,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:15:30,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 17:15:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:30,556 INFO L225 Difference]: With dead ends: 2821 [2018-12-03 17:15:30,556 INFO L226 Difference]: Without dead ends: 1739 [2018-12-03 17:15:30,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:15:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2018-12-03 17:15:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1572. [2018-12-03 17:15:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2018-12-03 17:15:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2547 transitions. [2018-12-03 17:15:31,185 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2547 transitions. Word has length 15 [2018-12-03 17:15:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:31,185 INFO L480 AbstractCegarLoop]: Abstraction has 1572 states and 2547 transitions. [2018-12-03 17:15:31,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2547 transitions. [2018-12-03 17:15:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:31,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:31,186 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:31,186 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:31,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1954222544, now seen corresponding path program 1 times [2018-12-03 17:15:31,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:31,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:31,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:31,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:15:31,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:15:31,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 17:15:31,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:31,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:15:31,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:15:31,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:15:31,253 INFO L87 Difference]: Start difference. First operand 1572 states and 2547 transitions. Second operand 7 states. [2018-12-03 17:15:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:32,416 INFO L93 Difference]: Finished difference Result 3671 states and 5850 transitions. [2018-12-03 17:15:32,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:15:32,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 17:15:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:32,421 INFO L225 Difference]: With dead ends: 3671 [2018-12-03 17:15:32,421 INFO L226 Difference]: Without dead ends: 2361 [2018-12-03 17:15:32,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:15:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2018-12-03 17:15:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1482. [2018-12-03 17:15:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2018-12-03 17:15:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2422 transitions. [2018-12-03 17:15:33,012 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2422 transitions. Word has length 15 [2018-12-03 17:15:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:33,012 INFO L480 AbstractCegarLoop]: Abstraction has 1482 states and 2422 transitions. [2018-12-03 17:15:33,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2422 transitions. [2018-12-03 17:15:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:15:33,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:33,013 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:15:33,013 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:33,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-12-03 17:15:33,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:33,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:33,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:33,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:33,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:33,514 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 17:15:33,514 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 17:15:33,515 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:33,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:33,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:33,535 INFO L272 AbstractInterpreter]: Visited 10 different actions 50 times. Merged at 8 different actions 33 times. Widened at 3 different actions 6 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 17:15:33,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:33,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:33,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:33,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:33,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:33,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:33,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:33,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:33,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:15:33,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 17:15:33,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:15:33,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:15:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:15:33,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:15:33,692 INFO L87 Difference]: Start difference. First operand 1482 states and 2422 transitions. Second operand 7 states. [2018-12-03 17:15:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:34,452 INFO L93 Difference]: Finished difference Result 2958 states and 4762 transitions. [2018-12-03 17:15:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:15:34,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 17:15:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:34,455 INFO L225 Difference]: With dead ends: 2958 [2018-12-03 17:15:34,455 INFO L226 Difference]: Without dead ends: 1372 [2018-12-03 17:15:34,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:15:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2018-12-03 17:15:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1025. [2018-12-03 17:15:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-12-03 17:15:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1658 transitions. [2018-12-03 17:15:34,887 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1658 transitions. Word has length 15 [2018-12-03 17:15:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:34,887 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 1658 transitions. [2018-12-03 17:15:34,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:15:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1658 transitions. [2018-12-03 17:15:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:34,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:34,888 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:15:34,888 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:34,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:34,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times [2018-12-03 17:15:34,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:34,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:34,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:34,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:34,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:35,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:35,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:35,102 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:15:35,102 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [50], [52] [2018-12-03 17:15:35,103 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:35,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:35,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:35,130 INFO L272 AbstractInterpreter]: Visited 11 different actions 59 times. Merged at 9 different actions 34 times. Widened at 2 different actions 4 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:35,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:35,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:35,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:35,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:35,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:35,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:35,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:35,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:35,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:35,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2018-12-03 17:15:35,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:35,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:15:35,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:15:35,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:15:35,450 INFO L87 Difference]: Start difference. First operand 1025 states and 1658 transitions. Second operand 19 states. [2018-12-03 17:15:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:38,241 INFO L93 Difference]: Finished difference Result 2270 states and 3650 transitions. [2018-12-03 17:15:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:15:38,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 17:15:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:38,244 INFO L225 Difference]: With dead ends: 2270 [2018-12-03 17:15:38,244 INFO L226 Difference]: Without dead ends: 1541 [2018-12-03 17:15:38,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=696, Invalid=3464, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:15:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2018-12-03 17:15:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1401. [2018-12-03 17:15:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2018-12-03 17:15:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2230 transitions. [2018-12-03 17:15:38,754 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2230 transitions. Word has length 18 [2018-12-03 17:15:38,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:38,754 INFO L480 AbstractCegarLoop]: Abstraction has 1401 states and 2230 transitions. [2018-12-03 17:15:38,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:15:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2230 transitions. [2018-12-03 17:15:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:38,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:38,755 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:38,755 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:38,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times [2018-12-03 17:15:38,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:38,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:38,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:38,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:38,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:38,956 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:15:38,956 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43] [2018-12-03 17:15:38,957 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:38,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:38,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:38,969 INFO L272 AbstractInterpreter]: Visited 13 different actions 33 times. Merged at 11 different actions 15 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:38,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:38,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:38,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:38,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:38,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:38,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:38,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:39,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:39,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:39,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2018-12-03 17:15:39,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:39,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:15:39,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:15:39,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:15:39,243 INFO L87 Difference]: Start difference. First operand 1401 states and 2230 transitions. Second operand 19 states. [2018-12-03 17:15:39,450 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-12-03 17:15:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:42,355 INFO L93 Difference]: Finished difference Result 1498 states and 2375 transitions. [2018-12-03 17:15:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:15:42,356 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 17:15:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:42,358 INFO L225 Difference]: With dead ends: 1498 [2018-12-03 17:15:42,358 INFO L226 Difference]: Without dead ends: 1496 [2018-12-03 17:15:42,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=608, Invalid=3174, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:15:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2018-12-03 17:15:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1393. [2018-12-03 17:15:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1393 states. [2018-12-03 17:15:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2216 transitions. [2018-12-03 17:15:42,860 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2216 transitions. Word has length 18 [2018-12-03 17:15:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:42,860 INFO L480 AbstractCegarLoop]: Abstraction has 1393 states and 2216 transitions. [2018-12-03 17:15:42,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:15:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2216 transitions. [2018-12-03 17:15:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:42,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:42,861 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:42,861 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:42,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:42,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1896033281, now seen corresponding path program 1 times [2018-12-03 17:15:42,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:42,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:42,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:42,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:42,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:42,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:42,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:42,931 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:15:42,931 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [23], [36], [38], [41], [43], [45], [46], [47], [50] [2018-12-03 17:15:42,932 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:42,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:42,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:42,957 INFO L272 AbstractInterpreter]: Visited 12 different actions 49 times. Merged at 8 different actions 24 times. Widened at 2 different actions 3 times. Found 13 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 17:15:42,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:42,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:42,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:42,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:42,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:42,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:42,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:43,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:43,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:43,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 17:15:43,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:43,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:15:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:15:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:15:43,105 INFO L87 Difference]: Start difference. First operand 1393 states and 2216 transitions. Second operand 10 states. [2018-12-03 17:15:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:44,192 INFO L93 Difference]: Finished difference Result 1476 states and 2339 transitions. [2018-12-03 17:15:44,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:15:44,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 17:15:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:44,196 INFO L225 Difference]: With dead ends: 1476 [2018-12-03 17:15:44,196 INFO L226 Difference]: Without dead ends: 1474 [2018-12-03 17:15:44,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:15:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-12-03 17:15:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1289. [2018-12-03 17:15:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-12-03 17:15:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2043 transitions. [2018-12-03 17:15:44,740 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2043 transitions. Word has length 18 [2018-12-03 17:15:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:44,740 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2043 transitions. [2018-12-03 17:15:44,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:15:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2043 transitions. [2018-12-03 17:15:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:44,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:44,741 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:15:44,742 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:44,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 2 times [2018-12-03 17:15:44,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:44,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:44,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:44,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:15:44,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:44,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:44,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:44,932 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:15:44,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:44,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:44,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:44,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:44,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:15:44,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:44,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:15:45,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:15:45,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:45,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2018-12-03 17:15:45,256 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:45,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:15:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:15:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:15:45,257 INFO L87 Difference]: Start difference. First operand 1289 states and 2043 transitions. Second operand 20 states. [2018-12-03 17:15:46,319 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-12-03 17:15:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:47,185 INFO L93 Difference]: Finished difference Result 1447 states and 2279 transitions. [2018-12-03 17:15:47,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:15:47,185 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-12-03 17:15:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:47,187 INFO L225 Difference]: With dead ends: 1447 [2018-12-03 17:15:47,187 INFO L226 Difference]: Without dead ends: 1446 [2018-12-03 17:15:47,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=541, Invalid=1811, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:15:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2018-12-03 17:15:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1282. [2018-12-03 17:15:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-12-03 17:15:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 2028 transitions. [2018-12-03 17:15:47,648 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 2028 transitions. Word has length 18 [2018-12-03 17:15:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:47,648 INFO L480 AbstractCegarLoop]: Abstraction has 1282 states and 2028 transitions. [2018-12-03 17:15:47,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:15:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 2028 transitions. [2018-12-03 17:15:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:47,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:47,649 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:47,649 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:47,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-12-03 17:15:47,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:47,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:47,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:47,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:47,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:47,744 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:15:47,744 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 17:15:47,745 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:47,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:47,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:47,784 INFO L272 AbstractInterpreter]: Visited 13 different actions 76 times. Merged at 11 different actions 49 times. Widened at 3 different actions 6 times. Found 17 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:15:47,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:47,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:47,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:47,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:47,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:47,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:47,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:48,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:48,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:48,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 17:15:48,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:48,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:15:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:15:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:15:48,179 INFO L87 Difference]: Start difference. First operand 1282 states and 2028 transitions. Second operand 16 states. [2018-12-03 17:15:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:51,420 INFO L93 Difference]: Finished difference Result 1583 states and 2508 transitions. [2018-12-03 17:15:51,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:15:51,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 17:15:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:51,422 INFO L225 Difference]: With dead ends: 1583 [2018-12-03 17:15:51,422 INFO L226 Difference]: Without dead ends: 1581 [2018-12-03 17:15:51,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=809, Invalid=4303, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:15:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2018-12-03 17:15:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1355. [2018-12-03 17:15:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2018-12-03 17:15:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2152 transitions. [2018-12-03 17:15:52,014 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2152 transitions. Word has length 18 [2018-12-03 17:15:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:52,014 INFO L480 AbstractCegarLoop]: Abstraction has 1355 states and 2152 transitions. [2018-12-03 17:15:52,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:15:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2152 transitions. [2018-12-03 17:15:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:52,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:52,015 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:52,015 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:52,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-12-03 17:15:52,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:52,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:52,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:52,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:52,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:52,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:52,153 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:15:52,153 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [50], [52] [2018-12-03 17:15:52,155 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:15:52,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:15:52,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:15:52,184 INFO L272 AbstractInterpreter]: Visited 11 different actions 66 times. Merged at 9 different actions 40 times. Widened at 2 different actions 6 times. Found 17 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:15:52,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:52,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:15:52,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:52,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:52,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:52,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:52,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:52,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:53,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:53,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 17:15:53,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:53,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:15:53,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:15:53,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:15:53,068 INFO L87 Difference]: Start difference. First operand 1355 states and 2152 transitions. Second operand 15 states. [2018-12-03 17:15:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:56,111 INFO L93 Difference]: Finished difference Result 1638 states and 2596 transitions. [2018-12-03 17:15:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:15:56,112 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:15:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:56,113 INFO L225 Difference]: With dead ends: 1638 [2018-12-03 17:15:56,114 INFO L226 Difference]: Without dead ends: 1636 [2018-12-03 17:15:56,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=838, Invalid=3992, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:15:56,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2018-12-03 17:15:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1398. [2018-12-03 17:15:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2018-12-03 17:15:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2222 transitions. [2018-12-03 17:15:56,658 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2222 transitions. Word has length 18 [2018-12-03 17:15:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:56,658 INFO L480 AbstractCegarLoop]: Abstraction has 1398 states and 2222 transitions. [2018-12-03 17:15:56,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:15:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2222 transitions. [2018-12-03 17:15:56,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:15:56,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:56,659 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:15:56,660 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:56,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:56,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-12-03 17:15:56,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:56,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:56,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:56,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:56,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:56,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:56,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:56,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:56,753 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:15:56,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:56,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:56,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:56,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:56,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:15:56,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:56,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:56,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:15:57,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:57,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2018-12-03 17:15:57,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:57,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:15:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:15:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:15:57,095 INFO L87 Difference]: Start difference. First operand 1398 states and 2222 transitions. Second operand 18 states. [2018-12-03 17:15:57,945 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-03 17:16:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:01,404 INFO L93 Difference]: Finished difference Result 1695 states and 2679 transitions. [2018-12-03 17:16:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:16:01,405 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 17:16:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:01,406 INFO L225 Difference]: With dead ends: 1695 [2018-12-03 17:16:01,407 INFO L226 Difference]: Without dead ends: 1693 [2018-12-03 17:16:01,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1629, Invalid=5511, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 17:16:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2018-12-03 17:16:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1254. [2018-12-03 17:16:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-12-03 17:16:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1980 transitions. [2018-12-03 17:16:01,871 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1980 transitions. Word has length 18 [2018-12-03 17:16:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:01,871 INFO L480 AbstractCegarLoop]: Abstraction has 1254 states and 1980 transitions. [2018-12-03 17:16:01,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:16:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1980 transitions. [2018-12-03 17:16:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:01,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:01,872 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:01,873 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:01,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-12-03 17:16:01,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:01,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:01,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:01,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:01,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:01,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:01,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:01,962 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:01,962 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:16:01,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:01,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:01,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:01,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:01,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:16:01,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:01,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:02,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:02,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:02,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 17:16:02,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:02,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:16:02,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:16:02,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:16:02,200 INFO L87 Difference]: Start difference. First operand 1254 states and 1980 transitions. Second operand 16 states. [2018-12-03 17:16:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:05,888 INFO L93 Difference]: Finished difference Result 1422 states and 2222 transitions. [2018-12-03 17:16:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:16:05,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 17:16:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:05,890 INFO L225 Difference]: With dead ends: 1422 [2018-12-03 17:16:05,890 INFO L226 Difference]: Without dead ends: 1420 [2018-12-03 17:16:05,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1317, Invalid=4845, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:16:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-12-03 17:16:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1252. [2018-12-03 17:16:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-12-03 17:16:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1975 transitions. [2018-12-03 17:16:06,345 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1975 transitions. Word has length 18 [2018-12-03 17:16:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:06,346 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1975 transitions. [2018-12-03 17:16:06,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:16:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1975 transitions. [2018-12-03 17:16:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:06,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:06,346 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:06,347 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:06,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1882250372, now seen corresponding path program 1 times [2018-12-03 17:16:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:06,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:06,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:06,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:06,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:06,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:06,476 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:06,477 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [50], [52] [2018-12-03 17:16:06,477 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:06,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:06,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:06,521 INFO L272 AbstractInterpreter]: Visited 15 different actions 90 times. Merged at 13 different actions 60 times. Widened at 5 different actions 11 times. Found 18 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:16:06,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:06,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:06,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:06,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:06,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:06,574 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:06,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:06,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:06,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:06,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 17:16:06,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:06,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:16:06,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:16:06,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:16:06,794 INFO L87 Difference]: Start difference. First operand 1252 states and 1975 transitions. Second operand 16 states. [2018-12-03 17:16:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:09,346 INFO L93 Difference]: Finished difference Result 1547 states and 2446 transitions. [2018-12-03 17:16:09,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:16:09,347 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 17:16:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:09,348 INFO L225 Difference]: With dead ends: 1547 [2018-12-03 17:16:09,348 INFO L226 Difference]: Without dead ends: 1533 [2018-12-03 17:16:09,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=2265, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:16:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-12-03 17:16:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1227. [2018-12-03 17:16:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2018-12-03 17:16:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1931 transitions. [2018-12-03 17:16:09,855 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1931 transitions. Word has length 18 [2018-12-03 17:16:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:09,855 INFO L480 AbstractCegarLoop]: Abstraction has 1227 states and 1931 transitions. [2018-12-03 17:16:09,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:16:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1931 transitions. [2018-12-03 17:16:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:09,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:09,856 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:09,857 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:09,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-12-03 17:16:09,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:09,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:09,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:09,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:09,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:09,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:09,949 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:09,949 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [36], [37], [45], [47], [50], [52] [2018-12-03 17:16:09,950 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:09,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:09,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:09,975 INFO L272 AbstractInterpreter]: Visited 12 different actions 69 times. Merged at 10 different actions 44 times. Widened at 4 different actions 8 times. Found 15 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:16:10,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:10,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:10,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:10,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:10,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:10,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:10,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:10,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:10,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 17:16:10,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:10,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:16:10,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:16:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:16:10,205 INFO L87 Difference]: Start difference. First operand 1227 states and 1931 transitions. Second operand 15 states. [2018-12-03 17:16:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:12,877 INFO L93 Difference]: Finished difference Result 1697 states and 2671 transitions. [2018-12-03 17:16:12,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:16:12,877 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:16:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:12,879 INFO L225 Difference]: With dead ends: 1697 [2018-12-03 17:16:12,879 INFO L226 Difference]: Without dead ends: 1660 [2018-12-03 17:16:12,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:16:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2018-12-03 17:16:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1254. [2018-12-03 17:16:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-12-03 17:16:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1996 transitions. [2018-12-03 17:16:13,407 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1996 transitions. Word has length 18 [2018-12-03 17:16:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:13,407 INFO L480 AbstractCegarLoop]: Abstraction has 1254 states and 1996 transitions. [2018-12-03 17:16:13,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:16:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1996 transitions. [2018-12-03 17:16:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:13,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:13,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:13,408 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:13,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-12-03 17:16:13,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:13,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:13,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:13,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:13,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:13,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:13,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:13,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:13,751 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:16:13,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:13,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:13,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:13,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:13,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:16:13,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:13,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:13,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:13,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:13,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 17:16:13,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:13,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:16:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:16:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:16:13,975 INFO L87 Difference]: Start difference. First operand 1254 states and 1996 transitions. Second operand 16 states. [2018-12-03 17:16:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:17,212 INFO L93 Difference]: Finished difference Result 1605 states and 2547 transitions. [2018-12-03 17:16:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:16:17,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 17:16:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:17,214 INFO L225 Difference]: With dead ends: 1605 [2018-12-03 17:16:17,214 INFO L226 Difference]: Without dead ends: 1603 [2018-12-03 17:16:17,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1317, Invalid=4845, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:16:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2018-12-03 17:16:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1306. [2018-12-03 17:16:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2018-12-03 17:16:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2079 transitions. [2018-12-03 17:16:17,816 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2079 transitions. Word has length 18 [2018-12-03 17:16:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:17,816 INFO L480 AbstractCegarLoop]: Abstraction has 1306 states and 2079 transitions. [2018-12-03 17:16:17,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:16:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2079 transitions. [2018-12-03 17:16:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:17,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:17,818 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:16:17,818 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:17,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash 749306886, now seen corresponding path program 1 times [2018-12-03 17:16:17,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:17,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:17,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:17,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:17,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:17,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:17,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:17,921 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:17,921 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 17:16:17,921 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:17,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:17,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:17,948 INFO L272 AbstractInterpreter]: Visited 11 different actions 66 times. Merged at 8 different actions 36 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:16:17,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:17,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:17,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:17,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:17,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:17,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:17,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:18,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:18,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:18,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2018-12-03 17:16:18,238 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:18,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:16:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:16:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:16:18,239 INFO L87 Difference]: Start difference. First operand 1306 states and 2079 transitions. Second operand 20 states. [2018-12-03 17:16:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:25,834 INFO L93 Difference]: Finished difference Result 4497 states and 7178 transitions. [2018-12-03 17:16:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-12-03 17:16:25,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-12-03 17:16:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:25,837 INFO L225 Difference]: With dead ends: 4497 [2018-12-03 17:16:25,837 INFO L226 Difference]: Without dead ends: 3228 [2018-12-03 17:16:25,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 11763 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3946, Invalid=25466, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:16:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2018-12-03 17:16:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2433. [2018-12-03 17:16:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2018-12-03 17:16:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3907 transitions. [2018-12-03 17:16:26,858 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3907 transitions. Word has length 18 [2018-12-03 17:16:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:26,859 INFO L480 AbstractCegarLoop]: Abstraction has 2433 states and 3907 transitions. [2018-12-03 17:16:26,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:16:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3907 transitions. [2018-12-03 17:16:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:26,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:26,860 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:26,860 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:26,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:26,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-12-03 17:16:26,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:26,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:26,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:26,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:26,982 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:26,982 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [38], [41], [43], [45], [46] [2018-12-03 17:16:26,983 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:26,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:27,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:27,011 INFO L272 AbstractInterpreter]: Visited 12 different actions 69 times. Merged at 10 different actions 44 times. Widened at 4 different actions 8 times. Found 15 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:16:27,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:27,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:27,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:27,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:27,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:27,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:27,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:27,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:27,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:27,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-03 17:16:27,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:27,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:16:27,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:16:27,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:16:27,372 INFO L87 Difference]: Start difference. First operand 2433 states and 3907 transitions. Second operand 16 states. [2018-12-03 17:16:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:31,411 INFO L93 Difference]: Finished difference Result 3690 states and 5942 transitions. [2018-12-03 17:16:31,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:16:31,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 17:16:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:31,415 INFO L225 Difference]: With dead ends: 3690 [2018-12-03 17:16:31,416 INFO L226 Difference]: Without dead ends: 3639 [2018-12-03 17:16:31,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1002, Invalid=3420, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:16:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2018-12-03 17:16:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 2628. [2018-12-03 17:16:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2018-12-03 17:16:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 4249 transitions. [2018-12-03 17:16:32,620 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 4249 transitions. Word has length 18 [2018-12-03 17:16:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:32,621 INFO L480 AbstractCegarLoop]: Abstraction has 2628 states and 4249 transitions. [2018-12-03 17:16:32,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:16:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 4249 transitions. [2018-12-03 17:16:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:32,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:32,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:32,622 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:32,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-12-03 17:16:32,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:32,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:32,721 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:16:32,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:32,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:32,722 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:32,722 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [23], [25], [27], [30], [32], [36], [38], [41], [43] [2018-12-03 17:16:32,722 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:32,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:32,752 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:32,753 INFO L272 AbstractInterpreter]: Visited 14 different actions 76 times. Merged at 12 different actions 42 times. Widened at 5 different actions 7 times. Found 23 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:16:32,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:32,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:32,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:32,757 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:32,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:32,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:32,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:33,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:33,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:33,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2018-12-03 17:16:33,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:33,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:16:33,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:16:33,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:16:33,609 INFO L87 Difference]: Start difference. First operand 2628 states and 4249 transitions. Second operand 18 states. [2018-12-03 17:16:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:38,586 INFO L93 Difference]: Finished difference Result 4046 states and 6519 transitions. [2018-12-03 17:16:38,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:16:38,587 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 17:16:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:38,590 INFO L225 Difference]: With dead ends: 4046 [2018-12-03 17:16:38,590 INFO L226 Difference]: Without dead ends: 4044 [2018-12-03 17:16:38,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1116, Invalid=4736, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 17:16:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2018-12-03 17:16:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 3267. [2018-12-03 17:16:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3267 states. [2018-12-03 17:16:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 5296 transitions. [2018-12-03 17:16:40,059 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 5296 transitions. Word has length 18 [2018-12-03 17:16:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:40,059 INFO L480 AbstractCegarLoop]: Abstraction has 3267 states and 5296 transitions. [2018-12-03 17:16:40,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:16:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 5296 transitions. [2018-12-03 17:16:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:40,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:40,060 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:40,060 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:40,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-12-03 17:16:40,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:40,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:40,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:40,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:40,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:40,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:40,176 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:16:40,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:40,176 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:40,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:16:40,185 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:16:40,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:16:40,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:40,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:40,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:40,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 17:16:40,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:40,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:16:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:16:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:16:40,373 INFO L87 Difference]: Start difference. First operand 3267 states and 5296 transitions. Second operand 15 states. [2018-12-03 17:16:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:46,131 INFO L93 Difference]: Finished difference Result 5111 states and 8313 transitions. [2018-12-03 17:16:46,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:16:46,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:16:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:46,137 INFO L225 Difference]: With dead ends: 5111 [2018-12-03 17:16:46,137 INFO L226 Difference]: Without dead ends: 5106 [2018-12-03 17:16:46,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1729, Invalid=6461, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 17:16:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2018-12-03 17:16:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 3114. [2018-12-03 17:16:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2018-12-03 17:16:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 5026 transitions. [2018-12-03 17:16:47,543 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 5026 transitions. Word has length 18 [2018-12-03 17:16:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:47,544 INFO L480 AbstractCegarLoop]: Abstraction has 3114 states and 5026 transitions. [2018-12-03 17:16:47,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:16:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 5026 transitions. [2018-12-03 17:16:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:47,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:47,545 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:47,545 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:47,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1899944713, now seen corresponding path program 1 times [2018-12-03 17:16:47,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:47,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:47,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:47,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:47,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:47,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:47,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:47,708 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 17:16:47,708 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [23], [25], [27], [32], [36], [38], [41], [43], [45], [47], [50] [2018-12-03 17:16:47,709 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:16:47,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:16:47,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:16:47,746 INFO L272 AbstractInterpreter]: Visited 16 different actions 88 times. Merged at 15 different actions 52 times. Widened at 5 different actions 8 times. Found 23 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:16:47,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:47,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:16:47,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:47,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:47,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:47,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:47,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:47,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:48,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:48,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2018-12-03 17:16:48,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:48,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:16:48,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:16:48,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:16:48,031 INFO L87 Difference]: Start difference. First operand 3114 states and 5026 transitions. Second operand 17 states. [2018-12-03 17:16:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:54,442 INFO L93 Difference]: Finished difference Result 4638 states and 7557 transitions. [2018-12-03 17:16:54,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:16:54,442 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-03 17:16:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:54,447 INFO L225 Difference]: With dead ends: 4638 [2018-12-03 17:16:54,447 INFO L226 Difference]: Without dead ends: 4636 [2018-12-03 17:16:54,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2922 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1735, Invalid=7967, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 17:16:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4636 states. [2018-12-03 17:16:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4636 to 3244. [2018-12-03 17:16:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2018-12-03 17:16:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 5247 transitions. [2018-12-03 17:16:55,943 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 5247 transitions. Word has length 18 [2018-12-03 17:16:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:55,943 INFO L480 AbstractCegarLoop]: Abstraction has 3244 states and 5247 transitions. [2018-12-03 17:16:55,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:16:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 5247 transitions. [2018-12-03 17:16:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:16:55,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:55,944 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:16:55,944 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:55,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:55,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1199474987, now seen corresponding path program 2 times [2018-12-03 17:16:55,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:55,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:55,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:55,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:55,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:56,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:56,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:56,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:56,040 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:16:56,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:56,040 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:56,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:56,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:56,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:16:56,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:56,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:56,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:16:56,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:56,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 17:16:56,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:56,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:16:56,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:16:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:16:56,207 INFO L87 Difference]: Start difference. First operand 3244 states and 5247 transitions. Second operand 15 states. [2018-12-03 17:17:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:00,892 INFO L93 Difference]: Finished difference Result 4606 states and 7453 transitions. [2018-12-03 17:17:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:17:00,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 17:17:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:00,897 INFO L225 Difference]: With dead ends: 4606 [2018-12-03 17:17:00,897 INFO L226 Difference]: Without dead ends: 4604 [2018-12-03 17:17:00,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=887, Invalid=4083, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:17:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2018-12-03 17:17:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 3230. [2018-12-03 17:17:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2018-12-03 17:17:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 5190 transitions. [2018-12-03 17:17:02,466 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 5190 transitions. Word has length 18 [2018-12-03 17:17:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:02,466 INFO L480 AbstractCegarLoop]: Abstraction has 3230 states and 5190 transitions. [2018-12-03 17:17:02,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:17:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 5190 transitions. [2018-12-03 17:17:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:17:02,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:02,468 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:02,468 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:02,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1150743797, now seen corresponding path program 2 times [2018-12-03 17:17:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:02,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:02,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:02,575 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:17:02,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:02,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:02,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:02,575 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:17:02,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:02,575 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:02,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:17:02,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:17:02,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 17:17:02,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:02,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:17:02,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:17:02,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 17:17:02,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:02,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:17:02,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:17:02,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:17:02,794 INFO L87 Difference]: Start difference. First operand 3230 states and 5190 transitions. Second operand 17 states. [2018-12-03 17:17:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:07,598 INFO L93 Difference]: Finished difference Result 4410 states and 7087 transitions. [2018-12-03 17:17:07,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:17:07,598 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-03 17:17:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:07,602 INFO L225 Difference]: With dead ends: 4410 [2018-12-03 17:17:07,603 INFO L226 Difference]: Without dead ends: 4376 [2018-12-03 17:17:07,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=991, Invalid=6149, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 17:17:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2018-12-03 17:17:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 3189. [2018-12-03 17:17:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2018-12-03 17:17:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 5087 transitions. [2018-12-03 17:17:09,466 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 5087 transitions. Word has length 18 [2018-12-03 17:17:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:09,466 INFO L480 AbstractCegarLoop]: Abstraction has 3189 states and 5087 transitions. [2018-12-03 17:17:09,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:17:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 5087 transitions. [2018-12-03 17:17:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:17:09,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:09,467 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:09,468 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:09,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:09,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-12-03 17:17:09,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:09,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:09,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:09,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:09,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:10,352 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-12-03 17:17:10,656 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-12-03 17:17:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:10,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:10,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:10,705 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 17:17:10,705 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [23], [36], [38], [41], [43], [45], [46], [47], [50], [52] [2018-12-03 17:17:10,706 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:10,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:10,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:10,732 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 10 different actions 31 times. Widened at 2 different actions 3 times. Found 18 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 17:17:10,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:10,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:10,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:10,736 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:10,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:10,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:10,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:17:10,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:17:11,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:11,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2018-12-03 17:17:11,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:11,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:17:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:17:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:17:11,061 INFO L87 Difference]: Start difference. First operand 3189 states and 5087 transitions. Second operand 21 states. [2018-12-03 17:17:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:15,751 INFO L93 Difference]: Finished difference Result 3565 states and 5702 transitions. [2018-12-03 17:17:15,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:17:15,751 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-12-03 17:17:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:15,755 INFO L225 Difference]: With dead ends: 3565 [2018-12-03 17:17:15,755 INFO L226 Difference]: Without dead ends: 3563 [2018-12-03 17:17:15,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=967, Invalid=4003, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:17:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-12-03 17:17:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3377. [2018-12-03 17:17:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-12-03 17:17:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 5396 transitions. [2018-12-03 17:17:17,507 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 5396 transitions. Word has length 19 [2018-12-03 17:17:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:17,507 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 5396 transitions. [2018-12-03 17:17:17,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:17:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 5396 transitions. [2018-12-03 17:17:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:17:17,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:17,508 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:17,508 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:17,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-12-03 17:17:17,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:17,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:17,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:17,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:17,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:17,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:17,625 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 17:17:17,625 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [32], [36], [37], [38], [41], [43] [2018-12-03 17:17:17,626 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:17,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:17,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:17,650 INFO L272 AbstractInterpreter]: Visited 12 different actions 72 times. Merged at 11 different actions 40 times. Widened at 4 different actions 6 times. Found 20 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:17:17,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:17,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:17,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:17,653 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:17,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:17,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:17,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:17,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:17,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:17,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2018-12-03 17:17:17,959 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:17,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:17:17,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:17:17,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:17:17,959 INFO L87 Difference]: Start difference. First operand 3377 states and 5396 transitions. Second operand 19 states. [2018-12-03 17:17:19,295 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-12-03 17:17:19,761 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-12-03 17:17:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:26,248 INFO L93 Difference]: Finished difference Result 6040 states and 9759 transitions. [2018-12-03 17:17:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:17:26,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 17:17:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:26,254 INFO L225 Difference]: With dead ends: 6040 [2018-12-03 17:17:26,254 INFO L226 Difference]: Without dead ends: 6029 [2018-12-03 17:17:26,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1381, Invalid=4625, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:17:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2018-12-03 17:17:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 4198. [2018-12-03 17:17:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4198 states. [2018-12-03 17:17:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 6787 transitions. [2018-12-03 17:17:28,597 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 6787 transitions. Word has length 19 [2018-12-03 17:17:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:28,597 INFO L480 AbstractCegarLoop]: Abstraction has 4198 states and 6787 transitions. [2018-12-03 17:17:28,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:17:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 6787 transitions. [2018-12-03 17:17:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:17:28,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:28,600 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:28,600 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:28,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-12-03 17:17:28,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:28,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:28,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:28,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:28,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:28,716 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 17:17:28,717 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [32], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 17:17:28,717 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:28,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:28,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:28,744 INFO L272 AbstractInterpreter]: Visited 14 different actions 86 times. Merged at 13 different actions 50 times. Widened at 4 different actions 7 times. Found 22 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:17:28,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:28,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:28,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:28,750 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:28,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:28,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:28,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:17:28,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:17:29,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:29,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-12-03 17:17:29,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:29,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:17:29,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:17:29,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:17:29,029 INFO L87 Difference]: Start difference. First operand 4198 states and 6787 transitions. Second operand 18 states. [2018-12-03 17:17:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:38,948 INFO L93 Difference]: Finished difference Result 7797 states and 12685 transitions. [2018-12-03 17:17:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:17:38,948 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-12-03 17:17:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:38,956 INFO L225 Difference]: With dead ends: 7797 [2018-12-03 17:17:38,956 INFO L226 Difference]: Without dead ends: 7780 [2018-12-03 17:17:38,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2106 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1490, Invalid=6342, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 17:17:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7780 states. [2018-12-03 17:17:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7780 to 4414. [2018-12-03 17:17:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4414 states. [2018-12-03 17:17:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 7114 transitions. [2018-12-03 17:17:41,435 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 7114 transitions. Word has length 19 [2018-12-03 17:17:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:41,435 INFO L480 AbstractCegarLoop]: Abstraction has 4414 states and 7114 transitions. [2018-12-03 17:17:41,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:17:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 7114 transitions. [2018-12-03 17:17:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:17:41,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:41,437 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:17:41,437 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:41,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1608911408, now seen corresponding path program 3 times [2018-12-03 17:17:41,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:41,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:41,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:17:41,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:41,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:41,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:41,564 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:17:41,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:41,564 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:41,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:17:41,574 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:17:41,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:17:41,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:41,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:17:41,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:17:42,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:42,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2018-12-03 17:17:42,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:42,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:17:42,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:17:42,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:17:42,061 INFO L87 Difference]: Start difference. First operand 4414 states and 7114 transitions. Second operand 19 states. [2018-12-03 17:17:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:50,561 INFO L93 Difference]: Finished difference Result 9132 states and 14709 transitions. [2018-12-03 17:17:50,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:17:50,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 17:17:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:50,566 INFO L225 Difference]: With dead ends: 9132 [2018-12-03 17:17:50,567 INFO L226 Difference]: Without dead ends: 4795 [2018-12-03 17:17:50,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3986 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2379, Invalid=11193, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 17:17:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2018-12-03 17:17:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4383. [2018-12-03 17:17:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2018-12-03 17:17:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 7046 transitions. [2018-12-03 17:17:53,295 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 7046 transitions. Word has length 21 [2018-12-03 17:17:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:53,295 INFO L480 AbstractCegarLoop]: Abstraction has 4383 states and 7046 transitions. [2018-12-03 17:17:53,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:17:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 7046 transitions. [2018-12-03 17:17:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:17:53,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:53,297 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:17:53,297 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:53,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:53,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1688920231, now seen corresponding path program 1 times [2018-12-03 17:17:53,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:53,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:53,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:53,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:53,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:53,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:53,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:53,522 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:17:53,522 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [12], [15], [23], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 17:17:53,523 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:17:53,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:17:53,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:17:53,566 INFO L272 AbstractInterpreter]: Visited 15 different actions 93 times. Merged at 12 different actions 59 times. Widened at 3 different actions 6 times. Found 23 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:17:53,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:53,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:17:53,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:53,573 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:53,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:53,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:53,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:53,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:53,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2018-12-03 17:17:53,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:53,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:17:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:17:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:17:53,848 INFO L87 Difference]: Start difference. First operand 4383 states and 7046 transitions. Second operand 17 states. [2018-12-03 17:18:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:02,273 INFO L93 Difference]: Finished difference Result 6406 states and 10276 transitions. [2018-12-03 17:18:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:18:02,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-12-03 17:18:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:02,280 INFO L225 Difference]: With dead ends: 6406 [2018-12-03 17:18:02,280 INFO L226 Difference]: Without dead ends: 6404 [2018-12-03 17:18:02,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1779, Invalid=6411, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 17:18:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2018-12-03 17:18:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 4207. [2018-12-03 17:18:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4207 states. [2018-12-03 17:18:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 6705 transitions. [2018-12-03 17:18:04,951 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 6705 transitions. Word has length 21 [2018-12-03 17:18:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:04,951 INFO L480 AbstractCegarLoop]: Abstraction has 4207 states and 6705 transitions. [2018-12-03 17:18:04,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:18:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 6705 transitions. [2018-12-03 17:18:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:18:04,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:04,953 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:18:04,953 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:04,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:04,953 INFO L82 PathProgramCache]: Analyzing trace with hash 534864297, now seen corresponding path program 1 times [2018-12-03 17:18:04,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:04,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:04,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:04,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:04,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:05,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:05,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:05,050 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 17:18:05,050 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [12], [15], [23], [25], [27], [30], [36], [38], [41], [43], [45], [47], [52] [2018-12-03 17:18:05,050 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:18:05,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:18:05,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:18:05,087 INFO L272 AbstractInterpreter]: Visited 17 different actions 104 times. Merged at 14 different actions 67 times. Widened at 5 different actions 11 times. Found 24 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:18:05,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:05,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:18:05,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:05,091 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:18:05,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:05,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:05,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:05,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:05,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:05,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2018-12-03 17:18:05,344 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:05,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:18:05,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:18:05,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:18:05,345 INFO L87 Difference]: Start difference. First operand 4207 states and 6705 transitions. Second operand 16 states. [2018-12-03 17:18:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:13,239 INFO L93 Difference]: Finished difference Result 6513 states and 10423 transitions. [2018-12-03 17:18:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:18:13,240 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-03 17:18:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:13,244 INFO L225 Difference]: With dead ends: 6513 [2018-12-03 17:18:13,244 INFO L226 Difference]: Without dead ends: 6511 [2018-12-03 17:18:13,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=843, Invalid=3189, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:18:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2018-12-03 17:18:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 3929. [2018-12-03 17:18:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2018-12-03 17:18:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 6254 transitions. [2018-12-03 17:18:15,598 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 6254 transitions. Word has length 21 [2018-12-03 17:18:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:15,598 INFO L480 AbstractCegarLoop]: Abstraction has 3929 states and 6254 transitions. [2018-12-03 17:18:15,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:18:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 6254 transitions. [2018-12-03 17:18:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:18:15,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:15,600 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:18:15,600 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:15,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1298110833, now seen corresponding path program 4 times [2018-12-03 17:18:15,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:15,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:15,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:15,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:15,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:15,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:15,731 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:18:15,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:15,731 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:18:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:15,741 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:15,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:15,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:18:16,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:16,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2018-12-03 17:18:16,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:16,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:18:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:18:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:18:16,053 INFO L87 Difference]: Start difference. First operand 3929 states and 6254 transitions. Second operand 20 states. [2018-12-03 17:18:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:24,660 INFO L93 Difference]: Finished difference Result 9035 states and 14275 transitions. [2018-12-03 17:18:24,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:18:24,660 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-12-03 17:18:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:24,665 INFO L225 Difference]: With dead ends: 9035 [2018-12-03 17:18:24,665 INFO L226 Difference]: Without dead ends: 5121 [2018-12-03 17:18:24,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4505 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1685, Invalid=11655, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:18:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2018-12-03 17:18:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 4285. [2018-12-03 17:18:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4285 states. [2018-12-03 17:18:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6808 transitions. [2018-12-03 17:18:27,323 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6808 transitions. Word has length 21 [2018-12-03 17:18:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:27,323 INFO L480 AbstractCegarLoop]: Abstraction has 4285 states and 6808 transitions. [2018-12-03 17:18:27,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:18:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6808 transitions. [2018-12-03 17:18:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:18:27,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:27,325 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:18:27,325 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:27,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:27,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 5 times [2018-12-03 17:18:27,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:27,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:27,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:27,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:27,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:27,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:27,444 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:18:27,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:27,444 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:18:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:18:27,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:18:27,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:18:27,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:18:27,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:18:27,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:18:27,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:27,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2018-12-03 17:18:27,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:27,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:18:27,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:18:27,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:18:27,966 INFO L87 Difference]: Start difference. First operand 4285 states and 6808 transitions. Second operand 18 states. [2018-12-03 17:18:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:39,760 INFO L93 Difference]: Finished difference Result 6163 states and 9826 transitions. [2018-12-03 17:18:39,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:18:39,760 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 17:18:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:39,765 INFO L225 Difference]: With dead ends: 6163 [2018-12-03 17:18:39,765 INFO L226 Difference]: Without dead ends: 6155 [2018-12-03 17:18:39,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4598 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3445, Invalid=11807, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:18:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2018-12-03 17:18:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 2962. [2018-12-03 17:18:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2962 states. [2018-12-03 17:18:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 4658 transitions. [2018-12-03 17:18:41,772 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 4658 transitions. Word has length 21 [2018-12-03 17:18:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:41,772 INFO L480 AbstractCegarLoop]: Abstraction has 2962 states and 4658 transitions. [2018-12-03 17:18:41,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:18:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 4658 transitions. [2018-12-03 17:18:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:18:41,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:41,774 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:18:41,774 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:41,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 2 times [2018-12-03 17:18:41,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:41,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:18:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:41,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:41,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:41,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:41,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:41,885 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:18:41,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:41,885 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:18:41,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:18:41,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:18:41,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:18:41,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:18:41,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:18:42,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:18:42,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:42,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2018-12-03 17:18:42,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:42,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:18:42,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:18:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:18:42,276 INFO L87 Difference]: Start difference. First operand 2962 states and 4658 transitions. Second operand 21 states. [2018-12-03 17:19:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:01,801 INFO L93 Difference]: Finished difference Result 7444 states and 11843 transitions. [2018-12-03 17:19:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-12-03 17:19:01,802 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 17:19:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:01,809 INFO L225 Difference]: With dead ends: 7444 [2018-12-03 17:19:01,809 INFO L226 Difference]: Without dead ends: 7433 [2018-12-03 17:19:01,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16971 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5184, Invalid=39548, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:19:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2018-12-03 17:19:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 3570. [2018-12-03 17:19:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3570 states. [2018-12-03 17:19:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 5599 transitions. [2018-12-03 17:19:04,502 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 5599 transitions. Word has length 21 [2018-12-03 17:19:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:04,503 INFO L480 AbstractCegarLoop]: Abstraction has 3570 states and 5599 transitions. [2018-12-03 17:19:04,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:19:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 5599 transitions. [2018-12-03 17:19:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:19:04,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:04,504 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:04,504 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:04,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1246813361, now seen corresponding path program 2 times [2018-12-03 17:19:04,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:04,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:19:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:04,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:04,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:04,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:04,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:04,695 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:19:04,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:04,695 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:19:04,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:19:04,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:19:04,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:19:04,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:19:04,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:19:05,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:19:05,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:05,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 17:19:05,451 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:05,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:19:05,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:19:05,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:19:05,452 INFO L87 Difference]: Start difference. First operand 3570 states and 5599 transitions. Second operand 18 states. [2018-12-03 17:19:07,700 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-12-03 17:19:11,587 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-03 17:19:13,205 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 17:19:17,909 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-03 17:19:21,773 WARN L180 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 17:19:29,324 WARN L180 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 17:19:31,161 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 17:19:31,685 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 17:19:34,348 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-12-03 17:19:35,990 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 17:19:36,455 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 17:19:37,100 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 17:19:48,038 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 17:19:49,415 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-03 17:19:50,626 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 17:19:52,768 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 17:19:53,365 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 17:19:54,046 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 17:19:54,307 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-03 17:19:56,332 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 17:20:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:01,845 INFO L93 Difference]: Finished difference Result 7875 states and 12454 transitions. [2018-12-03 17:20:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-12-03 17:20:01,845 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 17:20:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:01,851 INFO L225 Difference]: With dead ends: 7875 [2018-12-03 17:20:01,851 INFO L226 Difference]: Without dead ends: 7864 [2018-12-03 17:20:01,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11758 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=5455, Invalid=26030, Unknown=21, NotChecked=0, Total=31506 [2018-12-03 17:20:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7864 states. [2018-12-03 17:20:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7864 to 3329. [2018-12-03 17:20:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3329 states. [2018-12-03 17:20:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5241 transitions. [2018-12-03 17:20:04,505 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5241 transitions. Word has length 21 [2018-12-03 17:20:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:04,505 INFO L480 AbstractCegarLoop]: Abstraction has 3329 states and 5241 transitions. [2018-12-03 17:20:04,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:20:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5241 transitions. [2018-12-03 17:20:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:20:04,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:04,507 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:04,507 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:04,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:04,507 INFO L82 PathProgramCache]: Analyzing trace with hash -471522047, now seen corresponding path program 2 times [2018-12-03 17:20:04,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:04,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:04,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:20:04,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:04,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:04,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:04,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:04,621 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:04,621 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:04,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:04,621 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:20:04,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:20:04,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:20:04,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 17:20:04,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:04,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:20:04,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:20:04,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:04,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2018-12-03 17:20:04,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:04,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:20:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:20:04,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:20:04,927 INFO L87 Difference]: Start difference. First operand 3329 states and 5241 transitions. Second operand 20 states. [2018-12-03 17:20:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:21,775 INFO L93 Difference]: Finished difference Result 7035 states and 11150 transitions. [2018-12-03 17:20:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-12-03 17:20:21,776 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-03 17:20:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:21,781 INFO L225 Difference]: With dead ends: 7035 [2018-12-03 17:20:21,781 INFO L226 Difference]: Without dead ends: 7033 [2018-12-03 17:20:21,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6829 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3099, Invalid=17493, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:20:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2018-12-03 17:20:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 3236. [2018-12-03 17:20:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3236 states. [2018-12-03 17:20:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 5092 transitions. [2018-12-03 17:20:24,404 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 5092 transitions. Word has length 24 [2018-12-03 17:20:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:24,404 INFO L480 AbstractCegarLoop]: Abstraction has 3236 states and 5092 transitions. [2018-12-03 17:20:24,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:20:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 5092 transitions. [2018-12-03 17:20:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:20:24,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:24,406 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-12-03 17:20:24,406 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:24,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:24,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1997760783, now seen corresponding path program 3 times [2018-12-03 17:20:24,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:24,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:24,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:20:24,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:24,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:20:24,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:24,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:24,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:24,981 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:24,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:24,982 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:20:24,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:20:24,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:20:25,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:20:25,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:25,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 17:20:25,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 17:20:25,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:25,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 28 [2018-12-03 17:20:25,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:25,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:20:25,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:20:25,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:20:25,295 INFO L87 Difference]: Start difference. First operand 3236 states and 5092 transitions. Second operand 24 states. [2018-12-03 17:20:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:32,997 INFO L93 Difference]: Finished difference Result 7022 states and 11034 transitions. [2018-12-03 17:20:32,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:20:32,997 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 17:20:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:33,001 INFO L225 Difference]: With dead ends: 7022 [2018-12-03 17:20:33,001 INFO L226 Difference]: Without dead ends: 3846 [2018-12-03 17:20:33,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4125 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1931, Invalid=10501, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:20:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2018-12-03 17:20:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3462. [2018-12-03 17:20:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2018-12-03 17:20:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 5450 transitions. [2018-12-03 17:20:35,903 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 5450 transitions. Word has length 25 [2018-12-03 17:20:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:35,904 INFO L480 AbstractCegarLoop]: Abstraction has 3462 states and 5450 transitions. [2018-12-03 17:20:35,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:20:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 5450 transitions. [2018-12-03 17:20:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:20:35,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:35,906 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:20:35,906 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:35,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:35,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1735749504, now seen corresponding path program 1 times [2018-12-03 17:20:35,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:35,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:20:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:35,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:36,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:36,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:36,121 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 17:20:36,121 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 17:20:36,122 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:20:36,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:20:36,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:20:36,161 INFO L272 AbstractInterpreter]: Visited 17 different actions 86 times. Merged at 16 different actions 47 times. Widened at 2 different actions 5 times. Found 27 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:20:36,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:36,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:20:36,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:36,197 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:20:36,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:36,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:20:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:36,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:20:36,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:20:36,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:36,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2018-12-03 17:20:36,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:36,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:20:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:20:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:20:36,805 INFO L87 Difference]: Start difference. First operand 3462 states and 5450 transitions. Second operand 24 states. [2018-12-03 17:20:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:51,001 INFO L93 Difference]: Finished difference Result 5001 states and 7932 transitions. [2018-12-03 17:20:51,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-12-03 17:20:51,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 17:20:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:51,006 INFO L225 Difference]: With dead ends: 5001 [2018-12-03 17:20:51,006 INFO L226 Difference]: Without dead ends: 4999 [2018-12-03 17:20:51,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7974 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=4634, Invalid=19858, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 17:20:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2018-12-03 17:20:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 3897. [2018-12-03 17:20:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2018-12-03 17:20:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 6149 transitions. [2018-12-03 17:20:54,306 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 6149 transitions. Word has length 25 [2018-12-03 17:20:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:54,306 INFO L480 AbstractCegarLoop]: Abstraction has 3897 states and 6149 transitions. [2018-12-03 17:20:54,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:20:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 6149 transitions. [2018-12-03 17:20:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:20:54,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:54,308 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:20:54,308 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:54,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash -868093692, now seen corresponding path program 4 times [2018-12-03 17:20:54,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:54,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:54,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:54,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:54,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:54,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:54,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:54,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:54,486 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:54,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:54,487 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:20:54,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:54,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:20:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:54,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:20:54,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:20:54,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2018-12-03 17:20:54,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:54,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:20:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:20:54,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:20:54,785 INFO L87 Difference]: Start difference. First operand 3897 states and 6149 transitions. Second operand 21 states. [2018-12-03 17:20:57,940 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-03 17:21:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:07,214 INFO L93 Difference]: Finished difference Result 5815 states and 9184 transitions. [2018-12-03 17:21:07,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 17:21:07,215 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2018-12-03 17:21:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:07,219 INFO L225 Difference]: With dead ends: 5815 [2018-12-03 17:21:07,219 INFO L226 Difference]: Without dead ends: 5813 [2018-12-03 17:21:07,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6172 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3990, Invalid=14642, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 17:21:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2018-12-03 17:21:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 4101. [2018-12-03 17:21:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2018-12-03 17:21:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6480 transitions. [2018-12-03 17:21:10,778 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6480 transitions. Word has length 25 [2018-12-03 17:21:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:10,778 INFO L480 AbstractCegarLoop]: Abstraction has 4101 states and 6480 transitions. [2018-12-03 17:21:10,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:21:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6480 transitions. [2018-12-03 17:21:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:21:10,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:10,781 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:10,781 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:10,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1568806716, now seen corresponding path program 1 times [2018-12-03 17:21:10,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:10,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:10,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:10,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:10,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:10,988 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 17:21:10,988 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [12], [15], [17], [23], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 17:21:10,989 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:10,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:11,027 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:21:11,028 INFO L272 AbstractInterpreter]: Visited 17 different actions 90 times. Merged at 15 different actions 49 times. Widened at 3 different actions 4 times. Found 29 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:21:11,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:11,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:21:11,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:11,050 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:21:11,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:11,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:21:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:11,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:21:11,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:21:11,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:11,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2018-12-03 17:21:11,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:11,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:21:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:21:11,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:21:11,439 INFO L87 Difference]: Start difference. First operand 4101 states and 6480 transitions. Second operand 24 states. [2018-12-03 17:21:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:30,537 INFO L93 Difference]: Finished difference Result 6832 states and 10869 transitions. [2018-12-03 17:21:30,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 17:21:30,537 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 17:21:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:30,542 INFO L225 Difference]: With dead ends: 6832 [2018-12-03 17:21:30,542 INFO L226 Difference]: Without dead ends: 6830 [2018-12-03 17:21:30,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8022 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4587, Invalid=19593, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:21:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2018-12-03 17:21:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 4656. [2018-12-03 17:21:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2018-12-03 17:21:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 7343 transitions. [2018-12-03 17:21:34,780 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 7343 transitions. Word has length 25 [2018-12-03 17:21:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:34,780 INFO L480 AbstractCegarLoop]: Abstraction has 4656 states and 7343 transitions. [2018-12-03 17:21:34,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:21:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 7343 transitions. [2018-12-03 17:21:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:21:34,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:34,782 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:21:34,783 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:34,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2018393209, now seen corresponding path program 1 times [2018-12-03 17:21:34,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:34,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:34,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:35,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:35,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:35,035 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 17:21:35,035 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 17:21:35,035 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:21:35,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:21:35,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:21:35,072 INFO L272 AbstractInterpreter]: Visited 14 different actions 84 times. Merged at 11 different actions 45 times. Widened at 3 different actions 6 times. Found 24 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 17:21:35,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:35,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:21:35,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:35,108 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:21:35,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:35,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:21:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:35,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 17:21:35,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 17:21:35,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:35,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 27 [2018-12-03 17:21:35,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:35,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:21:35,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:21:35,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:21:35,643 INFO L87 Difference]: Start difference. First operand 4656 states and 7343 transitions. Second operand 22 states. [2018-12-03 17:21:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:55,124 INFO L93 Difference]: Finished difference Result 13604 states and 21281 transitions. [2018-12-03 17:21:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-12-03 17:21:55,125 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-12-03 17:21:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:55,131 INFO L225 Difference]: With dead ends: 13604 [2018-12-03 17:21:55,132 INFO L226 Difference]: Without dead ends: 8871 [2018-12-03 17:21:55,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14964 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3574, Invalid=35432, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:21:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2018-12-03 17:22:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 6323. [2018-12-03 17:22:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6323 states. [2018-12-03 17:22:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 10032 transitions. [2018-12-03 17:22:01,484 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 10032 transitions. Word has length 25 [2018-12-03 17:22:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:01,484 INFO L480 AbstractCegarLoop]: Abstraction has 6323 states and 10032 transitions. [2018-12-03 17:22:01,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:22:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 10032 transitions. [2018-12-03 17:22:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:22:01,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:01,487 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:22:01,487 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:01,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash 998547776, now seen corresponding path program 2 times [2018-12-03 17:22:01,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:01,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:01,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:01,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:01,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:01,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:22:01,661 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:22:01,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:01,661 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:22:01,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:22:01,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:22:01,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:22:01,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:22:01,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:22:01,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:22:02,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:02,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 32 [2018-12-03 17:22:02,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:02,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:22:02,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:22:02,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:22:02,005 INFO L87 Difference]: Start difference. First operand 6323 states and 10032 transitions. Second operand 25 states. [2018-12-03 17:22:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:23,823 INFO L93 Difference]: Finished difference Result 10037 states and 16233 transitions. [2018-12-03 17:22:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-12-03 17:22:23,824 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-12-03 17:22:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:23,832 INFO L225 Difference]: With dead ends: 10037 [2018-12-03 17:22:23,832 INFO L226 Difference]: Without dead ends: 10035 [2018-12-03 17:22:23,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8292 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5205, Invalid=20877, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:22:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10035 states. [2018-12-03 17:22:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10035 to 7166. [2018-12-03 17:22:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7166 states. [2018-12-03 17:22:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7166 states to 7166 states and 11447 transitions. [2018-12-03 17:22:31,281 INFO L78 Accepts]: Start accepts. Automaton has 7166 states and 11447 transitions. Word has length 26 [2018-12-03 17:22:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:31,281 INFO L480 AbstractCegarLoop]: Abstraction has 7166 states and 11447 transitions. [2018-12-03 17:22:31,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:22:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 7166 states and 11447 transitions. [2018-12-03 17:22:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:22:31,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:31,284 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:22:31,284 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:31,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash 604672123, now seen corresponding path program 2 times [2018-12-03 17:22:31,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:31,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:31,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:22:31,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:31,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:31,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:31,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:31,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:22:31,570 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:22:31,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:31,570 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:22:31,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:22:31,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:22:31,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:22:31,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:22:31,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:22:31,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:22:31,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:31,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 31 [2018-12-03 17:22:31,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:31,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:22:31,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:22:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:22:31,889 INFO L87 Difference]: Start difference. First operand 7166 states and 11447 transitions. Second operand 23 states. [2018-12-03 17:22:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:57,531 INFO L93 Difference]: Finished difference Result 15339 states and 24634 transitions. [2018-12-03 17:22:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:22:57,532 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-12-03 17:22:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:57,544 INFO L225 Difference]: With dead ends: 15339 [2018-12-03 17:22:57,544 INFO L226 Difference]: Without dead ends: 15327 [2018-12-03 17:22:57,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1989, Invalid=7713, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 17:22:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15327 states. [2018-12-03 17:23:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15327 to 8956. [2018-12-03 17:23:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8956 states. [2018-12-03 17:23:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8956 states to 8956 states and 14358 transitions. [2018-12-03 17:23:06,703 INFO L78 Accepts]: Start accepts. Automaton has 8956 states and 14358 transitions. Word has length 26 [2018-12-03 17:23:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:06,704 INFO L480 AbstractCegarLoop]: Abstraction has 8956 states and 14358 transitions. [2018-12-03 17:23:06,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:23:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 8956 states and 14358 transitions. [2018-12-03 17:23:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:23:06,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:06,707 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:23:06,707 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:06,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:06,707 INFO L82 PathProgramCache]: Analyzing trace with hash -951541235, now seen corresponding path program 1 times [2018-12-03 17:23:06,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:06,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:23:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:06,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:06,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:06,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:06,912 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 17:23:06,913 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [23], [25], [27], [30], [32], [36], [37], [38], [41], [43] [2018-12-03 17:23:06,913 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:23:06,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:23:06,930 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:23:06,930 INFO L272 AbstractInterpreter]: Visited 14 different actions 59 times. Merged at 12 different actions 28 times. Widened at 2 different actions 2 times. Found 19 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 17:23:06,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:06,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:23:06,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:06,933 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:23:06,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:06,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:23:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:06,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:23:07,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:23:07,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:07,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 33 [2018-12-03 17:23:07,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:07,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:23:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:23:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:23:07,427 INFO L87 Difference]: Start difference. First operand 8956 states and 14358 transitions. Second operand 25 states. [2018-12-03 17:23:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:33,711 INFO L93 Difference]: Finished difference Result 15554 states and 24948 transitions. [2018-12-03 17:23:33,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:23:33,712 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-12-03 17:23:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:33,725 INFO L225 Difference]: With dead ends: 15554 [2018-12-03 17:23:33,726 INFO L226 Difference]: Without dead ends: 15543 [2018-12-03 17:23:33,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2454, Invalid=13046, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 17:23:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15543 states. [2018-12-03 17:23:45,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15543 to 11410. [2018-12-03 17:23:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11410 states. [2018-12-03 17:23:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11410 states to 11410 states and 18355 transitions. [2018-12-03 17:23:45,236 INFO L78 Accepts]: Start accepts. Automaton has 11410 states and 18355 transitions. Word has length 26 [2018-12-03 17:23:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:45,237 INFO L480 AbstractCegarLoop]: Abstraction has 11410 states and 18355 transitions. [2018-12-03 17:23:45,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:23:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 11410 states and 18355 transitions. [2018-12-03 17:23:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:23:45,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:45,240 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:23:45,240 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:45,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:45,241 INFO L82 PathProgramCache]: Analyzing trace with hash 179058058, now seen corresponding path program 2 times [2018-12-03 17:23:45,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:45,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:45,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:45,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:45,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:45,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:45,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:45,412 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:45,412 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:23:45,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:45,413 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:23:45,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:23:45,422 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:23:45,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:23:45,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:23:45,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 19 refuted. 1 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:23:46,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:23:46,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:46,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2018-12-03 17:23:46,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:46,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:23:46,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:23:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=869, Unknown=1, NotChecked=0, Total=992 [2018-12-03 17:23:46,453 INFO L87 Difference]: Start difference. First operand 11410 states and 18355 transitions. Second operand 23 states. [2018-12-03 17:23:54,958 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 17:23:57,439 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 17:23:58,347 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-03 17:23:58,861 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-03 17:24:05,086 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 17:24:08,794 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 17:24:11,414 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 17:24:12,110 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-03 17:24:20,155 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-03 17:24:20,732 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-03 17:24:24,409 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 17:24:24,581 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-12-03 17:24:32,613 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 17:24:33,306 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 17:24:37,368 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-03 17:24:44,124 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-03 17:24:46,311 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 17:24:49,077 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-12-03 17:24:50,720 WARN L180 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-03 17:24:53,271 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-03 17:24:54,480 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 17:25:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:01,495 INFO L93 Difference]: Finished difference Result 14509 states and 23461 transitions. [2018-12-03 17:25:01,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-12-03 17:25:01,495 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-03 17:25:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:01,508 INFO L225 Difference]: With dead ends: 14509 [2018-12-03 17:25:01,509 INFO L226 Difference]: Without dead ends: 14507 [2018-12-03 17:25:01,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10001 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=4976, Invalid=25116, Unknown=10, NotChecked=0, Total=30102 [2018-12-03 17:25:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14507 states. [2018-12-03 17:25:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14507 to 12614. [2018-12-03 17:25:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12614 states. [2018-12-03 17:25:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12614 states to 12614 states and 20350 transitions. [2018-12-03 17:25:14,182 INFO L78 Accepts]: Start accepts. Automaton has 12614 states and 20350 transitions. Word has length 28 [2018-12-03 17:25:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:14,182 INFO L480 AbstractCegarLoop]: Abstraction has 12614 states and 20350 transitions. [2018-12-03 17:25:14,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:25:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 12614 states and 20350 transitions. [2018-12-03 17:25:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:25:14,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:14,186 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2018-12-03 17:25:14,186 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:14,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1671739405, now seen corresponding path program 5 times [2018-12-03 17:25:14,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:14,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:14,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:25:14,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:14,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:25:14,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:14,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:14,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:25:14,345 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:25:14,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:14,345 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:25:14,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:25:14,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:25:14,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:25:14,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:25:14,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:25:14,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:25:14,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:14,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2018-12-03 17:25:14,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:14,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:25:14,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:25:14,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:25:14,989 INFO L87 Difference]: Start difference. First operand 12614 states and 20350 transitions. Second operand 22 states. [2018-12-03 17:25:18,675 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 17:25:19,452 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 17:25:23,757 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 17:25:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:39,106 INFO L93 Difference]: Finished difference Result 15552 states and 25060 transitions. [2018-12-03 17:25:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:25:39,107 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-12-03 17:25:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:39,120 INFO L225 Difference]: With dead ends: 15552 [2018-12-03 17:25:39,120 INFO L226 Difference]: Without dead ends: 15550 [2018-12-03 17:25:39,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2591 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2534, Invalid=8386, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 17:25:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15550 states. [2018-12-03 17:25:50,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15550 to 10792. [2018-12-03 17:25:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10792 states. [2018-12-03 17:25:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10792 states to 10792 states and 17288 transitions. [2018-12-03 17:25:50,476 INFO L78 Accepts]: Start accepts. Automaton has 10792 states and 17288 transitions. Word has length 28 [2018-12-03 17:25:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:50,477 INFO L480 AbstractCegarLoop]: Abstraction has 10792 states and 17288 transitions. [2018-12-03 17:25:50,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:25:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 10792 states and 17288 transitions. [2018-12-03 17:25:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:25:50,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:50,480 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:25:50,480 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:50,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:50,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1100753059, now seen corresponding path program 1 times [2018-12-03 17:25:50,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:50,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:50,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:25:50,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:50,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:25:50,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:50,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:50,633 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 17:25:50,633 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [19], [25], [26], [27], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 17:25:50,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:25:50,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:25:50,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:25:50,669 INFO L272 AbstractInterpreter]: Visited 19 different actions 102 times. Merged at 17 different actions 53 times. Widened at 4 different actions 10 times. Found 35 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 17:25:50,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:50,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:25:50,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:50,672 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:25:50,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:50,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:25:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:50,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:25:50,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:25:51,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:51,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2018-12-03 17:25:51,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:51,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:25:51,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:25:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:25:51,027 INFO L87 Difference]: Start difference. First operand 10792 states and 17288 transitions. Second operand 23 states. [2018-12-03 17:26:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:10,885 INFO L93 Difference]: Finished difference Result 23424 states and 37581 transitions. [2018-12-03 17:26:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:26:10,886 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-03 17:26:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:10,897 INFO L225 Difference]: With dead ends: 23424 [2018-12-03 17:26:10,897 INFO L226 Difference]: Without dead ends: 12688 [2018-12-03 17:26:10,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4441 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1892, Invalid=12628, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 17:26:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12688 states. [2018-12-03 17:26:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12688 to 10781. [2018-12-03 17:26:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10781 states. [2018-12-03 17:26:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10781 states to 10781 states and 17283 transitions. [2018-12-03 17:26:22,299 INFO L78 Accepts]: Start accepts. Automaton has 10781 states and 17283 transitions. Word has length 28 [2018-12-03 17:26:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:22,299 INFO L480 AbstractCegarLoop]: Abstraction has 10781 states and 17283 transitions. [2018-12-03 17:26:22,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:26:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 10781 states and 17283 transitions. [2018-12-03 17:26:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:26:22,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:22,302 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:26:22,302 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:22,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash 564227467, now seen corresponding path program 1 times [2018-12-03 17:26:22,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:22,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:22,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:22,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:22,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:22,493 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 17:26:22,493 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [12], [15], [17], [23], [25], [27], [30], [36], [38], [41], [43], [45], [47], [52] [2018-12-03 17:26:22,494 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:26:22,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:26:22,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:26:22,536 INFO L272 AbstractInterpreter]: Visited 19 different actions 100 times. Merged at 18 different actions 58 times. Widened at 5 different actions 6 times. Found 28 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 17:26:22,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:22,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:26:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:22,579 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:26:22,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:22,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:22,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:26:23,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:26:24,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:24,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 29 [2018-12-03 17:26:24,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:24,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:26:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:26:24,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:26:24,139 INFO L87 Difference]: Start difference. First operand 10781 states and 17283 transitions. Second operand 21 states. [2018-12-03 17:26:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:49,492 INFO L93 Difference]: Finished difference Result 16329 states and 26678 transitions. [2018-12-03 17:26:49,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:26:49,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-12-03 17:26:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:49,507 INFO L225 Difference]: With dead ends: 16329 [2018-12-03 17:26:49,507 INFO L226 Difference]: Without dead ends: 16327 [2018-12-03 17:26:49,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1058, Invalid=4642, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:26:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16327 states. [2018-12-03 17:27:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16327 to 12706. [2018-12-03 17:27:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12706 states. [2018-12-03 17:27:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12706 states to 12706 states and 20489 transitions. [2018-12-03 17:27:02,919 INFO L78 Accepts]: Start accepts. Automaton has 12706 states and 20489 transitions. Word has length 28 [2018-12-03 17:27:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:02,919 INFO L480 AbstractCegarLoop]: Abstraction has 12706 states and 20489 transitions. [2018-12-03 17:27:02,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:27:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 12706 states and 20489 transitions. [2018-12-03 17:27:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:27:02,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:02,924 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:27:02,924 INFO L423 AbstractCegarLoop]: === Iteration 86 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:02,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash -323092399, now seen corresponding path program 3 times [2018-12-03 17:27:02,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:02,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:02,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:02,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:02,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:27:03,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:03,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:03,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:03,112 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:27:03,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:03,112 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:03,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:03,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:03,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:03,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:03,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 17:27:03,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 17:27:03,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:03,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 28 [2018-12-03 17:27:03,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:03,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:27:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:27:03,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:27:03,467 INFO L87 Difference]: Start difference. First operand 12706 states and 20489 transitions. Second operand 23 states. [2018-12-03 17:27:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:28,374 INFO L93 Difference]: Finished difference Result 28476 states and 46054 transitions. [2018-12-03 17:27:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:27:28,375 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-12-03 17:27:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:28,389 INFO L225 Difference]: With dead ends: 28476 [2018-12-03 17:27:28,389 INFO L226 Difference]: Without dead ends: 15810 [2018-12-03 17:27:28,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2122 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1154, Invalid=7402, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 17:27:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15810 states. [2018-12-03 17:27:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15810 to 13019. [2018-12-03 17:27:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13019 states. [2018-12-03 17:27:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13019 states to 13019 states and 21016 transitions. [2018-12-03 17:27:42,857 INFO L78 Accepts]: Start accepts. Automaton has 13019 states and 21016 transitions. Word has length 31 [2018-12-03 17:27:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:42,858 INFO L480 AbstractCegarLoop]: Abstraction has 13019 states and 21016 transitions. [2018-12-03 17:27:42,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:27:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 13019 states and 21016 transitions. [2018-12-03 17:27:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:27:42,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:42,863 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2018-12-03 17:27:42,863 INFO L423 AbstractCegarLoop]: === Iteration 87 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:42,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:42,864 INFO L82 PathProgramCache]: Analyzing trace with hash 537548598, now seen corresponding path program 4 times [2018-12-03 17:27:42,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:42,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:42,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:42,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:42,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 17:27:43,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:43,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:43,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:43,245 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:27:43,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:43,245 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:43,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:43,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:43,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 17:27:43,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 17:27:43,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:43,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 30 [2018-12-03 17:27:43,585 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:43,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:27:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:27:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:27:43,586 INFO L87 Difference]: Start difference. First operand 13019 states and 21016 transitions. Second operand 25 states. [2018-12-03 17:28:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:04,813 INFO L93 Difference]: Finished difference Result 27255 states and 43926 transitions. [2018-12-03 17:28:04,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:28:04,813 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-12-03 17:28:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:04,830 INFO L225 Difference]: With dead ends: 27255 [2018-12-03 17:28:04,831 INFO L226 Difference]: Without dead ends: 14276 [2018-12-03 17:28:04,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1101, Invalid=4449, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:28:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14276 states.