java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:34:54,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:34:54,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:34:54,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:34:54,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:34:54,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:34:54,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:34:54,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:34:54,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:34:54,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:34:54,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:34:54,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:34:54,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:34:54,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:34:54,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:34:54,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:34:54,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:34:54,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:34:54,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:34:54,596 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:34:54,597 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:34:54,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:34:54,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:34:54,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:34:54,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:34:54,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:34:54,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:34:54,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:34:54,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:34:54,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:34:54,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:34:54,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:34:54,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:34:54,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:34:54,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:34:54,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:34:54,617 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:34:54,631 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:34:54,631 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:34:54,632 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:34:54,632 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:34:54,632 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:34:54,633 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:34:54,633 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:34:54,633 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:34:54,633 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:34:54,634 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:34:54,634 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:34:54,634 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:34:54,634 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:34:54,634 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:34:54,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:34:54,636 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:34:54,636 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:34:54,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:34:54,636 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:34:54,637 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:34:54,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:34:54,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:34:54,639 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:34:54,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:34:54,639 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:34:54,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:34:54,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:34:54,640 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:34:54,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:34:54,640 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:34:54,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:34:54,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:34:54,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:34:54,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:34:54,641 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:34:54,641 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:34:54,641 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:34:54,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:34:54,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:34:54,642 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:34:54,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:34:54,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:34:54,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:34:54,717 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:34:54,717 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:34:54,719 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 18:34:54,719 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-12-03 18:34:54,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:34:54,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:34:54,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:34:54,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:34:54,762 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:34:54,782 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,792 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,798 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:34:54,798 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:34:54,799 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:34:54,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:34:54,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:34:54,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:34:54,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:34:54,814 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,815 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,815 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,816 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,823 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,827 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,828 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 06:34:54" (1/1) ... [2018-12-03 18:34:54,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:34:54,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:34:54,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:34:54,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:34:54,832 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 06:34:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:34:54,903 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 18:34:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 18:34:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 18:34:55,429 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:34:55,430 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:34:55,430 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:34:55 BoogieIcfgContainer [2018-12-03 18:34:55,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:34:55,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:34:55,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:34:55,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:34:55,436 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 06:34:54" (1/2) ... [2018-12-03 18:34:55,437 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 06:34:55, skipping insertion in model container [2018-12-03 18:34:55,438 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 06:34:55" (2/2) ... [2018-12-03 18:34:55,439 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-12-03 18:34:55,448 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:34:55,456 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-03 18:34:55,472 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-03 18:34:55,505 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:34:55,505 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:34:55,505 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:34:55,505 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:34:55,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:34:55,506 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:34:55,506 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:34:55,506 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:34:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 18:34:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:34:55,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:55,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:34:55,534 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:55,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-12-03 18:34:55,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:55,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:55,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:55,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:55,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:55,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:55,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:55,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:55,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:34:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:34:55,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:34:55,759 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-12-03 18:34:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:56,322 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-12-03 18:34:56,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:34:56,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 18:34:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:56,337 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:34:56,338 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:34:56,341 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 18:34:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:34:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-03 18:34:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:34:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-12-03 18:34:56,382 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-12-03 18:34:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:56,382 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-12-03 18:34:56,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:34:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-12-03 18:34:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:34:56,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:56,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:34:56,384 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:56,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:56,384 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-12-03 18:34:56,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:56,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:56,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:56,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:56,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:34:56,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:56,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:34:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:34:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:34:56,454 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-12-03 18:34:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:56,792 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-12-03 18:34:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:34:56,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 18:34:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:56,794 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:34:56,794 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:34:56,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:34:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:34:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-12-03 18:34:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:34:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-12-03 18:34:56,804 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-12-03 18:34:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:56,804 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-12-03 18:34:56,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:34:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-12-03 18:34:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:34:56,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:56,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:34:56,806 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:56,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-12-03 18:34:56,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:56,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:56,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:56,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:56,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:34:56,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:56,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:34:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:34:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:34:56,902 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-12-03 18:34:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:57,616 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-12-03 18:34:57,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:34:57,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 18:34:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:57,618 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:34:57,618 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:34:57,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:34:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:34:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-12-03 18:34:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:34:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-12-03 18:34:57,629 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-12-03 18:34:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:57,630 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-12-03 18:34:57,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:34:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-12-03 18:34:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:34:57,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:57,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:34:57,632 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:57,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-12-03 18:34:57,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:57,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:57,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:57,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:57,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:57,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:34:57,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:57,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:34:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:34:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:34:57,708 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-12-03 18:34:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:57,968 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-12-03 18:34:57,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:34:57,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 18:34:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:57,970 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:34:57,970 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:34:57,971 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 18:34:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:34:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-12-03 18:34:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:34:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-12-03 18:34:57,982 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-12-03 18:34:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:57,983 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-12-03 18:34:57,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:34:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-12-03 18:34:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:34:57,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:57,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:57,985 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:57,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:57,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-12-03 18:34:57,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:57,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:57,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:57,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:58,180 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 18:34:58,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:58,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:58,182 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 18:34:58,184 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46] [2018-12-03 18:34:58,241 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:34:58,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:58,384 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:34:58,386 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 18:34:58,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:58,436 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:34:58,531 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 47.02% of their original sizes. [2018-12-03 18:34:58,531 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:34:58,788 INFO L418 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2018-12-03 18:34:58,788 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:34:58,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:34:58,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-12-03 18:34:58,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:58,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:58,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:58,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:58,792 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 9 states. [2018-12-03 18:35:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:01,180 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2018-12-03 18:35:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:35:01,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 18:35:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:01,181 INFO L225 Difference]: With dead ends: 73 [2018-12-03 18:35:01,181 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 18:35:01,182 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:35:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 18:35:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2018-12-03 18:35:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:35:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2018-12-03 18:35:01,196 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 85 transitions. Word has length 8 [2018-12-03 18:35:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:01,196 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 85 transitions. [2018-12-03 18:35:01,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:35:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2018-12-03 18:35:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:01,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:01,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:01,198 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:01,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-12-03 18:35:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:01,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:01,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:01,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:01,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 18:35:01,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:01,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:35:01,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:35:01,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:35:01,405 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. Second operand 8 states. [2018-12-03 18:35:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:01,940 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2018-12-03 18:35:01,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:35:01,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 18:35:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:01,945 INFO L225 Difference]: With dead ends: 89 [2018-12-03 18:35:01,945 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 18:35:01,946 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 18:35:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 18:35:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2018-12-03 18:35:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 18:35:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 118 transitions. [2018-12-03 18:35:01,981 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 118 transitions. Word has length 8 [2018-12-03 18:35:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:01,981 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 118 transitions. [2018-12-03 18:35:01,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:35:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 118 transitions. [2018-12-03 18:35:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:01,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:01,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:01,984 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:01,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-12-03 18:35:01,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:01,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:01,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:02,136 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 18:35:02,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:02,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:02,137 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 18:35:02,138 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [45], [47], [50] [2018-12-03 18:35:02,139 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:02,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:02,165 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:02,166 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 18:35:02,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:02,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:02,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:02,181 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 18:35:02,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:02,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:02,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:02,521 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 18:35:02,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:02,771 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 18:35:02,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:02,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2018-12-03 18:35:02,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:02,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:35:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:35:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:02,793 INFO L87 Difference]: Start difference. First operand 69 states and 118 transitions. Second operand 13 states. [2018-12-03 18:35:03,882 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-12-03 18:35:04,446 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-12-03 18:35:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:05,686 INFO L93 Difference]: Finished difference Result 130 states and 207 transitions. [2018-12-03 18:35:05,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:35:05,687 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-03 18:35:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:05,689 INFO L225 Difference]: With dead ends: 130 [2018-12-03 18:35:05,689 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 18:35:05,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=422, Invalid=1300, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:35:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 18:35:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2018-12-03 18:35:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 18:35:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 150 transitions. [2018-12-03 18:35:05,724 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 150 transitions. Word has length 8 [2018-12-03 18:35:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:05,725 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 150 transitions. [2018-12-03 18:35:05,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:35:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 150 transitions. [2018-12-03 18:35:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:05,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:05,726 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:05,726 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:05,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-12-03 18:35:05,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:05,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:05,807 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 18:35:05,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:05,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:05,808 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 18:35:05,808 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [45], [46], [47], [50] [2018-12-03 18:35:05,809 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:05,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:05,836 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:05,836 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 18:35:05,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:05,871 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:05,882 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 57.14% of their original sizes. [2018-12-03 18:35:05,882 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:06,033 INFO L418 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2018-12-03 18:35:06,034 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:06,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:06,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 12 [2018-12-03 18:35:06,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:06,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:35:06,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:35:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:35:06,036 INFO L87 Difference]: Start difference. First operand 87 states and 150 transitions. Second operand 9 states. [2018-12-03 18:35:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:06,618 INFO L93 Difference]: Finished difference Result 114 states and 198 transitions. [2018-12-03 18:35:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:35:06,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 18:35:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:06,620 INFO L225 Difference]: With dead ends: 114 [2018-12-03 18:35:06,620 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 18:35:06,621 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:35:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 18:35:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2018-12-03 18:35:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 18:35:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 162 transitions. [2018-12-03 18:35:06,650 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 162 transitions. Word has length 8 [2018-12-03 18:35:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:06,651 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 162 transitions. [2018-12-03 18:35:06,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:35:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 162 transitions. [2018-12-03 18:35:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:06,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:06,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:06,652 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:06,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-12-03 18:35:06,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:06,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:06,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:06,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:06,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:06,812 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 18:35:06,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:06,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:06,813 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 18:35:06,813 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [17], [25], [26] [2018-12-03 18:35:06,815 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:06,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:06,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:06,821 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 18:35:06,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:06,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:06,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:06,840 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 18:35:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:06,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:06,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:06,943 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 18:35:06,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:06,983 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 18:35:07,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:07,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-12-03 18:35:07,003 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:07,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:35:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:35:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:35:07,004 INFO L87 Difference]: Start difference. First operand 93 states and 162 transitions. Second operand 12 states. [2018-12-03 18:35:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:07,740 INFO L93 Difference]: Finished difference Result 189 states and 321 transitions. [2018-12-03 18:35:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:35:07,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-03 18:35:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:07,742 INFO L225 Difference]: With dead ends: 189 [2018-12-03 18:35:07,742 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 18:35:07,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:35:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 18:35:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 147. [2018-12-03 18:35:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 18:35:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 260 transitions. [2018-12-03 18:35:07,795 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 260 transitions. Word has length 8 [2018-12-03 18:35:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:07,795 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 260 transitions. [2018-12-03 18:35:07,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:35:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 260 transitions. [2018-12-03 18:35:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:07,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:07,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:07,796 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:07,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-12-03 18:35:07,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:07,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:07,877 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 18:35:07,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:07,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:07,878 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 18:35:07,878 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [45], [46] [2018-12-03 18:35:07,879 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:07,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:07,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:07,896 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 18:35:07,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:07,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:07,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:07,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:35:07,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:07,911 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:07,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:08,009 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 18:35:08,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:08,087 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 18:35:08,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:08,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 18:35:08,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:08,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:35:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:35:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:08,109 INFO L87 Difference]: Start difference. First operand 147 states and 260 transitions. Second operand 10 states. [2018-12-03 18:35:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:09,163 INFO L93 Difference]: Finished difference Result 209 states and 352 transitions. [2018-12-03 18:35:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:35:09,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-03 18:35:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:09,165 INFO L225 Difference]: With dead ends: 209 [2018-12-03 18:35:09,165 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 18:35:09,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:35:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 18:35:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 168. [2018-12-03 18:35:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 18:35:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 300 transitions. [2018-12-03 18:35:09,207 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 300 transitions. Word has length 8 [2018-12-03 18:35:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:09,207 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 300 transitions. [2018-12-03 18:35:09,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:35:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 300 transitions. [2018-12-03 18:35:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:09,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:09,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:09,209 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:09,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:09,209 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-12-03 18:35:09,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:09,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:09,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:09,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:09,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:09,279 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 18:35:09,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:09,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:09,280 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 18:35:09,280 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [26], [36], [38], [43] [2018-12-03 18:35:09,281 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:09,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:09,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:09,298 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 18:35:09,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:09,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:09,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:09,334 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 18:35:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:09,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:09,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:09,370 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 18:35:09,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:09,496 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 18:35:09,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:09,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 18:35:09,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:09,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:09,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:09,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:09,517 INFO L87 Difference]: Start difference. First operand 168 states and 300 transitions. Second operand 7 states. [2018-12-03 18:35:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:09,871 INFO L93 Difference]: Finished difference Result 215 states and 373 transitions. [2018-12-03 18:35:09,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:35:09,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 18:35:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:09,874 INFO L225 Difference]: With dead ends: 215 [2018-12-03 18:35:09,874 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 18:35:09,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:35:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 18:35:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 177. [2018-12-03 18:35:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 18:35:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 317 transitions. [2018-12-03 18:35:09,917 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 317 transitions. Word has length 8 [2018-12-03 18:35:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:09,918 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 317 transitions. [2018-12-03 18:35:09,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 317 transitions. [2018-12-03 18:35:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:09,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:09,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:09,919 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:09,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-12-03 18:35:09,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:09,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:09,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:09,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:09,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:10,111 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 18:35:10,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:10,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:10,111 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 18:35:10,111 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [45], [47], [50] [2018-12-03 18:35:10,112 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:10,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:10,116 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:10,116 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 18:35:10,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:10,128 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:10,137 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 47.02% of their original sizes. [2018-12-03 18:35:10,137 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:10,206 INFO L418 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2018-12-03 18:35:10,206 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:10,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:10,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-12-03 18:35:10,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:10,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:35:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:35:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:35:10,207 INFO L87 Difference]: Start difference. First operand 177 states and 317 transitions. Second operand 9 states. [2018-12-03 18:35:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:11,599 INFO L93 Difference]: Finished difference Result 205 states and 366 transitions. [2018-12-03 18:35:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:35:11,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 18:35:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:11,601 INFO L225 Difference]: With dead ends: 205 [2018-12-03 18:35:11,601 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 18:35:11,601 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:35:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 18:35:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 190. [2018-12-03 18:35:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 18:35:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 340 transitions. [2018-12-03 18:35:11,640 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 340 transitions. Word has length 8 [2018-12-03 18:35:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:11,640 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 340 transitions. [2018-12-03 18:35:11,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:35:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 340 transitions. [2018-12-03 18:35:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:11,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:11,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:11,641 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:11,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-12-03 18:35:11,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:11,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:11,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:11,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:11,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:11,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:11,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 18:35:11,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:11,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:11,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:11,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:11,713 INFO L87 Difference]: Start difference. First operand 190 states and 340 transitions. Second operand 7 states. [2018-12-03 18:35:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:12,110 INFO L93 Difference]: Finished difference Result 276 states and 487 transitions. [2018-12-03 18:35:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:35:12,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 18:35:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:12,113 INFO L225 Difference]: With dead ends: 276 [2018-12-03 18:35:12,113 INFO L226 Difference]: Without dead ends: 274 [2018-12-03 18:35:12,113 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 18:35:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-03 18:35:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 228. [2018-12-03 18:35:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-03 18:35:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 407 transitions. [2018-12-03 18:35:12,162 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 407 transitions. Word has length 8 [2018-12-03 18:35:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:12,163 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 407 transitions. [2018-12-03 18:35:12,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 407 transitions. [2018-12-03 18:35:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:35:12,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:12,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:12,163 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:12,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:12,164 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-12-03 18:35:12,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:12,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:12,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:12,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:12,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:12,226 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 18:35:12,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:12,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:12,226 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 18:35:12,226 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [25], [27], [32] [2018-12-03 18:35:12,227 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:12,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:12,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:12,231 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 18:35:12,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:12,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:12,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:12,241 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 18:35:12,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:12,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:12,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:12,269 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 18:35:12,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:12,321 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 18:35:12,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:12,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 18:35:12,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:12,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:12,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:12,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:12,346 INFO L87 Difference]: Start difference. First operand 228 states and 407 transitions. Second operand 7 states. [2018-12-03 18:35:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:12,717 INFO L93 Difference]: Finished difference Result 368 states and 660 transitions. [2018-12-03 18:35:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:35:12,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 18:35:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:12,720 INFO L225 Difference]: With dead ends: 368 [2018-12-03 18:35:12,720 INFO L226 Difference]: Without dead ends: 366 [2018-12-03 18:35:12,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:35:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-03 18:35:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 303. [2018-12-03 18:35:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-03 18:35:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 546 transitions. [2018-12-03 18:35:12,791 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 546 transitions. Word has length 8 [2018-12-03 18:35:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:12,791 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 546 transitions. [2018-12-03 18:35:12,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 546 transitions. [2018-12-03 18:35:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:12,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:12,792 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:12,792 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:12,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-12-03 18:35:12,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:12,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:12,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:12,863 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 18:35:12,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:12,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:12,863 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:12,864 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [50] [2018-12-03 18:35:12,865 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:12,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:12,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:12,892 INFO L272 AbstractInterpreter]: Visited 10 different actions 45 times. Merged at 7 different actions 28 times. Widened at 1 different actions 4 times. Found 8 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 18:35:12,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:12,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:12,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:12,897 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 18:35:12,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:12,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:12,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:12,978 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 18:35:12,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:13,014 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 18:35:13,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:13,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 18:35:13,033 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:13,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:35:13,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:35:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:35:13,034 INFO L87 Difference]: Start difference. First operand 303 states and 546 transitions. Second operand 10 states. [2018-12-03 18:35:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:14,204 INFO L93 Difference]: Finished difference Result 503 states and 892 transitions. [2018-12-03 18:35:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:35:14,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-12-03 18:35:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:14,207 INFO L225 Difference]: With dead ends: 503 [2018-12-03 18:35:14,208 INFO L226 Difference]: Without dead ends: 501 [2018-12-03 18:35:14,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-12-03 18:35:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-12-03 18:35:14,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 381. [2018-12-03 18:35:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 18:35:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 689 transitions. [2018-12-03 18:35:14,312 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 689 transitions. Word has length 11 [2018-12-03 18:35:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:14,313 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 689 transitions. [2018-12-03 18:35:14,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:35:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 689 transitions. [2018-12-03 18:35:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:14,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:14,314 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:14,314 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:14,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-12-03 18:35:14,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:14,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:14,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:14,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:14,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:14,495 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 18:35:14,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:14,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:14,496 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:14,496 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 18:35:14,497 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:14,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:14,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:14,512 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 18:35:14,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:14,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:14,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:14,526 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 18:35:14,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:14,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:14,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:14,632 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 18:35:14,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:14,703 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 18:35:14,723 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:14,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 17 [2018-12-03 18:35:14,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:14,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:14,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:14,724 INFO L87 Difference]: Start difference. First operand 381 states and 689 transitions. Second operand 7 states. [2018-12-03 18:35:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:15,836 INFO L93 Difference]: Finished difference Result 818 states and 1449 transitions. [2018-12-03 18:35:15,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:35:15,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 18:35:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:15,840 INFO L225 Difference]: With dead ends: 818 [2018-12-03 18:35:15,840 INFO L226 Difference]: Without dead ends: 492 [2018-12-03 18:35:15,842 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 18:35:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-12-03 18:35:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 409. [2018-12-03 18:35:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-03 18:35:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 734 transitions. [2018-12-03 18:35:15,969 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 734 transitions. Word has length 11 [2018-12-03 18:35:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:15,970 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 734 transitions. [2018-12-03 18:35:15,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 734 transitions. [2018-12-03 18:35:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:15,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:15,971 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:15,971 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:15,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash 707063270, now seen corresponding path program 1 times [2018-12-03 18:35:15,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:15,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:15,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:15,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:15,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:16,450 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 18:35:16,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:16,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:16,451 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:16,451 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [50] [2018-12-03 18:35:16,453 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:16,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:16,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:16,473 INFO L272 AbstractInterpreter]: Visited 10 different actions 45 times. Merged at 7 different actions 26 times. Widened at 1 different actions 4 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 18:35:16,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:16,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:16,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:16,499 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 18:35:16,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:16,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:16,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:16,636 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 18:35:16,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:16,842 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 18:35:16,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:16,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2018-12-03 18:35:16,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:16,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:35:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:35:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:35:16,863 INFO L87 Difference]: Start difference. First operand 409 states and 734 transitions. Second operand 13 states. [2018-12-03 18:35:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:18,160 INFO L93 Difference]: Finished difference Result 584 states and 1021 transitions. [2018-12-03 18:35:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:35:18,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-12-03 18:35:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:18,163 INFO L225 Difference]: With dead ends: 584 [2018-12-03 18:35:18,164 INFO L226 Difference]: Without dead ends: 582 [2018-12-03 18:35:18,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=306, Invalid=1176, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:35:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-12-03 18:35:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 421. [2018-12-03 18:35:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 18:35:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 752 transitions. [2018-12-03 18:35:18,278 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 752 transitions. Word has length 11 [2018-12-03 18:35:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:18,278 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 752 transitions. [2018-12-03 18:35:18,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:35:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 752 transitions. [2018-12-03 18:35:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:18,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:18,279 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:18,280 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:18,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-12-03 18:35:18,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:18,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:18,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:18,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:18,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:18,380 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 18:35:18,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:18,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:18,380 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:18,381 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [11], [12], [15], [19], [45], [47], [52] [2018-12-03 18:35:18,382 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:18,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:18,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:18,405 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 18:35:18,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:18,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:18,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:18,432 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 18:35:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:18,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:18,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:18,559 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 18:35:18,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:18,628 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 18:35:18,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:18,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 16 [2018-12-03 18:35:18,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:18,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:18,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:18,647 INFO L87 Difference]: Start difference. First operand 421 states and 752 transitions. Second operand 7 states. [2018-12-03 18:35:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:18,925 INFO L93 Difference]: Finished difference Result 881 states and 1567 transitions. [2018-12-03 18:35:18,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:35:18,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 18:35:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:18,931 INFO L225 Difference]: With dead ends: 881 [2018-12-03 18:35:18,931 INFO L226 Difference]: Without dead ends: 509 [2018-12-03 18:35:18,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-03 18:35:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 480. [2018-12-03 18:35:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-12-03 18:35:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 848 transitions. [2018-12-03 18:35:19,056 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 848 transitions. Word has length 11 [2018-12-03 18:35:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:19,056 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 848 transitions. [2018-12-03 18:35:19,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 848 transitions. [2018-12-03 18:35:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:19,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:19,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:19,058 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:19,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-12-03 18:35:19,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:19,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:19,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:19,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:19,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:19,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:19,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:35:19,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:19,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:35:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:35:19,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:35:19,172 INFO L87 Difference]: Start difference. First operand 480 states and 848 transitions. Second operand 8 states. [2018-12-03 18:35:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:19,819 INFO L93 Difference]: Finished difference Result 534 states and 923 transitions. [2018-12-03 18:35:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:35:19,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 18:35:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:19,822 INFO L225 Difference]: With dead ends: 534 [2018-12-03 18:35:19,822 INFO L226 Difference]: Without dead ends: 532 [2018-12-03 18:35:19,823 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 18:35:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-12-03 18:35:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 470. [2018-12-03 18:35:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-12-03 18:35:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 830 transitions. [2018-12-03 18:35:19,971 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 830 transitions. Word has length 11 [2018-12-03 18:35:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:19,971 INFO L480 AbstractCegarLoop]: Abstraction has 470 states and 830 transitions. [2018-12-03 18:35:19,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:35:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 830 transitions. [2018-12-03 18:35:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:19,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:19,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:19,975 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:19,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-12-03 18:35:19,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:19,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:19,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:19,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:19,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:20,032 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 18:35:20,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:20,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:20,033 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:20,033 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [36], [37], [45], [47], [50] [2018-12-03 18:35:20,034 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:20,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:20,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:20,046 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 18:35:20,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:20,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:20,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:20,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 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 18:35:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:20,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:20,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:20,127 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 18:35:20,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:20,154 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 18:35:20,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:20,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-12-03 18:35:20,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:20,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:35:20,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:35:20,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:35:20,174 INFO L87 Difference]: Start difference. First operand 470 states and 830 transitions. Second operand 9 states. [2018-12-03 18:35:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:20,814 INFO L93 Difference]: Finished difference Result 544 states and 944 transitions. [2018-12-03 18:35:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:35:20,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-03 18:35:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:20,817 INFO L225 Difference]: With dead ends: 544 [2018-12-03 18:35:20,817 INFO L226 Difference]: Without dead ends: 542 [2018-12-03 18:35:20,818 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 18:35:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-12-03 18:35:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 474. [2018-12-03 18:35:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-12-03 18:35:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 836 transitions. [2018-12-03 18:35:20,958 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 836 transitions. Word has length 11 [2018-12-03 18:35:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:20,959 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 836 transitions. [2018-12-03 18:35:20,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:35:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 836 transitions. [2018-12-03 18:35:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:20,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:20,960 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:20,960 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:20,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-12-03 18:35:20,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:20,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:20,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:21,039 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 18:35:21,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:21,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:21,040 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:21,040 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [45], [46], [47], [50] [2018-12-03 18:35:21,041 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:21,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:21,058 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:21,058 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 18:35:21,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:21,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:21,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:21,061 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 18:35:21,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:21,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:21,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:21,175 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 18:35:21,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:21,299 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 18:35:21,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:21,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 16 [2018-12-03 18:35:21,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:21,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:35:21,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:35:21,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:21,319 INFO L87 Difference]: Start difference. First operand 474 states and 836 transitions. Second operand 13 states. [2018-12-03 18:35:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:23,047 INFO L93 Difference]: Finished difference Result 636 states and 1090 transitions. [2018-12-03 18:35:23,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:35:23,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-12-03 18:35:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:23,051 INFO L225 Difference]: With dead ends: 636 [2018-12-03 18:35:23,051 INFO L226 Difference]: Without dead ends: 634 [2018-12-03 18:35:23,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:35:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-12-03 18:35:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 518. [2018-12-03 18:35:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-12-03 18:35:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 916 transitions. [2018-12-03 18:35:23,200 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 916 transitions. Word has length 11 [2018-12-03 18:35:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:23,201 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 916 transitions. [2018-12-03 18:35:23,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:35:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 916 transitions. [2018-12-03 18:35:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:23,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:23,202 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:23,202 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:23,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-12-03 18:35:23,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:23,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:23,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:23,283 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 18:35:23,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:23,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:23,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:23,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:23,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:23,283 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 18:35:23,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:35:23,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:35:23,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:35:23,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:23,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:23,302 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 18:35:23,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:23,343 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 18:35:23,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:23,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 18:35:23,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:23,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:23,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:23,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:23,363 INFO L87 Difference]: Start difference. First operand 518 states and 916 transitions. Second operand 7 states. [2018-12-03 18:35:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:23,852 INFO L93 Difference]: Finished difference Result 615 states and 1067 transitions. [2018-12-03 18:35:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:35:23,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 18:35:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:23,857 INFO L225 Difference]: With dead ends: 615 [2018-12-03 18:35:23,857 INFO L226 Difference]: Without dead ends: 613 [2018-12-03 18:35:23,858 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 18:35:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-12-03 18:35:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 521. [2018-12-03 18:35:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-12-03 18:35:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2018-12-03 18:35:24,029 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 11 [2018-12-03 18:35:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:24,029 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2018-12-03 18:35:24,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2018-12-03 18:35:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:24,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:24,030 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:24,030 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:24,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-12-03 18:35:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:24,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:35:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:24,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:24,272 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 18:35:24,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:24,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:24,273 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:24,273 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [45], [47], [50], [52] [2018-12-03 18:35:24,274 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:24,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:24,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:24,276 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 18:35:24,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:24,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:24,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:24,278 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 18:35:24,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:24,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:24,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:24,295 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 18:35:24,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:24,315 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 18:35:24,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:24,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 18:35:24,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:24,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:24,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:24,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:24,335 INFO L87 Difference]: Start difference. First operand 521 states and 923 transitions. Second operand 7 states. [2018-12-03 18:35:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:24,941 INFO L93 Difference]: Finished difference Result 637 states and 1112 transitions. [2018-12-03 18:35:24,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:35:24,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 18:35:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:24,944 INFO L225 Difference]: With dead ends: 637 [2018-12-03 18:35:24,944 INFO L226 Difference]: Without dead ends: 635 [2018-12-03 18:35:24,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-12-03 18:35:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 544. [2018-12-03 18:35:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-03 18:35:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 964 transitions. [2018-12-03 18:35:25,096 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 964 transitions. Word has length 11 [2018-12-03 18:35:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:25,097 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 964 transitions. [2018-12-03 18:35:25,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 964 transitions. [2018-12-03 18:35:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:25,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:25,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:25,098 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:25,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-12-03 18:35:25,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:25,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:25,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:25,271 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 18:35:25,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:25,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:25,272 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:25,272 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [38], [41], [45], [46] [2018-12-03 18:35:25,273 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:25,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:25,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:25,289 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 18:35:25,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:25,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:25,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:25,300 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 18:35:25,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:25,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:25,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:25,316 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 18:35:25,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:25,351 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 18:35:25,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:25,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 18:35:25,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:25,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:25,371 INFO L87 Difference]: Start difference. First operand 544 states and 964 transitions. Second operand 7 states. [2018-12-03 18:35:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:25,813 INFO L93 Difference]: Finished difference Result 590 states and 1027 transitions. [2018-12-03 18:35:25,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:35:25,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 18:35:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:25,815 INFO L225 Difference]: With dead ends: 590 [2018-12-03 18:35:25,816 INFO L226 Difference]: Without dead ends: 588 [2018-12-03 18:35:25,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:35:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-12-03 18:35:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 549. [2018-12-03 18:35:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-12-03 18:35:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 971 transitions. [2018-12-03 18:35:25,952 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 971 transitions. Word has length 11 [2018-12-03 18:35:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:25,952 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 971 transitions. [2018-12-03 18:35:25,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 971 transitions. [2018-12-03 18:35:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:25,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:25,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:25,953 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:25,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:25,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-12-03 18:35:25,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:25,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:26,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:26,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:26,050 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:26,050 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [25], [27], [30], [45], [47], [52] [2018-12-03 18:35:26,051 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:26,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:26,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:26,056 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 18:35:26,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:26,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:26,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:26,063 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 18:35:26,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:26,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:26,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:26,080 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 18:35:26,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:26,132 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 18:35:26,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:26,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 18:35:26,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:26,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:26,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:26,152 INFO L87 Difference]: Start difference. First operand 549 states and 971 transitions. Second operand 7 states. [2018-12-03 18:35:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:26,660 INFO L93 Difference]: Finished difference Result 615 states and 1071 transitions. [2018-12-03 18:35:26,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:35:26,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 18:35:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:26,663 INFO L225 Difference]: With dead ends: 615 [2018-12-03 18:35:26,663 INFO L226 Difference]: Without dead ends: 613 [2018-12-03 18:35:26,664 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 18:35:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-12-03 18:35:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 514. [2018-12-03 18:35:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-12-03 18:35:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 905 transitions. [2018-12-03 18:35:26,793 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 905 transitions. Word has length 11 [2018-12-03 18:35:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:26,794 INFO L480 AbstractCegarLoop]: Abstraction has 514 states and 905 transitions. [2018-12-03 18:35:26,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 905 transitions. [2018-12-03 18:35:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:35:26,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:26,795 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:26,795 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:26,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-12-03 18:35:26,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:26,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:26,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:26,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:26,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:26,888 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 18:35:26,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:26,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:26,888 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 18:35:26,889 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [25], [27], [30], [32] [2018-12-03 18:35:26,889 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:26,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:26,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:26,893 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 18:35:26,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:26,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:26,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:26,896 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 18:35:26,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:26,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:26,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:26,915 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 18:35:26,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:26,939 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 18:35:26,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:26,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 18:35:26,959 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:26,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:26,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:26,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:26,960 INFO L87 Difference]: Start difference. First operand 514 states and 905 transitions. Second operand 7 states. [2018-12-03 18:35:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:27,432 INFO L93 Difference]: Finished difference Result 586 states and 1019 transitions. [2018-12-03 18:35:27,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:35:27,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-03 18:35:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:27,443 INFO L225 Difference]: With dead ends: 586 [2018-12-03 18:35:27,443 INFO L226 Difference]: Without dead ends: 584 [2018-12-03 18:35:27,443 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 18:35:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-12-03 18:35:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 508. [2018-12-03 18:35:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-12-03 18:35:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 890 transitions. [2018-12-03 18:35:27,564 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 890 transitions. Word has length 11 [2018-12-03 18:35:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:27,564 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 890 transitions. [2018-12-03 18:35:27,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 890 transitions. [2018-12-03 18:35:27,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:35:27,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:27,565 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:27,565 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:27,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-12-03 18:35:27,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:27,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:27,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:27,654 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 18:35:27,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:27,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:27,655 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 18:35:27,655 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [43], [45], [47], [52] [2018-12-03 18:35:27,656 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:27,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:27,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:27,675 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 18:35:27,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:27,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:27,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:27,691 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 18:35:27,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:27,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:27,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:27,958 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 18:35:27,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:28,021 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 18:35:28,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:28,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-12-03 18:35:28,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:28,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:35:28,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:35:28,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:28,042 INFO L87 Difference]: Start difference. First operand 508 states and 890 transitions. Second operand 12 states. [2018-12-03 18:35:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:29,130 INFO L93 Difference]: Finished difference Result 865 states and 1506 transitions. [2018-12-03 18:35:29,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:35:29,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 18:35:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:29,133 INFO L225 Difference]: With dead ends: 865 [2018-12-03 18:35:29,134 INFO L226 Difference]: Without dead ends: 863 [2018-12-03 18:35:29,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:35:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-12-03 18:35:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 659. [2018-12-03 18:35:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-12-03 18:35:29,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1161 transitions. [2018-12-03 18:35:29,289 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1161 transitions. Word has length 12 [2018-12-03 18:35:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:29,289 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 1161 transitions. [2018-12-03 18:35:29,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:35:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1161 transitions. [2018-12-03 18:35:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:35:29,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:29,290 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:29,290 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:29,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-12-03 18:35:29,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:29,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:29,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:29,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:29,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:29,899 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 18:35:29,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:29,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:29,900 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 18:35:29,900 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [32], [36], [37] [2018-12-03 18:35:29,901 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:29,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:29,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:29,905 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 18:35:29,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:29,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:29,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:29,914 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 18:35:29,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:29,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:29,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:29,979 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 18:35:29,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:30,074 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 18:35:30,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:30,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-03 18:35:30,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:30,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:35:30,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:35:30,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:35:30,094 INFO L87 Difference]: Start difference. First operand 659 states and 1161 transitions. Second operand 13 states. [2018-12-03 18:35:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:31,813 INFO L93 Difference]: Finished difference Result 1175 states and 2056 transitions. [2018-12-03 18:35:31,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:35:31,813 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 18:35:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:31,818 INFO L225 Difference]: With dead ends: 1175 [2018-12-03 18:35:31,818 INFO L226 Difference]: Without dead ends: 1173 [2018-12-03 18:35:31,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:35:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2018-12-03 18:35:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 856. [2018-12-03 18:35:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-03 18:35:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1506 transitions. [2018-12-03 18:35:32,023 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1506 transitions. Word has length 12 [2018-12-03 18:35:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:32,024 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1506 transitions. [2018-12-03 18:35:32,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:35:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1506 transitions. [2018-12-03 18:35:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:35:32,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:32,025 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:32,025 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:32,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1489044045, now seen corresponding path program 1 times [2018-12-03 18:35:32,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:32,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:32,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:32,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:32,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:32,121 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 18:35:32,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:32,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:32,122 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 18:35:32,122 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [27], [30], [36], [38], [41], [43] [2018-12-03 18:35:32,123 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:32,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:32,135 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:32,135 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 18:35:32,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:32,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:32,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:32,145 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 18:35:32,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:32,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:32,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:32,205 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 18:35:32,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:32,288 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 18:35:32,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:32,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2018-12-03 18:35:32,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:32,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:35:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:35:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:32,309 INFO L87 Difference]: Start difference. First operand 856 states and 1506 transitions. Second operand 12 states. [2018-12-03 18:35:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:33,192 INFO L93 Difference]: Finished difference Result 986 states and 1718 transitions. [2018-12-03 18:35:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:35:33,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 18:35:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:33,196 INFO L225 Difference]: With dead ends: 986 [2018-12-03 18:35:33,196 INFO L226 Difference]: Without dead ends: 984 [2018-12-03 18:35:33,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:35:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-12-03 18:35:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 845. [2018-12-03 18:35:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-03 18:35:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1490 transitions. [2018-12-03 18:35:33,400 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1490 transitions. Word has length 14 [2018-12-03 18:35:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:33,400 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1490 transitions. [2018-12-03 18:35:33,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:35:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1490 transitions. [2018-12-03 18:35:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:35:33,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:33,402 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:33,402 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:33,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:33,402 INFO L82 PathProgramCache]: Analyzing trace with hash -397032175, now seen corresponding path program 2 times [2018-12-03 18:35:33,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:33,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:33,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:33,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:33,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:33,501 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 18:35:33,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:33,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:33,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:33,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:33,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:33,502 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 18:35:33,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:35:33,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:35:33,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:35:33,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:33,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:33,559 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 18:35:33,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:33,594 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 18:35:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 18:35:33,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:33,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:35:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:35:33,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:35:33,614 INFO L87 Difference]: Start difference. First operand 845 states and 1490 transitions. Second operand 11 states. [2018-12-03 18:35:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:34,530 INFO L93 Difference]: Finished difference Result 1022 states and 1788 transitions. [2018-12-03 18:35:34,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:35:34,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 18:35:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:34,534 INFO L225 Difference]: With dead ends: 1022 [2018-12-03 18:35:34,534 INFO L226 Difference]: Without dead ends: 1019 [2018-12-03 18:35:34,535 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 18:35:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-12-03 18:35:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 885. [2018-12-03 18:35:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-03 18:35:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1560 transitions. [2018-12-03 18:35:34,763 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1560 transitions. Word has length 14 [2018-12-03 18:35:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:34,764 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1560 transitions. [2018-12-03 18:35:34,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:35:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1560 transitions. [2018-12-03 18:35:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:35:34,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:34,765 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:34,765 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:34,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-12-03 18:35:34,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:34,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:35:34,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:34,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:34,837 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 18:35:34,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:34,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:34,838 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 18:35:34,838 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [41], [43], [45], [47], [50] [2018-12-03 18:35:34,839 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:34,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:34,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:34,862 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 18:35:34,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:34,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:34,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:34,910 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 18:35:34,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:34,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:34,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:34,968 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 18:35:34,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:35,016 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 18:35:35,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:35,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 18:35:35,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:35,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:35:35,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:35:35,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:35,037 INFO L87 Difference]: Start difference. First operand 885 states and 1560 transitions. Second operand 11 states. [2018-12-03 18:35:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:35,800 INFO L93 Difference]: Finished difference Result 988 states and 1720 transitions. [2018-12-03 18:35:35,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:35:35,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 18:35:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:35,804 INFO L225 Difference]: With dead ends: 988 [2018-12-03 18:35:35,804 INFO L226 Difference]: Without dead ends: 986 [2018-12-03 18:35:35,805 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 18:35:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-12-03 18:35:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 879. [2018-12-03 18:35:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-03 18:35:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1550 transitions. [2018-12-03 18:35:36,036 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1550 transitions. Word has length 14 [2018-12-03 18:35:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:36,036 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1550 transitions. [2018-12-03 18:35:36,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:35:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1550 transitions. [2018-12-03 18:35:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:35:36,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:36,037 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:36,038 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:36,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-12-03 18:35:36,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:36,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:36,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:36,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:36,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:36,227 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 18:35:36,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:36,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:36,227 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 18:35:36,227 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 18:35:36,228 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:36,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:36,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:36,244 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 18:35:36,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:36,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:36,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:36,281 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 18:35:36,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:36,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:36,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:36,836 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 18:35:36,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:37,624 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 18:35:37,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:37,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2018-12-03 18:35:37,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:37,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:35:37,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:35:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:37,644 INFO L87 Difference]: Start difference. First operand 879 states and 1550 transitions. Second operand 12 states. [2018-12-03 18:35:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:38,599 INFO L93 Difference]: Finished difference Result 1100 states and 1913 transitions. [2018-12-03 18:35:38,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:35:38,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 18:35:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:38,604 INFO L225 Difference]: With dead ends: 1100 [2018-12-03 18:35:38,604 INFO L226 Difference]: Without dead ends: 1098 [2018-12-03 18:35:38,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:35:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-12-03 18:35:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 863. [2018-12-03 18:35:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-12-03 18:35:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1524 transitions. [2018-12-03 18:35:38,870 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1524 transitions. Word has length 14 [2018-12-03 18:35:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:38,870 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1524 transitions. [2018-12-03 18:35:38,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:35:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1524 transitions. [2018-12-03 18:35:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:35:38,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:38,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:38,872 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:38,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-12-03 18:35:38,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:38,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:38,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:38,945 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 18:35:38,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:38,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:38,945 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-03 18:35:38,946 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [50] [2018-12-03 18:35:38,946 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:38,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:38,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:38,967 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 18:35:38,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:38,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:38,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:38,988 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 18:35:38,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:38,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:39,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:39,045 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 18:35:39,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:39,097 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 18:35:39,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:39,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-03 18:35:39,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:39,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:35:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:35:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:39,117 INFO L87 Difference]: Start difference. First operand 863 states and 1524 transitions. Second operand 11 states. [2018-12-03 18:35:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:39,964 INFO L93 Difference]: Finished difference Result 976 states and 1686 transitions. [2018-12-03 18:35:39,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:35:39,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-12-03 18:35:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:39,967 INFO L225 Difference]: With dead ends: 976 [2018-12-03 18:35:39,968 INFO L226 Difference]: Without dead ends: 974 [2018-12-03 18:35:39,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:35:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-12-03 18:35:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 857. [2018-12-03 18:35:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-12-03 18:35:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1512 transitions. [2018-12-03 18:35:40,193 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1512 transitions. Word has length 14 [2018-12-03 18:35:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:40,193 INFO L480 AbstractCegarLoop]: Abstraction has 857 states and 1512 transitions. [2018-12-03 18:35:40,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:35:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1512 transitions. [2018-12-03 18:35:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:40,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:40,194 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:35:40,194 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:40,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:40,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-12-03 18:35:40,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:40,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:40,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:40,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:40,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:40,363 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 18:35:40,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:40,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:40,364 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:40,364 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [52] [2018-12-03 18:35:40,365 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:40,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:40,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:40,388 INFO L272 AbstractInterpreter]: Visited 10 different actions 53 times. Merged at 7 different actions 32 times. Widened at 2 different actions 5 times. Found 10 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:40,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:40,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:40,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:40,426 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 18:35:40,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:40,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:40,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:40,609 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 18:35:40,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:40,947 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 18:35:40,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:40,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 8] total 22 [2018-12-03 18:35:40,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:40,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:35:40,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:35:40,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:35:40,969 INFO L87 Difference]: Start difference. First operand 857 states and 1512 transitions. Second operand 8 states. [2018-12-03 18:35:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:41,510 INFO L93 Difference]: Finished difference Result 1870 states and 3280 transitions. [2018-12-03 18:35:41,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:35:41,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 18:35:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:41,514 INFO L225 Difference]: With dead ends: 1870 [2018-12-03 18:35:41,514 INFO L226 Difference]: Without dead ends: 1026 [2018-12-03 18:35:41,516 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 18:35:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-12-03 18:35:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 960. [2018-12-03 18:35:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-12-03 18:35:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1670 transitions. [2018-12-03 18:35:41,777 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1670 transitions. Word has length 15 [2018-12-03 18:35:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:41,777 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 1670 transitions. [2018-12-03 18:35:41,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:35:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1670 transitions. [2018-12-03 18:35:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:41,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:41,778 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:41,778 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:41,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-12-03 18:35:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:41,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:41,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:41,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:41,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:41,894 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 18:35:41,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:41,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:41,895 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:41,895 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [32], [36], [38], [41], [43] [2018-12-03 18:35:41,896 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:41,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:41,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:41,905 INFO L272 AbstractInterpreter]: Visited 12 different actions 32 times. Merged at 11 different actions 16 times. Never widened. Found 6 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:41,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:41,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:41,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:41,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:35:41,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:41,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:41,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:42,033 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 18:35:42,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:42,230 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 18:35:42,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:42,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2018-12-03 18:35:42,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:42,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:42,249 INFO L87 Difference]: Start difference. First operand 960 states and 1670 transitions. Second operand 7 states. [2018-12-03 18:35:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:42,968 INFO L93 Difference]: Finished difference Result 2025 states and 3508 transitions. [2018-12-03 18:35:42,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:35:42,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 18:35:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:42,972 INFO L225 Difference]: With dead ends: 2025 [2018-12-03 18:35:42,972 INFO L226 Difference]: Without dead ends: 1078 [2018-12-03 18:35:42,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:35:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2018-12-03 18:35:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 916. [2018-12-03 18:35:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-03 18:35:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1582 transitions. [2018-12-03 18:35:43,212 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1582 transitions. Word has length 15 [2018-12-03 18:35:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:43,213 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1582 transitions. [2018-12-03 18:35:43,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1582 transitions. [2018-12-03 18:35:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:43,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:43,214 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:43,214 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:43,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2133386956, now seen corresponding path program 1 times [2018-12-03 18:35:43,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:43,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:43,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:43,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:43,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:43,284 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 18:35:43,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:43,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:43,285 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:43,285 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [23], [36], [38], [41], [43], [45], [46], [47], [50] [2018-12-03 18:35:43,286 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:43,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:43,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:43,303 INFO L272 AbstractInterpreter]: Visited 12 different actions 52 times. Merged at 9 different actions 27 times. Widened at 2 different actions 3 times. Found 13 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:43,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:43,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:43,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:43,340 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 18:35:43,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:43,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:43,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:43,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:43,542 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 18:35:43,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:43,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2018-12-03 18:35:43,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:43,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:35:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:35:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:43,563 INFO L87 Difference]: Start difference. First operand 916 states and 1582 transitions. Second operand 12 states. [2018-12-03 18:35:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:44,816 INFO L93 Difference]: Finished difference Result 1087 states and 1832 transitions. [2018-12-03 18:35:44,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:35:44,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-12-03 18:35:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:44,820 INFO L225 Difference]: With dead ends: 1087 [2018-12-03 18:35:44,820 INFO L226 Difference]: Without dead ends: 1085 [2018-12-03 18:35:44,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=1165, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 18:35:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2018-12-03 18:35:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 882. [2018-12-03 18:35:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-12-03 18:35:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1520 transitions. [2018-12-03 18:35:45,082 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1520 transitions. Word has length 15 [2018-12-03 18:35:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:45,082 INFO L480 AbstractCegarLoop]: Abstraction has 882 states and 1520 transitions. [2018-12-03 18:35:45,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:35:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1520 transitions. [2018-12-03 18:35:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:45,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:45,084 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:45,084 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:45,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:45,084 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-12-03 18:35:45,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:45,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:45,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:45,208 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 18:35:45,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:45,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:45,208 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:45,209 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [52] [2018-12-03 18:35:45,210 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:45,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:45,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:45,235 INFO L272 AbstractInterpreter]: Visited 14 different actions 71 times. Merged at 12 different actions 48 times. Widened at 3 different actions 8 times. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:35:45,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:45,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:45,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:45,256 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 18:35:45,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:45,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:45,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:45,343 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 18:35:45,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:45,409 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 18:35:45,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:45,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 18:35:45,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:45,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:45,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:45,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:45,430 INFO L87 Difference]: Start difference. First operand 882 states and 1520 transitions. Second operand 7 states. [2018-12-03 18:35:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:45,992 INFO L93 Difference]: Finished difference Result 2110 states and 3580 transitions. [2018-12-03 18:35:45,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:35:45,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 18:35:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:45,996 INFO L225 Difference]: With dead ends: 2110 [2018-12-03 18:35:45,996 INFO L226 Difference]: Without dead ends: 1229 [2018-12-03 18:35:45,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:35:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-12-03 18:35:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1000. [2018-12-03 18:35:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-12-03 18:35:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1681 transitions. [2018-12-03 18:35:46,340 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1681 transitions. Word has length 15 [2018-12-03 18:35:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:46,340 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1681 transitions. [2018-12-03 18:35:46,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1681 transitions. [2018-12-03 18:35:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:46,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:46,341 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:46,342 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:46,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-12-03 18:35:46,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:46,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:46,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:46,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:46,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:46,424 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 18:35:46,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:46,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:46,425 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:46,425 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [38], [41], [43], [45], [46], [47], [50] [2018-12-03 18:35:46,426 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:46,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:46,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:46,460 INFO L272 AbstractInterpreter]: Visited 11 different actions 65 times. Merged at 9 different actions 40 times. Widened at 2 different actions 4 times. Found 16 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:46,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:46,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:46,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:46,492 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 18:35:46,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:46,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:46,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:46,591 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 18:35:46,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:46,667 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 18:35:46,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:46,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2018-12-03 18:35:46,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:46,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:35:46,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:35:46,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:46,688 INFO L87 Difference]: Start difference. First operand 1000 states and 1681 transitions. Second operand 15 states. [2018-12-03 18:35:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:50,708 INFO L93 Difference]: Finished difference Result 2980 states and 4949 transitions. [2018-12-03 18:35:50,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:35:50,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 18:35:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:50,725 INFO L225 Difference]: With dead ends: 2980 [2018-12-03 18:35:50,726 INFO L226 Difference]: Without dead ends: 2267 [2018-12-03 18:35:50,736 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 18:35:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2018-12-03 18:35:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1687. [2018-12-03 18:35:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2018-12-03 18:35:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2750 transitions. [2018-12-03 18:35:51,490 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2750 transitions. Word has length 15 [2018-12-03 18:35:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:51,490 INFO L480 AbstractCegarLoop]: Abstraction has 1687 states and 2750 transitions. [2018-12-03 18:35:51,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:35:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2750 transitions. [2018-12-03 18:35:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:51,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:51,492 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:35:51,492 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:51,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-12-03 18:35:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:51,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:51,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:51,621 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 18:35:51,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:51,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:51,621 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:51,621 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [38], [43], [45], [47], [50] [2018-12-03 18:35:51,622 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:51,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:51,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:51,640 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 18:35:51,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:51,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:51,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:51,654 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 18:35:51,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:51,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:51,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:51,796 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 18:35:51,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:51,856 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 18:35:51,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:51,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 19 [2018-12-03 18:35:51,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:51,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:51,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:51,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:35:51,876 INFO L87 Difference]: Start difference. First operand 1687 states and 2750 transitions. Second operand 7 states. [2018-12-03 18:35:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:52,634 INFO L93 Difference]: Finished difference Result 2250 states and 3597 transitions. [2018-12-03 18:35:52,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:35:52,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 18:35:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:52,639 INFO L225 Difference]: With dead ends: 2250 [2018-12-03 18:35:52,639 INFO L226 Difference]: Without dead ends: 1622 [2018-12-03 18:35:52,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:35:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2018-12-03 18:35:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1397. [2018-12-03 18:35:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-12-03 18:35:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2285 transitions. [2018-12-03 18:35:53,171 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2285 transitions. Word has length 15 [2018-12-03 18:35:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:53,172 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2285 transitions. [2018-12-03 18:35:53,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2285 transitions. [2018-12-03 18:35:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:53,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:53,173 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:53,173 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:53,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-12-03 18:35:53,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:53,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:53,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:53,506 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 18:35:53,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:53,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:53,507 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:53,507 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [23], [36], [38], [43], [45], [47], [50], [52] [2018-12-03 18:35:53,508 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:53,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:53,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:53,529 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 18:35:53,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:53,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:53,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:53,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 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 18:35:53,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:53,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:53,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:53,698 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 18:35:53,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:53,772 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 18:35:53,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:53,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2018-12-03 18:35:53,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:53,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:53,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:53,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:35:53,793 INFO L87 Difference]: Start difference. First operand 1397 states and 2285 transitions. Second operand 7 states. [2018-12-03 18:35:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:54,848 INFO L93 Difference]: Finished difference Result 3060 states and 4968 transitions. [2018-12-03 18:35:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:35:54,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 18:35:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:54,851 INFO L225 Difference]: With dead ends: 3060 [2018-12-03 18:35:54,851 INFO L226 Difference]: Without dead ends: 1541 [2018-12-03 18:35:54,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:35:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2018-12-03 18:35:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1393. [2018-12-03 18:35:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1393 states. [2018-12-03 18:35:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2262 transitions. [2018-12-03 18:35:55,351 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2262 transitions. Word has length 15 [2018-12-03 18:35:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:55,351 INFO L480 AbstractCegarLoop]: Abstraction has 1393 states and 2262 transitions. [2018-12-03 18:35:55,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2262 transitions. [2018-12-03 18:35:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:55,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:55,353 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:55,353 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:55,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1457630053, now seen corresponding path program 1 times [2018-12-03 18:35:55,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:55,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:55,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:55,423 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 18:35:55,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:55,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:55,424 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:55,425 INFO L205 CegarAbsIntRunner]: [0], [6], [19], [23], [36], [38], [41], [45], [46], [47], [50], [52] [2018-12-03 18:35:55,426 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:55,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:55,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:55,445 INFO L272 AbstractInterpreter]: Visited 12 different actions 48 times. Merged at 9 different actions 26 times. Widened at 2 different actions 3 times. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:35:55,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:55,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:55,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:55,481 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 18:35:55,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:55,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:55,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:55,655 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 18:35:55,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:55,694 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 18:35:55,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:55,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2018-12-03 18:35:55,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:55,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:55,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:35:55,714 INFO L87 Difference]: Start difference. First operand 1393 states and 2262 transitions. Second operand 7 states. [2018-12-03 18:35:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:56,491 INFO L93 Difference]: Finished difference Result 2665 states and 4310 transitions. [2018-12-03 18:35:56,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:35:56,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 18:35:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:56,494 INFO L225 Difference]: With dead ends: 2665 [2018-12-03 18:35:56,494 INFO L226 Difference]: Without dead ends: 1628 [2018-12-03 18:35:56,495 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 18:35:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2018-12-03 18:35:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1461. [2018-12-03 18:35:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2018-12-03 18:35:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2358 transitions. [2018-12-03 18:35:57,017 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2358 transitions. Word has length 15 [2018-12-03 18:35:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:57,017 INFO L480 AbstractCegarLoop]: Abstraction has 1461 states and 2358 transitions. [2018-12-03 18:35:57,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2358 transitions. [2018-12-03 18:35:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:57,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:57,018 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:57,018 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:57,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:57,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1954222544, now seen corresponding path program 1 times [2018-12-03 18:35:57,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:57,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:57,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:57,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:57,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:57,069 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 18:35:57,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:57,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:35:57,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:57,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:57,070 INFO L87 Difference]: Start difference. First operand 1461 states and 2358 transitions. Second operand 7 states. [2018-12-03 18:35:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:58,183 INFO L93 Difference]: Finished difference Result 3476 states and 5525 transitions. [2018-12-03 18:35:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:35:58,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 18:35:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:58,186 INFO L225 Difference]: With dead ends: 3476 [2018-12-03 18:35:58,186 INFO L226 Difference]: Without dead ends: 2233 [2018-12-03 18:35:58,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:35:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2018-12-03 18:35:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1382. [2018-12-03 18:35:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-12-03 18:35:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2253 transitions. [2018-12-03 18:35:58,712 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2253 transitions. Word has length 15 [2018-12-03 18:35:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:58,712 INFO L480 AbstractCegarLoop]: Abstraction has 1382 states and 2253 transitions. [2018-12-03 18:35:58,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:35:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2253 transitions. [2018-12-03 18:35:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:35:58,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:58,713 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:35:58,714 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:58,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-12-03 18:35:58,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:58,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:58,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:58,807 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 18:35:58,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:58,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:58,807 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:35:58,807 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [26], [27], [30], [36], [38], [43] [2018-12-03 18:35:58,808 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:58,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:58,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:35:58,822 INFO L272 AbstractInterpreter]: Visited 10 different actions 43 times. Merged at 8 different actions 27 times. Widened at 2 different actions 3 times. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 18:35:58,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:58,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:35:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:58,857 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 18:35:58,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:58,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:58,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:58,963 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 18:35:58,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:59,053 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 18:35:59,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:35:59,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-12-03 18:35:59,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:59,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:35:59,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:35:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 18:35:59,072 INFO L87 Difference]: Start difference. First operand 1382 states and 2253 transitions. Second operand 7 states. [2018-12-03 18:35:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:59,795 INFO L93 Difference]: Finished difference Result 2812 states and 4517 transitions. [2018-12-03 18:35:59,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:35:59,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-03 18:35:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:59,798 INFO L225 Difference]: With dead ends: 2812 [2018-12-03 18:35:59,798 INFO L226 Difference]: Without dead ends: 1262 [2018-12-03 18:35:59,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:35:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-12-03 18:36:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 939. [2018-12-03 18:36:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-12-03 18:36:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1517 transitions. [2018-12-03 18:36:00,196 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1517 transitions. Word has length 15 [2018-12-03 18:36:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:00,196 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 1517 transitions. [2018-12-03 18:36:00,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:36:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1517 transitions. [2018-12-03 18:36:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:00,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:00,197 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:36:00,197 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:00,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times [2018-12-03 18:36:00,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:00,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:00,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:00,415 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 18:36:00,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:00,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:00,416 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:00,416 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [38], [41], [45], [46], [47], [50], [52] [2018-12-03 18:36:00,417 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:00,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:00,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:00,437 INFO L272 AbstractInterpreter]: Visited 11 different actions 66 times. Merged at 8 different actions 36 times. Widened at 2 different actions 5 times. Found 17 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:36:00,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:00,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:00,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:00,465 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 18:36:00,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:00,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:00,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:01,155 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-12-03 18:36:01,733 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 18:36:01,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:01,853 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 18:36:01,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:01,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2018-12-03 18:36:01,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:01,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:36:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:36:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:36:01,873 INFO L87 Difference]: Start difference. First operand 939 states and 1517 transitions. Second operand 19 states. [2018-12-03 18:36:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:04,760 INFO L93 Difference]: Finished difference Result 2139 states and 3433 transitions. [2018-12-03 18:36:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:36:04,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 18:36:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:04,764 INFO L225 Difference]: With dead ends: 2139 [2018-12-03 18:36:04,764 INFO L226 Difference]: Without dead ends: 1443 [2018-12-03 18:36:04,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=696, Invalid=3464, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 18:36:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2018-12-03 18:36:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1300. [2018-12-03 18:36:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-12-03 18:36:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2061 transitions. [2018-12-03 18:36:05,337 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2061 transitions. Word has length 18 [2018-12-03 18:36:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:05,337 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 2061 transitions. [2018-12-03 18:36:05,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:36:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2061 transitions. [2018-12-03 18:36:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:05,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:05,338 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:05,338 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:05,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:05,339 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times [2018-12-03 18:36:05,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:05,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:05,871 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 18:36:05,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:05,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:05,872 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:05,872 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43] [2018-12-03 18:36:05,873 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:05,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:05,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:05,881 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 18:36:05,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:05,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:05,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:05,904 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 18:36:05,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:05,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:05,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:06,045 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 18:36:06,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:06,157 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 18:36:06,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:06,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2018-12-03 18:36:06,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:06,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:36:06,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:36:06,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:36:06,183 INFO L87 Difference]: Start difference. First operand 1300 states and 2061 transitions. Second operand 19 states. [2018-12-03 18:36:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:09,065 INFO L93 Difference]: Finished difference Result 1391 states and 2198 transitions. [2018-12-03 18:36:09,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:36:09,065 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 18:36:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:09,068 INFO L225 Difference]: With dead ends: 1391 [2018-12-03 18:36:09,068 INFO L226 Difference]: Without dead ends: 1389 [2018-12-03 18:36:09,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=608, Invalid=3174, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:36:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2018-12-03 18:36:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1289. [2018-12-03 18:36:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-12-03 18:36:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2045 transitions. [2018-12-03 18:36:09,597 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2045 transitions. Word has length 18 [2018-12-03 18:36:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:09,597 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2045 transitions. [2018-12-03 18:36:09,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:36:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2045 transitions. [2018-12-03 18:36:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:09,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:09,598 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:36:09,598 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:09,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 2 times [2018-12-03 18:36:09,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:09,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:09,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:09,822 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 18:36:09,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:09,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:09,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:09,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:09,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:09,823 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 18:36:09,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:36:09,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:36:09,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:36:09,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:09,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:09,947 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 18:36:09,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:10,063 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 18:36:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:10,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2018-12-03 18:36:10,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:10,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:36:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:36:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:36:10,085 INFO L87 Difference]: Start difference. First operand 1289 states and 2045 transitions. Second operand 20 states. [2018-12-03 18:36:10,671 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-03 18:36:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:11,994 INFO L93 Difference]: Finished difference Result 1447 states and 2281 transitions. [2018-12-03 18:36:11,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:36:11,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-12-03 18:36:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:11,996 INFO L225 Difference]: With dead ends: 1447 [2018-12-03 18:36:11,996 INFO L226 Difference]: Without dead ends: 1446 [2018-12-03 18:36:11,997 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 18:36:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2018-12-03 18:36:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1282. [2018-12-03 18:36:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-12-03 18:36:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 2028 transitions. [2018-12-03 18:36:12,449 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 2028 transitions. Word has length 18 [2018-12-03 18:36:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:12,449 INFO L480 AbstractCegarLoop]: Abstraction has 1282 states and 2028 transitions. [2018-12-03 18:36:12,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:36:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 2028 transitions. [2018-12-03 18:36:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:12,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:12,450 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:12,450 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:12,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-12-03 18:36:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:12,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:12,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:12,552 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 18:36:12,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:12,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:12,553 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:12,553 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [25], [26], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 18:36:12,554 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:12,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:12,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:12,581 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 18:36:12,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:12,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:12,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:12,590 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 18:36:12,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:12,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:12,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:12,702 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 18:36:12,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:12,894 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 18:36:12,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:12,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 18:36:12,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:12,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:36:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:36:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:36:12,914 INFO L87 Difference]: Start difference. First operand 1282 states and 2028 transitions. Second operand 16 states. [2018-12-03 18:36:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:15,985 INFO L93 Difference]: Finished difference Result 1583 states and 2508 transitions. [2018-12-03 18:36:15,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:36:15,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 18:36:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:15,987 INFO L225 Difference]: With dead ends: 1583 [2018-12-03 18:36:15,987 INFO L226 Difference]: Without dead ends: 1581 [2018-12-03 18:36:15,988 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 18:36:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2018-12-03 18:36:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1355. [2018-12-03 18:36:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2018-12-03 18:36:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2152 transitions. [2018-12-03 18:36:16,560 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2152 transitions. Word has length 18 [2018-12-03 18:36:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:16,560 INFO L480 AbstractCegarLoop]: Abstraction has 1355 states and 2152 transitions. [2018-12-03 18:36:16,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:36:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2152 transitions. [2018-12-03 18:36:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:16,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:16,561 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:16,561 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:16,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-12-03 18:36:16,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:16,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:16,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:16,717 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 18:36:16,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:16,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:16,717 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:16,718 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [36], [37], [38], [41], [45], [47], [50], [52] [2018-12-03 18:36:16,719 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:16,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:16,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:16,741 INFO L272 AbstractInterpreter]: Visited 11 different actions 59 times. Merged at 9 different actions 36 times. Widened at 2 different actions 4 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:36:16,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:16,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:16,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:16,775 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 18:36:16,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:16,792 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:16,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:16,876 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 18:36:16,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:16,972 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 18:36:16,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:16,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 18:36:16,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:16,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:36:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:36:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:36:16,993 INFO L87 Difference]: Start difference. First operand 1355 states and 2152 transitions. Second operand 15 states. [2018-12-03 18:36:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:20,418 INFO L93 Difference]: Finished difference Result 1638 states and 2596 transitions. [2018-12-03 18:36:20,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:36:20,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:36:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:20,420 INFO L225 Difference]: With dead ends: 1638 [2018-12-03 18:36:20,420 INFO L226 Difference]: Without dead ends: 1636 [2018-12-03 18:36:20,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=838, Invalid=3992, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:36:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2018-12-03 18:36:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1398. [2018-12-03 18:36:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2018-12-03 18:36:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2222 transitions. [2018-12-03 18:36:20,965 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2222 transitions. Word has length 18 [2018-12-03 18:36:20,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:20,966 INFO L480 AbstractCegarLoop]: Abstraction has 1398 states and 2222 transitions. [2018-12-03 18:36:20,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:36:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2222 transitions. [2018-12-03 18:36:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:20,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:20,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:20,967 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:20,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-12-03 18:36:20,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:20,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:21,091 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 18:36:21,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:21,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:21,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:21,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:21,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:21,092 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 18:36:21,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:36:21,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:36:21,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:36:21,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:21,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:21,508 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 18:36:21,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:21,928 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 18:36:21,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:21,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2018-12-03 18:36:21,946 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:21,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:36:21,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:36:21,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:36:21,947 INFO L87 Difference]: Start difference. First operand 1398 states and 2222 transitions. Second operand 18 states. [2018-12-03 18:36:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:26,042 INFO L93 Difference]: Finished difference Result 1695 states and 2679 transitions. [2018-12-03 18:36:26,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:36:26,042 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 18:36:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:26,044 INFO L225 Difference]: With dead ends: 1695 [2018-12-03 18:36:26,044 INFO L226 Difference]: Without dead ends: 1693 [2018-12-03 18:36:26,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1629, Invalid=5511, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:36:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2018-12-03 18:36:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1254. [2018-12-03 18:36:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-12-03 18:36:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1980 transitions. [2018-12-03 18:36:26,533 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1980 transitions. Word has length 18 [2018-12-03 18:36:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:26,533 INFO L480 AbstractCegarLoop]: Abstraction has 1254 states and 1980 transitions. [2018-12-03 18:36:26,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:36:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1980 transitions. [2018-12-03 18:36:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:26,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:26,534 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:26,534 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:26,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-12-03 18:36:26,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:26,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:26,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:26,652 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 18:36:26,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:26,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:26,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:26,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:26,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:26,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 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 18:36:26,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:36:26,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:36:26,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:36:26,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:26,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:26,754 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 18:36:26,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:26,850 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 18:36:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 18:36:26,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:26,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:36:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:36:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:36:26,869 INFO L87 Difference]: Start difference. First operand 1254 states and 1980 transitions. Second operand 16 states. [2018-12-03 18:36:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:30,435 INFO L93 Difference]: Finished difference Result 1422 states and 2222 transitions. [2018-12-03 18:36:30,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:36:30,436 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 18:36:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:30,437 INFO L225 Difference]: With dead ends: 1422 [2018-12-03 18:36:30,437 INFO L226 Difference]: Without dead ends: 1420 [2018-12-03 18:36:30,438 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 18:36:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-12-03 18:36:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1252. [2018-12-03 18:36:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-12-03 18:36:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1975 transitions. [2018-12-03 18:36:30,939 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1975 transitions. Word has length 18 [2018-12-03 18:36:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:30,939 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1975 transitions. [2018-12-03 18:36:30,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:36:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1975 transitions. [2018-12-03 18:36:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:30,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:30,940 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:30,940 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:30,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:30,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1882250372, now seen corresponding path program 1 times [2018-12-03 18:36:30,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:30,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:30,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:30,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:30,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:31,052 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 18:36:31,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:31,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:31,052 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:31,052 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [25], [26], [36], [38], [43], [45], [47], [50], [52] [2018-12-03 18:36:31,053 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:31,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:31,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:31,077 INFO L272 AbstractInterpreter]: Visited 15 different actions 86 times. Merged at 13 different actions 56 times. Widened at 5 different actions 9 times. Found 18 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:36:31,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:31,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:31,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:31,079 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 18:36:31,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:31,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:31,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:31,185 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 18:36:31,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:31,278 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 18:36:31,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:31,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 18:36:31,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:31,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:36:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:36:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:36:31,297 INFO L87 Difference]: Start difference. First operand 1252 states and 1975 transitions. Second operand 16 states. [2018-12-03 18:36:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:33,822 INFO L93 Difference]: Finished difference Result 1547 states and 2446 transitions. [2018-12-03 18:36:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:36:33,823 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 18:36:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:33,824 INFO L225 Difference]: With dead ends: 1547 [2018-12-03 18:36:33,824 INFO L226 Difference]: Without dead ends: 1533 [2018-12-03 18:36:33,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=2265, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:36:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-12-03 18:36:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1227. [2018-12-03 18:36:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2018-12-03 18:36:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1931 transitions. [2018-12-03 18:36:34,275 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1931 transitions. Word has length 18 [2018-12-03 18:36:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:34,275 INFO L480 AbstractCegarLoop]: Abstraction has 1227 states and 1931 transitions. [2018-12-03 18:36:34,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:36:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1931 transitions. [2018-12-03 18:36:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:34,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:34,276 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:34,277 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:34,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-12-03 18:36:34,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:34,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:34,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:34,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:34,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:34,363 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 18:36:34,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:34,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:34,363 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:34,363 INFO L205 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [36], [37], [45], [47], [50], [52] [2018-12-03 18:36:34,364 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:34,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:34,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:34,384 INFO L272 AbstractInterpreter]: Visited 12 different actions 70 times. Merged at 10 different actions 46 times. Widened at 4 different actions 8 times. Found 14 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:36:34,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:34,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:34,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:34,432 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 18:36:34,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:34,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:34,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:34,621 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 18:36:34,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:34,693 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 18:36:34,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:34,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 18:36:34,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:34,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:36:34,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:36:34,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:36:34,712 INFO L87 Difference]: Start difference. First operand 1227 states and 1931 transitions. Second operand 15 states. [2018-12-03 18:36:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:37,113 INFO L93 Difference]: Finished difference Result 1697 states and 2671 transitions. [2018-12-03 18:36:37,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:36:37,113 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:36:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:37,115 INFO L225 Difference]: With dead ends: 1697 [2018-12-03 18:36:37,115 INFO L226 Difference]: Without dead ends: 1660 [2018-12-03 18:36:37,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:36:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2018-12-03 18:36:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1254. [2018-12-03 18:36:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-12-03 18:36:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1996 transitions. [2018-12-03 18:36:37,623 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1996 transitions. Word has length 18 [2018-12-03 18:36:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:37,623 INFO L480 AbstractCegarLoop]: Abstraction has 1254 states and 1996 transitions. [2018-12-03 18:36:37,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:36:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1996 transitions. [2018-12-03 18:36:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:37,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:37,624 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:37,624 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:37,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-12-03 18:36:37,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:37,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:37,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:37,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:37,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:37,775 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 18:36:37,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:37,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:37,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:37,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:37,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:37,776 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 18:36:37,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:36:37,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:36:37,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:36:37,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:37,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:37,895 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 18:36:37,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:37,991 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 18:36:38,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:38,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 18:36:38,011 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:38,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:36:38,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:36:38,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:36:38,011 INFO L87 Difference]: Start difference. First operand 1254 states and 1996 transitions. Second operand 16 states. [2018-12-03 18:36:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:41,519 INFO L93 Difference]: Finished difference Result 1605 states and 2547 transitions. [2018-12-03 18:36:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:36:41,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 18:36:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:41,521 INFO L225 Difference]: With dead ends: 1605 [2018-12-03 18:36:41,521 INFO L226 Difference]: Without dead ends: 1603 [2018-12-03 18:36:41,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1317, Invalid=4845, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:36:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2018-12-03 18:36:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1306. [2018-12-03 18:36:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2018-12-03 18:36:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2079 transitions. [2018-12-03 18:36:42,077 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2079 transitions. Word has length 18 [2018-12-03 18:36:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:42,077 INFO L480 AbstractCegarLoop]: Abstraction has 1306 states and 2079 transitions. [2018-12-03 18:36:42,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:36:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2079 transitions. [2018-12-03 18:36:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:42,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:42,078 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:36:42,078 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:42,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash 749306886, now seen corresponding path program 1 times [2018-12-03 18:36:42,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:42,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:42,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:42,189 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 18:36:42,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:42,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:42,189 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:42,189 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 18:36:42,190 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:42,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:42,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:42,212 INFO L272 AbstractInterpreter]: Visited 11 different actions 67 times. Merged at 8 different actions 37 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 18:36:42,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:42,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:42,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:42,221 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 18:36:42,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:42,230 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:42,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:42,417 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 18:36:42,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:42,524 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 18:36:42,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:42,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-03 18:36:42,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:42,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:36:42,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:36:42,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:36:42,546 INFO L87 Difference]: Start difference. First operand 1306 states and 2079 transitions. Second operand 19 states. [2018-12-03 18:36:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:49,887 INFO L93 Difference]: Finished difference Result 4497 states and 7178 transitions. [2018-12-03 18:36:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-12-03 18:36:49,887 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 18:36:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:49,890 INFO L225 Difference]: With dead ends: 4497 [2018-12-03 18:36:49,890 INFO L226 Difference]: Without dead ends: 3228 [2018-12-03 18:36:49,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11677 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3851, Invalid=25219, Unknown=0, NotChecked=0, Total=29070 [2018-12-03 18:36:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2018-12-03 18:36:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2433. [2018-12-03 18:36:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2018-12-03 18:36:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3907 transitions. [2018-12-03 18:36:50,951 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3907 transitions. Word has length 18 [2018-12-03 18:36:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:50,952 INFO L480 AbstractCegarLoop]: Abstraction has 2433 states and 3907 transitions. [2018-12-03 18:36:50,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:36:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3907 transitions. [2018-12-03 18:36:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:50,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:50,953 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:50,953 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:50,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:50,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-12-03 18:36:50,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:50,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:50,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:50,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:51,047 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 18:36:51,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:51,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:51,048 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:51,048 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [38], [41], [43], [45], [46] [2018-12-03 18:36:51,049 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:51,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:51,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:51,067 INFO L272 AbstractInterpreter]: Visited 12 different actions 67 times. Merged at 10 different actions 41 times. Widened at 3 different actions 7 times. Found 16 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 18:36:51,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:51,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:51,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:51,070 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 18:36:51,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:51,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:51,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:51,196 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 18:36:51,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:51,330 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 18:36:51,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:51,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-03 18:36:51,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:51,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:36:51,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:36:51,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:36:51,351 INFO L87 Difference]: Start difference. First operand 2433 states and 3907 transitions. Second operand 16 states. [2018-12-03 18:36:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:55,507 INFO L93 Difference]: Finished difference Result 3690 states and 5942 transitions. [2018-12-03 18:36:55,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:36:55,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-03 18:36:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:55,511 INFO L225 Difference]: With dead ends: 3690 [2018-12-03 18:36:55,511 INFO L226 Difference]: Without dead ends: 3639 [2018-12-03 18:36:55,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1002, Invalid=3420, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:36:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2018-12-03 18:36:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 2628. [2018-12-03 18:36:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2018-12-03 18:36:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 4249 transitions. [2018-12-03 18:36:56,709 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 4249 transitions. Word has length 18 [2018-12-03 18:36:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:56,710 INFO L480 AbstractCegarLoop]: Abstraction has 2628 states and 4249 transitions. [2018-12-03 18:36:56,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:36:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 4249 transitions. [2018-12-03 18:36:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:36:56,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:56,711 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:56,711 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:56,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-12-03 18:36:56,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:56,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:56,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:56,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:56,796 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 18:36:56,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:56,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:56,796 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:36:56,797 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [23], [25], [27], [30], [32], [36], [38], [41], [43] [2018-12-03 18:36:56,797 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:56,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:56,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:36:56,820 INFO L272 AbstractInterpreter]: Visited 14 different actions 79 times. Merged at 12 different actions 44 times. Widened at 5 different actions 8 times. Found 24 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:36:56,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:56,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:36:56,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:56,829 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 18:36:56,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:56,840 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:56,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:56,970 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 18:36:56,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:57,744 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 18:36:57,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:57,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2018-12-03 18:36:57,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:57,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:36:57,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:36:57,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:36:57,765 INFO L87 Difference]: Start difference. First operand 2628 states and 4249 transitions. Second operand 18 states. [2018-12-03 18:37:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:02,701 INFO L93 Difference]: Finished difference Result 4046 states and 6519 transitions. [2018-12-03 18:37:02,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:37:02,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 18:37:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:02,704 INFO L225 Difference]: With dead ends: 4046 [2018-12-03 18:37:02,705 INFO L226 Difference]: Without dead ends: 4044 [2018-12-03 18:37:02,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1116, Invalid=4736, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 18:37:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2018-12-03 18:37:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 3267. [2018-12-03 18:37:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3267 states. [2018-12-03 18:37:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 5296 transitions. [2018-12-03 18:37:04,120 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 5296 transitions. Word has length 18 [2018-12-03 18:37:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:04,120 INFO L480 AbstractCegarLoop]: Abstraction has 3267 states and 5296 transitions. [2018-12-03 18:37:04,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:37:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 5296 transitions. [2018-12-03 18:37:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:37:04,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:04,121 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:04,122 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:04,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-12-03 18:37:04,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:04,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:04,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:04,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:04,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:04,359 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 18:37:04,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:04,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:04,360 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:37:04,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:37:04,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:04,360 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 18:37:04,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:37:04,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:37:04,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:37:04,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:37:04,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:04,433 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 18:37:04,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:04,525 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 18:37:04,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:04,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 18:37:04,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:04,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:37:04,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:37:04,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:37:04,546 INFO L87 Difference]: Start difference. First operand 3267 states and 5296 transitions. Second operand 15 states. [2018-12-03 18:37:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:10,168 INFO L93 Difference]: Finished difference Result 5111 states and 8313 transitions. [2018-12-03 18:37:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 18:37:10,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:37:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:10,173 INFO L225 Difference]: With dead ends: 5111 [2018-12-03 18:37:10,173 INFO L226 Difference]: Without dead ends: 5106 [2018-12-03 18:37:10,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1729, Invalid=6461, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 18:37:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2018-12-03 18:37:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 3114. [2018-12-03 18:37:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2018-12-03 18:37:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 5026 transitions. [2018-12-03 18:37:11,552 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 5026 transitions. Word has length 18 [2018-12-03 18:37:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:11,552 INFO L480 AbstractCegarLoop]: Abstraction has 3114 states and 5026 transitions. [2018-12-03 18:37:11,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:37:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 5026 transitions. [2018-12-03 18:37:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:37:11,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:11,553 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:11,553 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:11,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1899944713, now seen corresponding path program 1 times [2018-12-03 18:37:11,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:11,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:11,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:37:11,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:11,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:11,646 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 18:37:11,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:11,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:11,647 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:37:11,647 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [23], [25], [27], [32], [36], [38], [41], [43], [45], [47], [50] [2018-12-03 18:37:11,647 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:11,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:11,677 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:11,678 INFO L272 AbstractInterpreter]: Visited 16 different actions 93 times. Merged at 14 different actions 54 times. Widened at 5 different actions 9 times. Found 26 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 18:37:11,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:11,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:11,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:11,714 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 18:37:11,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:11,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:11,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:11,908 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 18:37:11,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:12,021 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 18:37:12,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:12,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2018-12-03 18:37:12,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:12,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:37:12,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:37:12,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:37:12,041 INFO L87 Difference]: Start difference. First operand 3114 states and 5026 transitions. Second operand 17 states. [2018-12-03 18:37:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:18,461 INFO L93 Difference]: Finished difference Result 4638 states and 7557 transitions. [2018-12-03 18:37:18,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 18:37:18,461 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-03 18:37:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:18,465 INFO L225 Difference]: With dead ends: 4638 [2018-12-03 18:37:18,465 INFO L226 Difference]: Without dead ends: 4636 [2018-12-03 18:37:18,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2922 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1735, Invalid=7967, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 18:37:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4636 states. [2018-12-03 18:37:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4636 to 3244. [2018-12-03 18:37:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2018-12-03 18:37:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 5247 transitions. [2018-12-03 18:37:20,033 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 5247 transitions. Word has length 18 [2018-12-03 18:37:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:20,033 INFO L480 AbstractCegarLoop]: Abstraction has 3244 states and 5247 transitions. [2018-12-03 18:37:20,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:37:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 5247 transitions. [2018-12-03 18:37:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:37:20,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:20,034 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:20,034 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:20,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1199474987, now seen corresponding path program 2 times [2018-12-03 18:37:20,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:20,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:20,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:20,117 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 18:37:20,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:20,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:20,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:37:20,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:37:20,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:20,118 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 18:37:20,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:37:20,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:37:20,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:37:20,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:37:20,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:20,225 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 18:37:20,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:20,295 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 18:37:20,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:20,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 18:37:20,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:20,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:37:20,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:37:20,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:37:20,314 INFO L87 Difference]: Start difference. First operand 3244 states and 5247 transitions. Second operand 15 states. [2018-12-03 18:37:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:24,970 INFO L93 Difference]: Finished difference Result 4606 states and 7453 transitions. [2018-12-03 18:37:24,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:37:24,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:37:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:24,975 INFO L225 Difference]: With dead ends: 4606 [2018-12-03 18:37:24,975 INFO L226 Difference]: Without dead ends: 4604 [2018-12-03 18:37:24,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=887, Invalid=4083, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:37:24,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2018-12-03 18:37:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 3230. [2018-12-03 18:37:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2018-12-03 18:37:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 5190 transitions. [2018-12-03 18:37:26,546 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 5190 transitions. Word has length 18 [2018-12-03 18:37:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:26,546 INFO L480 AbstractCegarLoop]: Abstraction has 3230 states and 5190 transitions. [2018-12-03 18:37:26,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:37:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 5190 transitions. [2018-12-03 18:37:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:37:26,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:26,548 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:26,548 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:26,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1150743797, now seen corresponding path program 2 times [2018-12-03 18:37:26,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:26,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:26,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:37:26,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:26,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:26,640 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 18:37:26,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:26,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:26,641 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:37:26,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:37:26,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:26,641 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 18:37:26,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:37:26,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:37:26,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 18:37:26,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:37:26,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:26,759 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 18:37:26,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:26,834 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 18:37:26,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:26,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-03 18:37:26,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:26,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:37:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:37:26,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:37:26,853 INFO L87 Difference]: Start difference. First operand 3230 states and 5190 transitions. Second operand 17 states. [2018-12-03 18:37:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:31,693 INFO L93 Difference]: Finished difference Result 4410 states and 7087 transitions. [2018-12-03 18:37:31,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 18:37:31,694 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-12-03 18:37:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:31,698 INFO L225 Difference]: With dead ends: 4410 [2018-12-03 18:37:31,698 INFO L226 Difference]: Without dead ends: 4376 [2018-12-03 18:37:31,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=991, Invalid=6149, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:37:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2018-12-03 18:37:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 3189. [2018-12-03 18:37:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2018-12-03 18:37:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 5087 transitions. [2018-12-03 18:37:33,226 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 5087 transitions. Word has length 18 [2018-12-03 18:37:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:33,226 INFO L480 AbstractCegarLoop]: Abstraction has 3189 states and 5087 transitions. [2018-12-03 18:37:33,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:37:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 5087 transitions. [2018-12-03 18:37:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:37:33,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:33,227 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:33,227 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:33,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-12-03 18:37:33,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:33,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:33,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:37:33,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:33,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:33,635 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 18:37:33,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:33,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:33,636 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 18:37:33,636 INFO L205 CegarAbsIntRunner]: [0], [4], [19], [23], [36], [38], [41], [43], [45], [46], [47], [50], [52] [2018-12-03 18:37:33,637 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:33,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:33,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:33,652 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 18:37:33,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:33,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:33,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:33,654 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 18:37:33,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:33,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:33,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:33,830 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 18:37:33,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:33,966 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 18:37:33,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:33,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2018-12-03 18:37:33,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:33,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:37:33,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:37:33,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:37:33,985 INFO L87 Difference]: Start difference. First operand 3189 states and 5087 transitions. Second operand 21 states. [2018-12-03 18:37:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:38,582 INFO L93 Difference]: Finished difference Result 3565 states and 5702 transitions. [2018-12-03 18:37:38,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:37:38,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-12-03 18:37:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:38,585 INFO L225 Difference]: With dead ends: 3565 [2018-12-03 18:37:38,585 INFO L226 Difference]: Without dead ends: 3563 [2018-12-03 18:37:38,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=967, Invalid=4003, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:37:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-12-03 18:37:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3377. [2018-12-03 18:37:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-12-03 18:37:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 5396 transitions. [2018-12-03 18:37:40,299 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 5396 transitions. Word has length 19 [2018-12-03 18:37:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:40,299 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 5396 transitions. [2018-12-03 18:37:40,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:37:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 5396 transitions. [2018-12-03 18:37:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:37:40,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:40,300 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:40,300 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:40,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-12-03 18:37:40,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:40,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:40,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:40,412 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 18:37:40,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:40,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:40,412 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 18:37:40,412 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [32], [36], [37], [38], [41], [43] [2018-12-03 18:37:40,413 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:40,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:40,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:40,430 INFO L272 AbstractInterpreter]: Visited 12 different actions 71 times. Merged at 11 different actions 39 times. Widened at 4 different actions 6 times. Found 20 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:37:40,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:40,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:40,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:40,432 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 18:37:40,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:40,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:40,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:40,570 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 18:37:40,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:40,720 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 18:37:40,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:40,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2018-12-03 18:37:40,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:40,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:37:40,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:37:40,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:37:40,742 INFO L87 Difference]: Start difference. First operand 3377 states and 5396 transitions. Second operand 19 states. [2018-12-03 18:37:41,725 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-12-03 18:37:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:49,034 INFO L93 Difference]: Finished difference Result 6040 states and 9759 transitions. [2018-12-03 18:37:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:37:49,034 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 18:37:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:49,040 INFO L225 Difference]: With dead ends: 6040 [2018-12-03 18:37:49,040 INFO L226 Difference]: Without dead ends: 6029 [2018-12-03 18:37:49,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1381, Invalid=4625, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:37:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2018-12-03 18:37:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 4198. [2018-12-03 18:37:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4198 states. [2018-12-03 18:37:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 6787 transitions. [2018-12-03 18:37:51,282 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 6787 transitions. Word has length 19 [2018-12-03 18:37:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:51,282 INFO L480 AbstractCegarLoop]: Abstraction has 4198 states and 6787 transitions. [2018-12-03 18:37:51,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:37:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 6787 transitions. [2018-12-03 18:37:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:37:51,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:51,284 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:51,284 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:51,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-12-03 18:37:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:51,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:51,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:51,419 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 18:37:51,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:51,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:51,420 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-03 18:37:51,420 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [32], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 18:37:51,421 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:51,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:51,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:37:51,446 INFO L272 AbstractInterpreter]: Visited 14 different actions 85 times. Merged at 13 different actions 49 times. Widened at 4 different actions 7 times. Found 22 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:37:51,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:51,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:37:51,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:51,480 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 18:37:51,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:51,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:51,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:51,627 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 18:37:51,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:51,756 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 18:37:51,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:51,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-12-03 18:37:51,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:51,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:37:51,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:37:51,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:37:51,778 INFO L87 Difference]: Start difference. First operand 4198 states and 6787 transitions. Second operand 18 states. [2018-12-03 18:38:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:01,744 INFO L93 Difference]: Finished difference Result 7797 states and 12685 transitions. [2018-12-03 18:38:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:38:01,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-12-03 18:38:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:01,751 INFO L225 Difference]: With dead ends: 7797 [2018-12-03 18:38:01,751 INFO L226 Difference]: Without dead ends: 7780 [2018-12-03 18:38:01,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2106 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1490, Invalid=6342, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 18:38:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7780 states. [2018-12-03 18:38:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7780 to 4414. [2018-12-03 18:38:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4414 states. [2018-12-03 18:38:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 7114 transitions. [2018-12-03 18:38:04,365 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 7114 transitions. Word has length 19 [2018-12-03 18:38:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:04,366 INFO L480 AbstractCegarLoop]: Abstraction has 4414 states and 7114 transitions. [2018-12-03 18:38:04,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:38:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 7114 transitions. [2018-12-03 18:38:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:04,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:04,367 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 18:38:04,367 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:04,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:04,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1608911408, now seen corresponding path program 3 times [2018-12-03 18:38:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:04,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:04,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:04,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:04,620 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 18:38:04,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:04,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:04,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:38:04,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:38:04,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:04,620 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 18:38:04,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:38:04,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:38:04,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:38:04,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:38:04,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:04,793 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 18:38:04,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:04,914 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 18:38:04,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:04,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2018-12-03 18:38:04,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:04,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:38:04,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:38:04,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:38:04,935 INFO L87 Difference]: Start difference. First operand 4414 states and 7114 transitions. Second operand 19 states. [2018-12-03 18:38:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:13,597 INFO L93 Difference]: Finished difference Result 9132 states and 14709 transitions. [2018-12-03 18:38:13,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 18:38:13,598 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 18:38:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:13,601 INFO L225 Difference]: With dead ends: 9132 [2018-12-03 18:38:13,601 INFO L226 Difference]: Without dead ends: 4795 [2018-12-03 18:38:13,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3986 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2379, Invalid=11193, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 18:38:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2018-12-03 18:38:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4383. [2018-12-03 18:38:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2018-12-03 18:38:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 7046 transitions. [2018-12-03 18:38:16,127 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 7046 transitions. Word has length 21 [2018-12-03 18:38:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:16,128 INFO L480 AbstractCegarLoop]: Abstraction has 4383 states and 7046 transitions. [2018-12-03 18:38:16,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:38:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 7046 transitions. [2018-12-03 18:38:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:16,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:16,130 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:16,130 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:16,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:16,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1688920231, now seen corresponding path program 1 times [2018-12-03 18:38:16,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:16,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:38:16,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:16,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:16,232 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 18:38:16,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:16,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:16,232 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:38:16,232 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [12], [15], [23], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 18:38:16,233 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:16,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:16,261 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:38:16,261 INFO L272 AbstractInterpreter]: Visited 15 different actions 85 times. Merged at 12 different actions 52 times. Widened at 3 different actions 5 times. Found 22 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:38:16,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:16,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:38:16,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:16,265 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 18:38:16,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:16,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:38:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:16,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:16,377 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 18:38:16,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:16,516 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 18:38:16,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:16,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2018-12-03 18:38:16,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:16,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:38:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:38:16,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:38:16,537 INFO L87 Difference]: Start difference. First operand 4383 states and 7046 transitions. Second operand 17 states. [2018-12-03 18:38:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:24,723 INFO L93 Difference]: Finished difference Result 6406 states and 10276 transitions. [2018-12-03 18:38:24,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 18:38:24,724 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-12-03 18:38:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:24,730 INFO L225 Difference]: With dead ends: 6406 [2018-12-03 18:38:24,730 INFO L226 Difference]: Without dead ends: 6404 [2018-12-03 18:38:24,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1779, Invalid=6411, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 18:38:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2018-12-03 18:38:27,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 4207. [2018-12-03 18:38:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4207 states. [2018-12-03 18:38:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 6705 transitions. [2018-12-03 18:38:27,277 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 6705 transitions. Word has length 21 [2018-12-03 18:38:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:27,277 INFO L480 AbstractCegarLoop]: Abstraction has 4207 states and 6705 transitions. [2018-12-03 18:38:27,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:38:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 6705 transitions. [2018-12-03 18:38:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:27,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:27,279 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 18:38:27,279 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:27,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash 534864297, now seen corresponding path program 1 times [2018-12-03 18:38:27,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:27,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:27,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:27,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:27,463 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 18:38:27,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:27,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:27,464 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 18:38:27,464 INFO L205 CegarAbsIntRunner]: [0], [6], [10], [11], [12], [15], [23], [25], [27], [30], [36], [38], [41], [43], [45], [47], [52] [2018-12-03 18:38:27,464 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:27,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:27,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:38:27,488 INFO L272 AbstractInterpreter]: Visited 17 different actions 95 times. Merged at 14 different actions 60 times. Widened at 4 different actions 8 times. Found 22 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 18:38:27,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:27,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:38:27,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:27,490 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 18:38:27,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:27,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:38:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:27,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:27,599 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 18:38:27,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:27,914 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 18:38:27,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2018-12-03 18:38:27,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:27,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:38:27,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:38:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:38:27,936 INFO L87 Difference]: Start difference. First operand 4207 states and 6705 transitions. Second operand 16 states. [2018-12-03 18:38:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:35,890 INFO L93 Difference]: Finished difference Result 6513 states and 10423 transitions. [2018-12-03 18:38:35,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:38:35,890 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-03 18:38:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:35,896 INFO L225 Difference]: With dead ends: 6513 [2018-12-03 18:38:35,896 INFO L226 Difference]: Without dead ends: 6511 [2018-12-03 18:38:35,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=843, Invalid=3189, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:38:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2018-12-03 18:38:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 3929. [2018-12-03 18:38:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2018-12-03 18:38:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 6254 transitions. [2018-12-03 18:38:38,326 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 6254 transitions. Word has length 21 [2018-12-03 18:38:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:38,326 INFO L480 AbstractCegarLoop]: Abstraction has 3929 states and 6254 transitions. [2018-12-03 18:38:38,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:38:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 6254 transitions. [2018-12-03 18:38:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:38,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:38,328 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 18:38:38,328 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:38,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:38,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1298110833, now seen corresponding path program 4 times [2018-12-03 18:38:38,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:38,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:38,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:38,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:38,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:38,427 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 18:38:38,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:38,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:38,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:38:38,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:38:38,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:38,428 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 18:38:38,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:38,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:38:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:38,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:38,628 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 18:38:38,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:38,784 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 18:38:38,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:38,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-12-03 18:38:38,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:38,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:38:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:38:38,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:38:38,804 INFO L87 Difference]: Start difference. First operand 3929 states and 6254 transitions. Second operand 19 states. [2018-12-03 18:38:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:47,215 INFO L93 Difference]: Finished difference Result 9035 states and 14275 transitions. [2018-12-03 18:38:47,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 18:38:47,216 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-03 18:38:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:47,219 INFO L225 Difference]: With dead ends: 9035 [2018-12-03 18:38:47,219 INFO L226 Difference]: Without dead ends: 5121 [2018-12-03 18:38:47,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1627, Invalid=11483, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 18:38:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2018-12-03 18:38:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 4285. [2018-12-03 18:38:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4285 states. [2018-12-03 18:38:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6808 transitions. [2018-12-03 18:38:49,820 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6808 transitions. Word has length 21 [2018-12-03 18:38:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:49,820 INFO L480 AbstractCegarLoop]: Abstraction has 4285 states and 6808 transitions. [2018-12-03 18:38:49,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:38:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6808 transitions. [2018-12-03 18:38:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:38:49,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:49,822 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 18:38:49,822 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:49,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 5 times [2018-12-03 18:38:49,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:49,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:49,967 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 18:38:49,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:49,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:49,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:38:49,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:38:49,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:49,968 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 18:38:49,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:38:49,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:38:49,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:38:49,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:38:49,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:50,060 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 18:38:50,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:50,166 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 18:38:50,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:50,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2018-12-03 18:38:50,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:50,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:38:50,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:38:50,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:38:50,192 INFO L87 Difference]: Start difference. First operand 4285 states and 6808 transitions. Second operand 18 states. [2018-12-03 18:39:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:01,959 INFO L93 Difference]: Finished difference Result 6163 states and 9826 transitions. [2018-12-03 18:39:01,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 18:39:01,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 18:39:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:01,964 INFO L225 Difference]: With dead ends: 6163 [2018-12-03 18:39:01,964 INFO L226 Difference]: Without dead ends: 6155 [2018-12-03 18:39:01,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4598 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3445, Invalid=11807, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:39:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2018-12-03 18:39:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 2962. [2018-12-03 18:39:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2962 states. [2018-12-03 18:39:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 4658 transitions. [2018-12-03 18:39:03,969 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 4658 transitions. Word has length 21 [2018-12-03 18:39:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:03,969 INFO L480 AbstractCegarLoop]: Abstraction has 2962 states and 4658 transitions. [2018-12-03 18:39:03,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:39:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 4658 transitions. [2018-12-03 18:39:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:39:03,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:03,970 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 18:39:03,971 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:03,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:03,971 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 2 times [2018-12-03 18:39:03,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:03,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:39:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:03,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:04,205 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 18:39:04,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:04,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:04,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:39:04,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:39:04,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:04,205 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 18:39:04,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:39:04,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:39:04,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:39:04,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:39:04,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:39:04,371 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 18:39:04,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:39:04,546 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 18:39:04,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:39:04,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2018-12-03 18:39:04,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:39:04,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:39:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:39:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:39:04,566 INFO L87 Difference]: Start difference. First operand 2962 states and 4658 transitions. Second operand 21 states. [2018-12-03 18:39:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:24,386 INFO L93 Difference]: Finished difference Result 7444 states and 11843 transitions. [2018-12-03 18:39:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-12-03 18:39:24,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 18:39:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:24,391 INFO L225 Difference]: With dead ends: 7444 [2018-12-03 18:39:24,392 INFO L226 Difference]: Without dead ends: 7433 [2018-12-03 18:39:24,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16971 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5184, Invalid=39548, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 18:39:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2018-12-03 18:39:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 3570. [2018-12-03 18:39:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3570 states. [2018-12-03 18:39:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 5599 transitions. [2018-12-03 18:39:27,065 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 5599 transitions. Word has length 21 [2018-12-03 18:39:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:27,065 INFO L480 AbstractCegarLoop]: Abstraction has 3570 states and 5599 transitions. [2018-12-03 18:39:27,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:39:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 5599 transitions. [2018-12-03 18:39:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:39:27,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:27,067 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 18:39:27,067 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:27,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1246813361, now seen corresponding path program 2 times [2018-12-03 18:39:27,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:27,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:39:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:27,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:27,166 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 18:39:27,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:27,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:27,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:39:27,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:39:27,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:27,168 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 18:39:27,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:39:27,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:39:27,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:39:27,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:39:27,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:39:27,711 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 18:39:27,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:39:27,913 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 18:39:27,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:39:27,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2018-12-03 18:39:27,933 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:39:27,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:39:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:39:27,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=554, Unknown=1, NotChecked=0, Total=650 [2018-12-03 18:39:27,934 INFO L87 Difference]: Start difference. First operand 3570 states and 5599 transitions. Second operand 18 states. [2018-12-03 18:39:34,076 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-12-03 18:39:35,929 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 18:39:39,968 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-03 18:39:41,283 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 18:39:42,219 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-12-03 18:39:45,238 WARN L180 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 18:39:49,791 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 18:39:51,588 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 18:39:55,156 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 18:39:55,488 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-03 18:39:56,186 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:40:02,216 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 18:40:03,811 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-03 18:40:07,335 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 18:40:07,916 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 18:40:09,806 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-03 18:40:10,027 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 18:40:10,641 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-03 18:40:11,873 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 18:40:14,307 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 18:40:15,760 WARN L180 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 18:40:15,935 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-03 18:40:18,170 WARN L180 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 18:40:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:23,253 INFO L93 Difference]: Finished difference Result 7547 states and 11921 transitions. [2018-12-03 18:40:23,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-12-03 18:40:23,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-12-03 18:40:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:23,258 INFO L225 Difference]: With dead ends: 7547 [2018-12-03 18:40:23,259 INFO L226 Difference]: Without dead ends: 7536 [2018-12-03 18:40:23,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11757 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=5455, Invalid=26034, Unknown=17, NotChecked=0, Total=31506 [2018-12-03 18:40:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2018-12-03 18:40:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 3329. [2018-12-03 18:40:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3329 states. [2018-12-03 18:40:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5241 transitions. [2018-12-03 18:40:25,873 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5241 transitions. Word has length 21 [2018-12-03 18:40:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:25,874 INFO L480 AbstractCegarLoop]: Abstraction has 3329 states and 5241 transitions. [2018-12-03 18:40:25,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:40:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5241 transitions. [2018-12-03 18:40:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:40:25,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:25,875 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:40:25,875 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:25,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:25,876 INFO L82 PathProgramCache]: Analyzing trace with hash -471522047, now seen corresponding path program 2 times [2018-12-03 18:40:25,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:25,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:25,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:40:25,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:25,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:25,989 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 18:40:25,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:25,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:25,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:40:25,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:40:25,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:25,990 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 18:40:26,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:40:26,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:40:26,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 18:40:26,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:40:26,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:40:26,117 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 18:40:26,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:40:26,255 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 18:40:26,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:40:26,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2018-12-03 18:40:26,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:40:26,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:40:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:40:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:40:26,274 INFO L87 Difference]: Start difference. First operand 3329 states and 5241 transitions. Second operand 20 states. [2018-12-03 18:40:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:42,180 INFO L93 Difference]: Finished difference Result 7035 states and 11150 transitions. [2018-12-03 18:40:42,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-12-03 18:40:42,181 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-03 18:40:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:42,186 INFO L225 Difference]: With dead ends: 7035 [2018-12-03 18:40:42,186 INFO L226 Difference]: Without dead ends: 7033 [2018-12-03 18:40:42,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6829 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3099, Invalid=17493, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 18:40:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2018-12-03 18:40:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 3236. [2018-12-03 18:40:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3236 states. [2018-12-03 18:40:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 5092 transitions. [2018-12-03 18:40:44,754 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 5092 transitions. Word has length 24 [2018-12-03 18:40:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:44,754 INFO L480 AbstractCegarLoop]: Abstraction has 3236 states and 5092 transitions. [2018-12-03 18:40:44,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:40:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 5092 transitions. [2018-12-03 18:40:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:40:44,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:44,756 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2018-12-03 18:40:44,756 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:44,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1997760783, now seen corresponding path program 3 times [2018-12-03 18:40:44,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:44,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:44,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:40:44,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:44,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:45,005 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 18:40:45,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:45,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:45,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:40:45,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:40:45,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:45,005 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 18:40:45,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:40:45,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:40:45,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:40:45,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:40:45,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:40:45,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 18:40:45,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:40:45,273 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 18:40:45,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:40:45,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 28 [2018-12-03 18:40:45,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:40:45,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:40:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:40:45,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:40:45,293 INFO L87 Difference]: Start difference. First operand 3236 states and 5092 transitions. Second operand 24 states. [2018-12-03 18:40:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:52,972 INFO L93 Difference]: Finished difference Result 7022 states and 11034 transitions. [2018-12-03 18:40:52,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 18:40:52,973 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 18:40:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:52,975 INFO L225 Difference]: With dead ends: 7022 [2018-12-03 18:40:52,976 INFO L226 Difference]: Without dead ends: 3846 [2018-12-03 18:40:52,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4125 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1931, Invalid=10501, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:40:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2018-12-03 18:40:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3462. [2018-12-03 18:40:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2018-12-03 18:40:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 5450 transitions. [2018-12-03 18:40:55,732 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 5450 transitions. Word has length 25 [2018-12-03 18:40:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:55,732 INFO L480 AbstractCegarLoop]: Abstraction has 3462 states and 5450 transitions. [2018-12-03 18:40:55,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:40:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 5450 transitions. [2018-12-03 18:40:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:40:55,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:55,734 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 18:40:55,734 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:55,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1735749504, now seen corresponding path program 1 times [2018-12-03 18:40:55,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:55,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:40:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:55,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:55,994 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 18:40:55,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:55,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:55,995 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 18:40:55,995 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [25], [26], [27], [30], [32], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 18:40:55,996 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:40:55,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:40:56,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:40:56,015 INFO L272 AbstractInterpreter]: Visited 17 different actions 85 times. Merged at 15 different actions 46 times. Widened at 2 different actions 5 times. Found 27 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 18:40:56,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:56,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:40:56,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:56,027 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 18:40:56,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:56,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:40:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:56,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:40:56,217 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 18:40:56,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:40:56,384 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 18:40:56,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:40:56,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2018-12-03 18:40:56,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:40:56,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:40:56,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:40:56,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:40:56,405 INFO L87 Difference]: Start difference. First operand 3462 states and 5450 transitions. Second operand 24 states. [2018-12-03 18:41:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:10,593 INFO L93 Difference]: Finished difference Result 5001 states and 7932 transitions. [2018-12-03 18:41:10,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-12-03 18:41:10,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 18:41:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:10,597 INFO L225 Difference]: With dead ends: 5001 [2018-12-03 18:41:10,597 INFO L226 Difference]: Without dead ends: 4999 [2018-12-03 18:41:10,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7974 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4634, Invalid=19858, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 18:41:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2018-12-03 18:41:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 3897. [2018-12-03 18:41:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2018-12-03 18:41:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 6149 transitions. [2018-12-03 18:41:13,673 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 6149 transitions. Word has length 25 [2018-12-03 18:41:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:13,674 INFO L480 AbstractCegarLoop]: Abstraction has 3897 states and 6149 transitions. [2018-12-03 18:41:13,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:41:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 6149 transitions. [2018-12-03 18:41:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:41:13,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:13,676 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:41:13,676 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:13,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash -868093692, now seen corresponding path program 4 times [2018-12-03 18:41:13,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:13,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:13,839 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 18:41:13,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:13,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:13,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:41:13,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:41:13,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:13,840 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 18:41:13,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:13,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:41:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:13,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:41:14,050 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 18:41:14,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:41:14,197 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 18:41:14,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:41:14,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2018-12-03 18:41:14,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:41:14,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:41:14,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:41:14,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:41:14,218 INFO L87 Difference]: Start difference. First operand 3897 states and 6149 transitions. Second operand 21 states. [2018-12-03 18:41:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:26,796 INFO L93 Difference]: Finished difference Result 5815 states and 9184 transitions. [2018-12-03 18:41:26,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 18:41:26,797 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2018-12-03 18:41:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:26,801 INFO L225 Difference]: With dead ends: 5815 [2018-12-03 18:41:26,801 INFO L226 Difference]: Without dead ends: 5813 [2018-12-03 18:41:26,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6172 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3990, Invalid=14642, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 18:41:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2018-12-03 18:41:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 4101. [2018-12-03 18:41:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2018-12-03 18:41:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6480 transitions. [2018-12-03 18:41:30,135 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6480 transitions. Word has length 25 [2018-12-03 18:41:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:30,135 INFO L480 AbstractCegarLoop]: Abstraction has 4101 states and 6480 transitions. [2018-12-03 18:41:30,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:41:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6480 transitions. [2018-12-03 18:41:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:41:30,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:30,137 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 18:41:30,137 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:30,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1568806716, now seen corresponding path program 1 times [2018-12-03 18:41:30,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:30,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:30,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:30,623 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 18:41:30,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:30,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:30,623 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 18:41:30,624 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [10], [11], [12], [15], [17], [23], [36], [38], [41], [43], [45], [47], [50], [52] [2018-12-03 18:41:30,624 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:41:30,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:41:30,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:41:30,644 INFO L272 AbstractInterpreter]: Visited 17 different actions 87 times. Merged at 15 different actions 46 times. Widened at 3 different actions 4 times. Found 29 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 18:41:30,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:30,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:41:30,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:30,645 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 18:41:30,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:30,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:41:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:30,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:41:30,833 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 18:41:30,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:41:30,995 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 18:41:31,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:41:31,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2018-12-03 18:41:31,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:41:31,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:41:31,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:41:31,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:41:31,015 INFO L87 Difference]: Start difference. First operand 4101 states and 6480 transitions. Second operand 24 states. [2018-12-03 18:41:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:50,357 INFO L93 Difference]: Finished difference Result 6832 states and 10869 transitions. [2018-12-03 18:41:50,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 18:41:50,358 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-12-03 18:41:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:50,365 INFO L225 Difference]: With dead ends: 6832 [2018-12-03 18:41:50,365 INFO L226 Difference]: Without dead ends: 6830 [2018-12-03 18:41:50,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8022 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=4587, Invalid=19593, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 18:41:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2018-12-03 18:41:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 4656. [2018-12-03 18:41:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2018-12-03 18:41:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 7343 transitions. [2018-12-03 18:41:54,918 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 7343 transitions. Word has length 25 [2018-12-03 18:41:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:54,918 INFO L480 AbstractCegarLoop]: Abstraction has 4656 states and 7343 transitions. [2018-12-03 18:41:54,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:41:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 7343 transitions. [2018-12-03 18:41:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:41:54,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:54,920 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:41:54,920 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:54,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2018393209, now seen corresponding path program 1 times [2018-12-03 18:41:54,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:54,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:54,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:55,161 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 18:41:55,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:55,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:55,161 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-03 18:41:55,161 INFO L205 CegarAbsIntRunner]: [0], [6], [23], [25], [27], [30], [36], [37], [38], [41], [43], [45], [47], [50] [2018-12-03 18:41:55,162 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:41:55,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:41:55,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:41:55,189 INFO L272 AbstractInterpreter]: Visited 14 different actions 83 times. Merged at 11 different actions 44 times. Widened at 3 different actions 6 times. Found 24 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 18:41:55,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:55,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:41:55,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:55,216 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 18:41:55,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:55,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:41:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:55,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:41:55,422 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 18:41:55,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:41:55,548 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 18:41:55,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:41:55,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2018-12-03 18:41:55,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:41:55,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:41:55,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:41:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:41:55,567 INFO L87 Difference]: Start difference. First operand 4656 states and 7343 transitions. Second operand 23 states. [2018-12-03 18:42:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:15,945 INFO L93 Difference]: Finished difference Result 13604 states and 21281 transitions. [2018-12-03 18:42:15,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-12-03 18:42:15,945 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-12-03 18:42:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:15,953 INFO L225 Difference]: With dead ends: 13604 [2018-12-03 18:42:15,953 INFO L226 Difference]: Without dead ends: 8871 [2018-12-03 18:42:15,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 15238 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3664, Invalid=35738, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 18:42:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2018-12-03 18:42:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 6323. [2018-12-03 18:42:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6323 states. [2018-12-03 18:42:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 10032 transitions. [2018-12-03 18:42:22,179 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 10032 transitions. Word has length 25 [2018-12-03 18:42:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:22,179 INFO L480 AbstractCegarLoop]: Abstraction has 6323 states and 10032 transitions. [2018-12-03 18:42:22,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:42:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 10032 transitions. [2018-12-03 18:42:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:42:22,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:22,181 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:42:22,181 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:22,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:22,182 INFO L82 PathProgramCache]: Analyzing trace with hash 998547776, now seen corresponding path program 2 times [2018-12-03 18:42:22,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:22,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:22,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:42:22,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:22,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:22,332 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 18:42:22,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:22,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:22,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:42:22,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:42:22,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:22,332 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 18:42:22,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:42:22,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:42:22,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 18:42:22,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:42:22,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:42:22,521 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 18:42:22,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:42:22,677 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 18:42:22,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:42:22,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 32 [2018-12-03 18:42:22,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:42:22,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:42:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:42:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:42:22,697 INFO L87 Difference]: Start difference. First operand 6323 states and 10032 transitions. Second operand 25 states. [2018-12-03 18:42:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:43,951 INFO L93 Difference]: Finished difference Result 10037 states and 16233 transitions. [2018-12-03 18:42:43,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-12-03 18:42:43,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-12-03 18:42:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:43,959 INFO L225 Difference]: With dead ends: 10037 [2018-12-03 18:42:43,959 INFO L226 Difference]: Without dead ends: 10035 [2018-12-03 18:42:43,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8292 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5205, Invalid=20877, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 18:42:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10035 states. [2018-12-03 18:42:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10035 to 7166. [2018-12-03 18:42:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7166 states. [2018-12-03 18:42:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7166 states to 7166 states and 11447 transitions. [2018-12-03 18:42:51,029 INFO L78 Accepts]: Start accepts. Automaton has 7166 states and 11447 transitions. Word has length 26 [2018-12-03 18:42:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:51,029 INFO L480 AbstractCegarLoop]: Abstraction has 7166 states and 11447 transitions. [2018-12-03 18:42:51,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:42:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7166 states and 11447 transitions. [2018-12-03 18:42:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:42:51,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:51,032 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 18:42:51,032 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:51,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:51,032 INFO L82 PathProgramCache]: Analyzing trace with hash 604672123, now seen corresponding path program 2 times [2018-12-03 18:42:51,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:51,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:51,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:42:51,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:51,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:51,311 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 18:42:51,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:51,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:51,312 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:42:51,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:42:51,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:51,312 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 18:42:51,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:42:51,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:42:51,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:42:51,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:42:51,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:42:51,445 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 18:42:51,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:42:51,608 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 18:42:51,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:42:51,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 31 [2018-12-03 18:42:51,627 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:42:51,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:42:51,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:42:51,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:42:51,628 INFO L87 Difference]: Start difference. First operand 7166 states and 11447 transitions. Second operand 23 states. [2018-12-03 18:43:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:43:16,884 INFO L93 Difference]: Finished difference Result 15339 states and 24634 transitions. [2018-12-03 18:43:16,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 18:43:16,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-12-03 18:43:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:43:16,896 INFO L225 Difference]: With dead ends: 15339 [2018-12-03 18:43:16,896 INFO L226 Difference]: Without dead ends: 15327 [2018-12-03 18:43:16,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1989, Invalid=7713, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 18:43:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15327 states. [2018-12-03 18:43:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15327 to 8956. [2018-12-03 18:43:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8956 states. [2018-12-03 18:43:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8956 states to 8956 states and 14358 transitions. [2018-12-03 18:43:25,785 INFO L78 Accepts]: Start accepts. Automaton has 8956 states and 14358 transitions. Word has length 26 [2018-12-03 18:43:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:43:25,785 INFO L480 AbstractCegarLoop]: Abstraction has 8956 states and 14358 transitions. [2018-12-03 18:43:25,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:43:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 8956 states and 14358 transitions. [2018-12-03 18:43:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:43:25,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:43:25,788 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:43:25,788 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:43:25,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash -951541235, now seen corresponding path program 1 times [2018-12-03 18:43:25,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:43:25,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:25,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:43:25,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:25,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:43:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:26,825 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 18:43:26,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:26,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:43:26,825 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 18:43:26,825 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [19], [23], [25], [27], [30], [32], [36], [37], [38], [41], [43] [2018-12-03 18:43:26,826 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:43:26,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:43:26,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:43:26,839 INFO L272 AbstractInterpreter]: Visited 14 different actions 65 times. Merged at 12 different actions 31 times. Widened at 2 different actions 2 times. Found 21 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 18:43:26,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:26,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:43:26,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:26,840 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 18:43:26,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:43:26,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:43:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:26,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:43:27,034 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 18:43:27,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:43:27,187 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 18:43:27,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:43:27,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 33 [2018-12-03 18:43:27,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:43:27,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:43:27,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:43:27,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:43:27,207 INFO L87 Difference]: Start difference. First operand 8956 states and 14358 transitions. Second operand 25 states. [2018-12-03 18:43:34,049 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-12-03 18:43:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:43:53,117 INFO L93 Difference]: Finished difference Result 15554 states and 24948 transitions. [2018-12-03 18:43:53,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 18:43:53,118 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-12-03 18:43:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:43:53,129 INFO L225 Difference]: With dead ends: 15554 [2018-12-03 18:43:53,129 INFO L226 Difference]: Without dead ends: 15543 [2018-12-03 18:43:53,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2454, Invalid=13046, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 18:43:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15543 states. [2018-12-03 18:44:04,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15543 to 11410. [2018-12-03 18:44:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11410 states. [2018-12-03 18:44:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11410 states to 11410 states and 18355 transitions. [2018-12-03 18:44:04,609 INFO L78 Accepts]: Start accepts. Automaton has 11410 states and 18355 transitions. Word has length 26 [2018-12-03 18:44:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:44:04,610 INFO L480 AbstractCegarLoop]: Abstraction has 11410 states and 18355 transitions. [2018-12-03 18:44:04,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:44:04,610 INFO L276 IsEmpty]: Start isEmpty. Operand 11410 states and 18355 transitions. [2018-12-03 18:44:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:44:04,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:44:04,613 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 18:44:04,613 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:44:04,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:44:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash 179058058, now seen corresponding path program 2 times [2018-12-03 18:44:04,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:44:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:04,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:44:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:04,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:44:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:44:04,887 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 18:44:04,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:04,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:44:04,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:44:04,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:44:04,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:04,888 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 18:44:04,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:44:04,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:44:04,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:44:04,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:44:04,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:44:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 18:44:05,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:44:05,369 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 18:44:05,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:44:05,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2018-12-03 18:44:05,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:44:05,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:44:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:44:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:44:05,391 INFO L87 Difference]: Start difference. First operand 11410 states and 18355 transitions. Second operand 23 states. [2018-12-03 18:44:17,893 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-12-03 18:44:18,389 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:44:18,966 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-12-03 18:44:19,904 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-03 18:44:21,354 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 18:44:21,479 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 18:44:23,252 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 18:44:24,720 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 18:44:25,480 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-03 18:44:25,975 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 18:44:29,123 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-12-03 18:44:31,067 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-12-03 18:44:31,384 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-03 18:44:32,472 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 18:44:32,760 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-12-03 18:44:34,777 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 18:44:36,483 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-03 18:44:36,857 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-03 18:44:37,284 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 18:44:38,180 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-12-03 18:44:41,874 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-03 18:44:42,277 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-03 18:44:43,939 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-12-03 18:44:46,324 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-03 18:44:47,238 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-03 18:44:47,549 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 18:44:48,701 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 18:44:52,211 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-03 18:44:53,900 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-03 18:44:55,030 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 18:44:55,707 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-03 18:45:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:45:02,260 INFO L93 Difference]: Finished difference Result 14513 states and 23469 transitions. [2018-12-03 18:45:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-12-03 18:45:02,260 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-03 18:45:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:45:02,275 INFO L225 Difference]: With dead ends: 14513 [2018-12-03 18:45:02,275 INFO L226 Difference]: Without dead ends: 14511 [2018-12-03 18:45:02,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9996 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=4976, Invalid=25114, Unknown=12, NotChecked=0, Total=30102 [2018-12-03 18:45:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14511 states. [2018-12-03 18:45:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14511 to 12614. [2018-12-03 18:45:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12614 states. [2018-12-03 18:45:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12614 states to 12614 states and 20350 transitions. [2018-12-03 18:45:15,021 INFO L78 Accepts]: Start accepts. Automaton has 12614 states and 20350 transitions. Word has length 28 [2018-12-03 18:45:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:45:15,021 INFO L480 AbstractCegarLoop]: Abstraction has 12614 states and 20350 transitions. [2018-12-03 18:45:15,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:45:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 12614 states and 20350 transitions. [2018-12-03 18:45:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:45:15,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:45:15,025 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2018-12-03 18:45:15,025 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:45:15,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:15,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1671739405, now seen corresponding path program 5 times [2018-12-03 18:45:15,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:45:15,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:15,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:45:15,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:15,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:45:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:15,183 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 18:45:15,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:15,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:45:15,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:45:15,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:45:15,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:15,184 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 18:45:15,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:45:15,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:45:15,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:45:15,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:45:15,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:45:15,700 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 18:45:15,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:45:16,052 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 18:45:16,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:45:16,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2018-12-03 18:45:16,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:45:16,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:45:16,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:45:16,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:45:16,072 INFO L87 Difference]: Start difference. First operand 12614 states and 20350 transitions. Second operand 22 states. [2018-12-03 18:45:19,600 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 18:45:20,208 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 18:45:21,442 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-03 18:45:25,028 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 18:45:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:45:39,962 INFO L93 Difference]: Finished difference Result 15552 states and 25060 transitions. [2018-12-03 18:45:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 18:45:39,963 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-12-03 18:45:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:45:39,976 INFO L225 Difference]: With dead ends: 15552 [2018-12-03 18:45:39,976 INFO L226 Difference]: Without dead ends: 15550 [2018-12-03 18:45:39,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2591 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2534, Invalid=8386, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 18:45:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15550 states. [2018-12-03 18:45:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15550 to 10792. [2018-12-03 18:45:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10792 states. [2018-12-03 18:45:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10792 states to 10792 states and 17288 transitions. [2018-12-03 18:45:51,199 INFO L78 Accepts]: Start accepts. Automaton has 10792 states and 17288 transitions. Word has length 28 [2018-12-03 18:45:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:45:51,200 INFO L480 AbstractCegarLoop]: Abstraction has 10792 states and 17288 transitions. [2018-12-03 18:45:51,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:45:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 10792 states and 17288 transitions. [2018-12-03 18:45:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:45:51,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:45:51,203 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 18:45:51,203 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:45:51,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1100753059, now seen corresponding path program 1 times [2018-12-03 18:45:51,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:45:51,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:51,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:45:51,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:51,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:45:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:51,496 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 18:45:51,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:51,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:45:51,496 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 18:45:51,497 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 18:45:51,497 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:45:51,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:45:51,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:45:51,523 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 18:45:51,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:51,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:45:51,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:51,525 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 18:45:51,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:45:51,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:45:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:51,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:45:51,830 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 18:45:51,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:45:51,968 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 18:45:51,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:45:51,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2018-12-03 18:45:51,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:45:51,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:45:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:45:51,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:45:51,988 INFO L87 Difference]: Start difference. First operand 10792 states and 17288 transitions. Second operand 23 states. [2018-12-03 18:46:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:46:11,654 INFO L93 Difference]: Finished difference Result 23424 states and 37581 transitions. [2018-12-03 18:46:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 18:46:11,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-03 18:46:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:46:11,665 INFO L225 Difference]: With dead ends: 23424 [2018-12-03 18:46:11,665 INFO L226 Difference]: Without dead ends: 12688 [2018-12-03 18:46:11,674 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 18:46:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12688 states. [2018-12-03 18:46:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12688 to 10781. [2018-12-03 18:46:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10781 states. [2018-12-03 18:46:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10781 states to 10781 states and 17283 transitions. [2018-12-03 18:46:23,222 INFO L78 Accepts]: Start accepts. Automaton has 10781 states and 17283 transitions. Word has length 28 [2018-12-03 18:46:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:46:23,222 INFO L480 AbstractCegarLoop]: Abstraction has 10781 states and 17283 transitions. [2018-12-03 18:46:23,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:46:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10781 states and 17283 transitions. [2018-12-03 18:46:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:46:23,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:46:23,226 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 18:46:23,226 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:46:23,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:46:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash 564227467, now seen corresponding path program 1 times [2018-12-03 18:46:23,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:46:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:46:23,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:46:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:46:23,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:46:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:46:23,365 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 18:46:23,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:46:23,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:46:23,365 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 18:46:23,365 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 18:46:23,366 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:46:23,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:46:23,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:46:23,401 INFO L272 AbstractInterpreter]: Visited 19 different actions 105 times. Merged at 17 different actions 59 times. Widened at 5 different actions 9 times. Found 32 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 18:46:23,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:46:23,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:46:23,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:46:23,437 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 18:46:23,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:46:23,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:46:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:46:23,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:46:23,683 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 18:46:23,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:46:23,823 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 18:46:23,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:46:23,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 29 [2018-12-03 18:46:23,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:46:23,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:46:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:46:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:46:23,842 INFO L87 Difference]: Start difference. First operand 10781 states and 17283 transitions. Second operand 21 states. [2018-12-03 18:46:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:46:49,330 INFO L93 Difference]: Finished difference Result 16329 states and 26678 transitions. [2018-12-03 18:46:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:46:49,330 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-12-03 18:46:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:46:49,344 INFO L225 Difference]: With dead ends: 16329 [2018-12-03 18:46:49,345 INFO L226 Difference]: Without dead ends: 16327 [2018-12-03 18:46:49,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1058, Invalid=4642, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:46:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16327 states. [2018-12-03 18:47:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16327 to 12706. [2018-12-03 18:47:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12706 states. [2018-12-03 18:47:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12706 states to 12706 states and 20489 transitions. [2018-12-03 18:47:03,214 INFO L78 Accepts]: Start accepts. Automaton has 12706 states and 20489 transitions. Word has length 28 [2018-12-03 18:47:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:03,215 INFO L480 AbstractCegarLoop]: Abstraction has 12706 states and 20489 transitions. [2018-12-03 18:47:03,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:47:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 12706 states and 20489 transitions. [2018-12-03 18:47:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:47:03,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:03,218 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 18:47:03,219 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:03,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash -323092399, now seen corresponding path program 3 times [2018-12-03 18:47:03,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:03,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:03,474 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 18:47:03,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:03,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:03,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:03,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:03,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:03,475 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 18:47:03,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:03,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:03,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:03,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:03,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:03,672 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 18:47:03,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:03,821 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 18:47:03,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:03,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 29 [2018-12-03 18:47:03,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:03,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:47:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:47:03,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:47:03,842 INFO L87 Difference]: Start difference. First operand 12706 states and 20489 transitions. Second operand 24 states. [2018-12-03 18:47:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:28,651 INFO L93 Difference]: Finished difference Result 28476 states and 46054 transitions. [2018-12-03 18:47:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:47:28,651 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-03 18:47:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:28,664 INFO L225 Difference]: With dead ends: 28476 [2018-12-03 18:47:28,664 INFO L226 Difference]: Without dead ends: 15810 [2018-12-03 18:47:28,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2203 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1168, Invalid=7574, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:47:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15810 states. [2018-12-03 18:47:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15810 to 13019. [2018-12-03 18:47:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13019 states. [2018-12-03 18:47:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13019 states to 13019 states and 21016 transitions. [2018-12-03 18:47:42,462 INFO L78 Accepts]: Start accepts. Automaton has 13019 states and 21016 transitions. Word has length 31 [2018-12-03 18:47:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:42,462 INFO L480 AbstractCegarLoop]: Abstraction has 13019 states and 21016 transitions. [2018-12-03 18:47:42,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:47:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 13019 states and 21016 transitions. [2018-12-03 18:47:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:47:42,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:42,466 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2018-12-03 18:47:42,467 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:42,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash 537548598, now seen corresponding path program 4 times [2018-12-03 18:47:42,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:42,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:42,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:42,794 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 18:47:42,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:42,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:42,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:42,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:42,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:42,795 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 18:47:42,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:42,803 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:42,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:42,977 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 18:47:42,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:43,107 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 18:47:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 30 [2018-12-03 18:47:43,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:43,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:47:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:47:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:47:43,128 INFO L87 Difference]: Start difference. First operand 13019 states and 21016 transitions. Second operand 25 states. [2018-12-03 18:48:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:03,249 INFO L93 Difference]: Finished difference Result 27255 states and 43926 transitions. [2018-12-03 18:48:03,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:48:03,250 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-12-03 18:48:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:03,263 INFO L225 Difference]: With dead ends: 27255 [2018-12-03 18:48:03,263 INFO L226 Difference]: Without dead ends: 14276 [2018-12-03 18:48:03,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1101, Invalid=4449, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 18:48:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14276 states. [2018-12-03 18:48:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14276 to 12741. [2018-12-03 18:48:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12741 states. [2018-12-03 18:48:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12741 states to 12741 states and 20530 transitions. [2018-12-03 18:48:17,007 INFO L78 Accepts]: Start accepts. Automaton has 12741 states and 20530 transitions. Word has length 31 [2018-12-03 18:48:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:17,007 INFO L480 AbstractCegarLoop]: Abstraction has 12741 states and 20530 transitions. [2018-12-03 18:48:17,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:48:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12741 states and 20530 transitions. [2018-12-03 18:48:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:48:17,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:17,012 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 18:48:17,012 INFO L423 AbstractCegarLoop]: === Iteration 86 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:17,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash 516576961, now seen corresponding path program 4 times [2018-12-03 18:48:17,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:17,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:17,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:48:17,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:17,342 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:17,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:17,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,342 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:17,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:17,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 18:48:17,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 18:48:17,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:17,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 29 [2018-12-03 18:48:17,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:17,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:48:17,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:48:17,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:48:17,761 INFO L87 Difference]: Start difference. First operand 12741 states and 20530 transitions. Second operand 24 states. [2018-12-03 18:48:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:42,008 INFO L93 Difference]: Finished difference Result 26802 states and 43277 transitions. [2018-12-03 18:48:42,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 18:48:42,009 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-03 18:48:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:42,021 INFO L225 Difference]: With dead ends: 26802 [2018-12-03 18:48:42,021 INFO L226 Difference]: Without dead ends: 14117 [2018-12-03 18:48:42,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4549 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2355, Invalid=12651, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 18:48:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14117 states.