java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:27:26,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:27:26,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:27:26,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:27:26,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:27:26,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:27:26,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:27:26,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:27:26,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:27:26,491 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:27:26,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:27:26,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:27:26,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:27:26,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:27:26,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:27:26,503 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:27:26,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:27:26,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:27:26,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:27:26,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:27:26,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:27:26,514 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:27:26,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:27:26,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:27:26,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:27:26,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:27:26,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:27:26,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:27:26,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:27:26,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:27:26,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:27:26,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:27:26,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:27:26,528 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:27:26,530 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:27:26,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:27:26,532 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:27:26,553 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:27:26,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:27:26,556 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:27:26,556 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:27:26,556 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:27:26,556 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:27:26,556 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:27:26,557 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:27:26,557 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:27:26,557 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:27:26,558 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:27:26,558 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:27:26,558 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:27:26,559 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:27:26,559 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:27:26,559 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:27:26,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:27:26,559 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:27:26,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:27:26,561 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:27:26,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:27:26,562 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:27:26,562 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:27:26,562 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:27:26,562 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:27:26,562 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:27:26,563 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:27:26,563 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:27:26,563 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:27:26,563 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:27:26,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:27:26,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:27:26,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:27:26,564 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:27:26,564 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:27:26,564 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:27:26,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:27:26,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:27:26,565 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:27:26,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:27:26,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:27:26,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:27:26,623 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:27:26,624 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:27:26,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-12-03 17:27:26,625 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2018-12-03 17:27:26,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:27:26,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:27:26,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:27:26,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:27:26,667 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:27:26,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:27:26,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:27:26,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:27:26,705 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:27:26,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... [2018-12-03 17:27:26,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:27:26,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:27:26,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:27:26,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:27:26,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:27:26,797 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:27:26,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:27:26,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:27:27,041 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:27:27,041 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:27:27,042 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:27:27 BoogieIcfgContainer [2018-12-03 17:27:27,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:27:27,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:27:27,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:27:27,047 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:27:27,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:27:26" (1/2) ... [2018-12-03 17:27:27,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a965d4d and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:27:27, skipping insertion in model container [2018-12-03 17:27:27,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:27:27" (2/2) ... [2018-12-03 17:27:27,051 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-12-03 17:27:27,062 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:27:27,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:27:27,088 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:27:27,124 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:27:27,124 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:27:27,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:27:27,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:27:27,125 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:27:27,125 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:27:27,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:27:27,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:27:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 17:27:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:27:27,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:27,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:27:27,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:27,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 17:27:27,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:27,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:27,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:27,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:27,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:27:27,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:27,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:27:27,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:27:27,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:27,350 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 17:27:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:27,424 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 17:27:27,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:27:27,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:27:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:27,442 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:27:27,442 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:27:27,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:27:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 17:27:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:27:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 17:27:27,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 17:27:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:27,537 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 17:27:27,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:27:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 17:27:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:27:27,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:27,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:27:27,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:27,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:27,539 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-12-03 17:27:27,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:27,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:27,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:27,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:27,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:27:27,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:27:27,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:27:27,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:27:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:27:27,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:27,616 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-12-03 17:27:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:27,678 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 17:27:27,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:27:27,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 17:27:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:27,679 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:27:27,679 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:27:27,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:27:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:27:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:27:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:27:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 17:27:27,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 17:27:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:27,684 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 17:27:27,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:27:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 17:27:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:27:27,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:27,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 17:27:27,686 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:27,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-12-03 17:27:27,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:27,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:27,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:27,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:27,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:27,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:27,840 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 17:27:27,842 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 17:27:27,904 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:27:27,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:27:28,456 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:27:28,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:27:28,571 INFO L272 AbstractInterpreter]: Visited 6 different actions 60 times. Merged at 5 different actions 30 times. Widened at 3 different actions 17 times. Found 12 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 17:27:28,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:28,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:27:28,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:28,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:28,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:28,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:28,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:28,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:28,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 17:27:28,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:28,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:27:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:27:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:27:28,878 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 17:27:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:28,954 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 17:27:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:27:28,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 17:27:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:28,956 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:27:28,956 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 17:27:28,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:27:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 17:27:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 17:27:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 17:27:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 17:27:28,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 17:27:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:28,961 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 17:27:28,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:27:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 17:27:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:27:28,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:28,963 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 17:27:28,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:28,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:28,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-12-03 17:27:28,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:28,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:28,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:28,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:28,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:27:29,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:29,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:29,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:29,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:29,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:29,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:29,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:29,045 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:29,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:27:29,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:29,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:27:29,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:27:29,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:29,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 17:27:29,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:29,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:27:29,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:27:29,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:27:29,152 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 17:27:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:29,245 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 17:27:29,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:27:29,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 17:27:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:29,246 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:27:29,246 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:27:29,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:27:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:27:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 17:27:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 17:27:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 17:27:29,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-12-03 17:27:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:29,252 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 17:27:29,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:27:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 17:27:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:27:29,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:29,253 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 17:27:29,253 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:29,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2018-12-03 17:27:29,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:29,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:29,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:27:29,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:29,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:29,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:29,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:29,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:29,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:29,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:29,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:29,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:29,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:29,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:27:29,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 17:27:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-03 17:27:29,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:29,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:27:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:27:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:27:29,513 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-12-03 17:27:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:29,583 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 17:27:29,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:27:29,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-03 17:27:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:29,584 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:27:29,584 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 17:27:29,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:27:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 17:27:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 17:27:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:27:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 17:27:29,589 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 17:27:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:29,589 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 17:27:29,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:27:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 17:27:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:27:29,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:29,590 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-12-03 17:27:29,590 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:29,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2018-12-03 17:27:29,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:29,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:29,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 17:27:29,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:29,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:29,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:29,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:29,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:29,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:29,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:29,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:29,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 17:27:29,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 17:27:29,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:29,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 17:27:29,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:29,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:27:29,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:27:29,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:27:29,981 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-12-03 17:27:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:30,028 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-03 17:27:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:27:30,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-03 17:27:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:30,030 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:27:30,030 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 17:27:30,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:27:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 17:27:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 17:27:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:27:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 17:27:30,037 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 17:27:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:30,038 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 17:27:30,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:27:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 17:27:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:27:30,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:30,038 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-12-03 17:27:30,039 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:30,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:30,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2018-12-03 17:27:30,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:30,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:30,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:30,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:30,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 17:27:30,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:30,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:30,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:30,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:30,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:30,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:30,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:30,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 17:27:30,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:30,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 17:27:30,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 17:27:30,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:30,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2018-12-03 17:27:30,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:30,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:27:30,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:27:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:27:30,728 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 10 states. [2018-12-03 17:27:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:31,073 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-12-03 17:27:31,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:27:31,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 17:27:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:31,077 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:27:31,077 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:27:31,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:27:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:27:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-12-03 17:27:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:27:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-03 17:27:31,084 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-12-03 17:27:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:31,084 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-03 17:27:31,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:27:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-03 17:27:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:27:31,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:31,085 INFO L402 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2018-12-03 17:27:31,086 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:31,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash 198739950, now seen corresponding path program 6 times [2018-12-03 17:27:31,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:31,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:31,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 17:27:31,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:31,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:31,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:31,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:31,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:31,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:31,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:31,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:31,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:31,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:31,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 17:27:31,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 17:27:31,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:31,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2018-12-03 17:27:31,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:31,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:27:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:27:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:27:31,676 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2018-12-03 17:27:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:32,163 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-12-03 17:27:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:27:32,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-12-03 17:27:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:32,165 INFO L225 Difference]: With dead ends: 60 [2018-12-03 17:27:32,165 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:27:32,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:27:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:27:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-12-03 17:27:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 17:27:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-03 17:27:32,175 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-12-03 17:27:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:32,176 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-03 17:27:32,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:27:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-03 17:27:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:27:32,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:32,178 INFO L402 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-12-03 17:27:32,178 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:32,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 7 times [2018-12-03 17:27:32,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:32,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:32,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:32,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 17:27:32,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:32,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:32,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:32,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:32,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:32,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:32,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:32,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:32,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 17:27:32,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 17:27:32,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:32,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2018-12-03 17:27:32,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:32,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:27:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:27:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:27:32,523 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-12-03 17:27:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:32,557 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-12-03 17:27:32,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:27:32,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-03 17:27:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:32,560 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:27:32,561 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:27:32,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:27:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:27:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:27:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:27:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-03 17:27:32,569 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-12-03 17:27:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:32,570 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-03 17:27:32,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:27:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-03 17:27:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:27:32,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:32,571 INFO L402 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-12-03 17:27:32,571 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:32,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 8 times [2018-12-03 17:27:32,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:32,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:32,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:32,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:32,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-03 17:27:32,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:32,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:32,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:32,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:32,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:32,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:32,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:32,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:32,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:27:32,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:32,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-03 17:27:32,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-03 17:27:33,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:33,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 17 [2018-12-03 17:27:33,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:33,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:27:33,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:27:33,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:27:33,107 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-12-03 17:27:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:34,363 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-12-03 17:27:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:27:34,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 17:27:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:34,364 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:27:34,365 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:27:34,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1046, Invalid=2146, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:27:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:27:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-12-03 17:27:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:27:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-03 17:27:34,378 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-12-03 17:27:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:34,379 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-03 17:27:34,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:27:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-03 17:27:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:27:34,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:34,380 INFO L402 BasicCegarLoop]: trace histogram [40, 5, 5, 1, 1, 1] [2018-12-03 17:27:34,381 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:34,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:34,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1154943019, now seen corresponding path program 9 times [2018-12-03 17:27:34,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:34,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:34,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:34,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-03 17:27:34,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:34,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:34,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:34,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:34,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:34,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:34,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:34,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:34,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:34,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:34,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-12-03 17:27:34,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-12-03 17:27:35,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:35,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 18 [2018-12-03 17:27:35,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:35,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:27:35,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:27:35,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:27:35,175 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 17 states. [2018-12-03 17:27:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:36,553 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-12-03 17:27:36,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:27:36,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-12-03 17:27:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:36,554 INFO L225 Difference]: With dead ends: 123 [2018-12-03 17:27:36,555 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:27:36,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1605, Invalid=3507, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:27:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:27:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-12-03 17:27:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:27:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-03 17:27:36,570 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-12-03 17:27:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:36,571 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-03 17:27:36,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:27:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-03 17:27:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:27:36,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:36,572 INFO L402 BasicCegarLoop]: trace histogram [54, 6, 6, 1, 1, 1] [2018-12-03 17:27:36,572 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:36,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2076506525, now seen corresponding path program 10 times [2018-12-03 17:27:36,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:36,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:36,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:36,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-03 17:27:36,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:36,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:36,712 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:36,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:36,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:36,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:36,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:36,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:36,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-12-03 17:27:37,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-12-03 17:27:37,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:37,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 19 [2018-12-03 17:27:37,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:37,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:27:37,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:27:37,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:27:37,185 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 19 states. [2018-12-03 17:27:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:39,653 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-12-03 17:27:39,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:27:39,656 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-12-03 17:27:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:39,657 INFO L225 Difference]: With dead ends: 157 [2018-12-03 17:27:39,657 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:27:39,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2580 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2376, Invalid=5456, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 17:27:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:27:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-03 17:27:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:27:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-03 17:27:39,677 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 69 [2018-12-03 17:27:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:39,677 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-03 17:27:39,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:27:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-03 17:27:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:27:39,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:39,679 INFO L402 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-12-03 17:27:39,679 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:39,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:39,679 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 11 times [2018-12-03 17:27:39,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:39,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:39,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:39,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:39,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 17:27:39,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:39,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:39,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:39,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:39,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:39,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:39,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:39,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:40,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:27:40,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:40,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 17:27:40,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 17:27:40,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:40,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:27:40,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:40,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:27:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:27:40,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:27:40,402 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-12-03 17:27:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:40,549 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-03 17:27:40,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:27:40,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-12-03 17:27:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:40,550 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:27:40,551 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:27:40,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:27:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:27:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-12-03 17:27:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:27:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-03 17:27:40,570 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-12-03 17:27:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:40,570 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-03 17:27:40,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:27:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-03 17:27:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:27:40,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:40,572 INFO L402 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-12-03 17:27:40,573 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:40,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 12 times [2018-12-03 17:27:40,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:40,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:40,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:40,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:40,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 17:27:40,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:40,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:40,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:40,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:40,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:40,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:40,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:40,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:40,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:40,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:40,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 17:27:40,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 17:27:41,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:41,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:27:41,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:41,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:27:41,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:27:41,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:27:41,091 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-12-03 17:27:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:41,317 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-12-03 17:27:41,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:27:41,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-03 17:27:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:41,319 INFO L225 Difference]: With dead ends: 125 [2018-12-03 17:27:41,319 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 17:27:41,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:27:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 17:27:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-12-03 17:27:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:27:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-12-03 17:27:41,347 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-12-03 17:27:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:41,348 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-12-03 17:27:41,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:27:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-12-03 17:27:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:27:41,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:41,350 INFO L402 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-12-03 17:27:41,351 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:41,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 13 times [2018-12-03 17:27:41,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:41,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:41,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:41,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:41,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 17:27:41,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:41,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:41,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:41,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:41,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:41,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:41,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:41,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:41,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 17:27:42,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 17:27:42,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:42,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:27:42,276 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:42,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:27:42,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:27:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:27:42,277 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-12-03 17:27:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:42,422 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-03 17:27:42,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:27:42,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-12-03 17:27:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:42,425 INFO L225 Difference]: With dead ends: 137 [2018-12-03 17:27:42,425 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 17:27:42,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:27:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 17:27:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-12-03 17:27:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 17:27:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-12-03 17:27:42,465 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-12-03 17:27:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:42,469 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-12-03 17:27:42,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:27:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-12-03 17:27:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 17:27:42,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:42,476 INFO L402 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-12-03 17:27:42,476 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:42,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 14 times [2018-12-03 17:27:42,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:42,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:42,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:42,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:42,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 17:27:42,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:42,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:42,743 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:42,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:42,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:42,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:42,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:42,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:42,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 17:27:42,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:42,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 17:27:42,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 17:27:43,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:43,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 17:27:43,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:43,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:27:43,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:27:43,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:27:43,626 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-12-03 17:27:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:43,713 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-12-03 17:27:43,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:27:43,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-12-03 17:27:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:43,715 INFO L225 Difference]: With dead ends: 149 [2018-12-03 17:27:43,715 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 17:27:43,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:27:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 17:27:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-12-03 17:27:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 17:27:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-12-03 17:27:43,739 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-12-03 17:27:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:43,740 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-12-03 17:27:43,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:27:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-12-03 17:27:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 17:27:43,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:43,741 INFO L402 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-12-03 17:27:43,742 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:43,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:43,742 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 15 times [2018-12-03 17:27:43,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:43,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:43,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 17:27:44,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:44,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:44,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:44,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:44,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:44,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:44,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:44,078 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:44,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:44,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:44,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 17:27:44,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 17:27:44,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:44,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 17:27:44,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:44,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:27:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:27:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:27:44,494 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-12-03 17:27:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:44,563 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-12-03 17:27:44,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:27:44,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-12-03 17:27:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:44,564 INFO L225 Difference]: With dead ends: 161 [2018-12-03 17:27:44,564 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 17:27:44,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:27:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 17:27:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-12-03 17:27:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 17:27:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-12-03 17:27:44,587 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-12-03 17:27:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:44,587 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-12-03 17:27:44,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:27:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-12-03 17:27:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 17:27:44,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:44,588 INFO L402 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-12-03 17:27:44,589 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:44,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:44,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 16 times [2018-12-03 17:27:44,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:44,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:44,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 17:27:45,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:45,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:45,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:45,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:45,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:45,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:45,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:45,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:45,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 17:27:45,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 17:27:45,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:45,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 17:27:45,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:45,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:27:45,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:27:45,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:27:45,905 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-12-03 17:27:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:46,156 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-12-03 17:27:46,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:27:46,157 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-12-03 17:27:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:46,158 INFO L225 Difference]: With dead ends: 173 [2018-12-03 17:27:46,158 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 17:27:46,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:27:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 17:27:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-12-03 17:27:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 17:27:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-12-03 17:27:46,183 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-12-03 17:27:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:46,183 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-12-03 17:27:46,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:27:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-12-03 17:27:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 17:27:46,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:46,185 INFO L402 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-12-03 17:27:46,185 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:46,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:46,186 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 17 times [2018-12-03 17:27:46,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:46,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:46,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:46,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:46,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 17:27:46,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:46,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:46,489 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:46,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:46,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:46,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:46,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:46,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:46,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 17:27:46,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:46,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 17:27:46,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 17:27:47,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:47,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 17:27:47,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:47,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:27:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:27:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:27:47,307 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-12-03 17:27:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:47,407 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-12-03 17:27:47,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:27:47,407 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-12-03 17:27:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:47,409 INFO L225 Difference]: With dead ends: 185 [2018-12-03 17:27:47,409 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 17:27:47,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:27:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 17:27:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-12-03 17:27:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 17:27:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-12-03 17:27:47,437 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-12-03 17:27:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:47,437 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-12-03 17:27:47,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:27:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-12-03 17:27:47,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 17:27:47,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:47,439 INFO L402 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-12-03 17:27:47,439 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:47,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 18 times [2018-12-03 17:27:47,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:47,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:47,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:47,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:47,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 17:27:47,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:47,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:47,735 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:47,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:47,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:47,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:47,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:47,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:47,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:47,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:47,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 17:27:47,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 17:27:48,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:48,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 17:27:48,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:48,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:27:48,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:27:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:27:48,216 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-12-03 17:27:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:48,317 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-12-03 17:27:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:27:48,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-12-03 17:27:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:48,319 INFO L225 Difference]: With dead ends: 197 [2018-12-03 17:27:48,319 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 17:27:48,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:27:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 17:27:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-12-03 17:27:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 17:27:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-12-03 17:27:48,354 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-12-03 17:27:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:48,354 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-12-03 17:27:48,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:27:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-12-03 17:27:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 17:27:48,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:48,355 INFO L402 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-12-03 17:27:48,355 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:48,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:48,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 19 times [2018-12-03 17:27:48,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:48,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:48,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:48,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:48,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 17:27:49,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:49,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:49,120 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:49,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:49,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:49,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:49,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:49,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:49,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 17:27:49,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 17:27:49,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:49,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 17:27:49,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:49,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:27:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:27:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:27:49,763 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-12-03 17:27:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:49,871 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-12-03 17:27:49,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:27:49,872 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-12-03 17:27:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:49,873 INFO L225 Difference]: With dead ends: 209 [2018-12-03 17:27:49,873 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 17:27:49,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:27:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 17:27:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-12-03 17:27:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 17:27:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-12-03 17:27:49,914 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-12-03 17:27:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:49,914 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-12-03 17:27:49,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:27:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-12-03 17:27:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 17:27:49,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:49,915 INFO L402 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-12-03 17:27:49,916 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:49,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 20 times [2018-12-03 17:27:49,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:49,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:49,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:49,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:49,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 17:27:50,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:50,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:50,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:50,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:50,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:50,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:50,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:50,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:50,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 97 check-sat command(s) [2018-12-03 17:27:50,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:50,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 17:27:50,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 17:27:51,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:51,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 17:27:51,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:51,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:27:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:27:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:27:51,101 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-12-03 17:27:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:51,254 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-12-03 17:27:51,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:27:51,256 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-12-03 17:27:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:51,258 INFO L225 Difference]: With dead ends: 221 [2018-12-03 17:27:51,258 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 17:27:51,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:27:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 17:27:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-12-03 17:27:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 17:27:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-12-03 17:27:51,299 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-12-03 17:27:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:51,300 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-12-03 17:27:51,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:27:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-12-03 17:27:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 17:27:51,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:51,301 INFO L402 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-12-03 17:27:51,301 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:51,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 21 times [2018-12-03 17:27:51,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:51,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:51,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 17:27:51,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:51,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:51,634 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:51,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:51,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:51,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:51,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:51,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:51,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:51,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:51,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 17:27:51,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 17:27:52,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:52,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 17:27:52,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:52,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:27:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:27:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:27:52,460 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-12-03 17:27:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:52,602 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-12-03 17:27:52,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:27:52,603 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-12-03 17:27:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:52,604 INFO L225 Difference]: With dead ends: 233 [2018-12-03 17:27:52,604 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 17:27:52,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:27:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 17:27:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-12-03 17:27:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 17:27:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-12-03 17:27:52,652 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-12-03 17:27:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:52,652 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-12-03 17:27:52,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:27:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-12-03 17:27:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 17:27:52,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:52,653 INFO L402 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-12-03 17:27:52,653 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:52,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:52,653 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 22 times [2018-12-03 17:27:52,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:52,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:52,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:52,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:52,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 17:27:53,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:53,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:53,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:53,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:53,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:53,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:53,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:53,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:53,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 17:27:53,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 17:27:54,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:54,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 17:27:54,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:54,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:27:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:27:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:27:54,223 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-12-03 17:27:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:54,373 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-12-03 17:27:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:27:54,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-12-03 17:27:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:54,375 INFO L225 Difference]: With dead ends: 245 [2018-12-03 17:27:54,375 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 17:27:54,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:27:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 17:27:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-12-03 17:27:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-03 17:27:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-12-03 17:27:54,431 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-12-03 17:27:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:54,432 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-12-03 17:27:54,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:27:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-12-03 17:27:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-03 17:27:54,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:54,434 INFO L402 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-12-03 17:27:54,434 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:54,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:54,434 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 23 times [2018-12-03 17:27:54,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:54,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 17:27:54,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:54,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:54,901 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:54,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:54,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:54,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:54,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:54,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:55,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 110 check-sat command(s) [2018-12-03 17:27:55,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:55,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 17:27:55,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 17:27:55,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:55,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 17:27:55,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:55,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:27:55,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:27:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:27:55,777 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-12-03 17:27:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:56,060 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-12-03 17:27:56,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:27:56,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-12-03 17:27:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:56,062 INFO L225 Difference]: With dead ends: 257 [2018-12-03 17:27:56,062 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 17:27:56,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:27:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 17:27:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-12-03 17:27:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-03 17:27:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-12-03 17:27:56,150 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-12-03 17:27:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:56,151 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-12-03 17:27:56,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:27:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-12-03 17:27:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-03 17:27:56,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:56,152 INFO L402 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-12-03 17:27:56,153 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:56,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 24 times [2018-12-03 17:27:56,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:56,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:56,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 17:27:57,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:57,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:57,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:57,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:57,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:57,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:57,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:57,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:57,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:57,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:57,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 17:27:57,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 17:27:58,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:58,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 17:27:58,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:58,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:27:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:27:58,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:27:58,187 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-12-03 17:27:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:58,343 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-12-03 17:27:58,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:27:58,343 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-12-03 17:27:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:58,345 INFO L225 Difference]: With dead ends: 269 [2018-12-03 17:27:58,345 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 17:27:58,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:27:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 17:27:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-12-03 17:27:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-03 17:27:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-12-03 17:27:58,408 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-12-03 17:27:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:58,408 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-12-03 17:27:58,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:27:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-12-03 17:27:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-03 17:27:58,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:58,410 INFO L402 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-12-03 17:27:58,410 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:58,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 25 times [2018-12-03 17:27:58,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:58,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:58,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 17:27:58,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:58,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:58,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:58,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:58,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:58,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:27:58,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:58,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:59,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 17:27:59,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 17:27:59,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 17:27:59,823 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:59,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:27:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:27:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:27:59,825 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-12-03 17:28:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:00,076 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-12-03 17:28:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:28:00,077 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-12-03 17:28:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:00,078 INFO L225 Difference]: With dead ends: 281 [2018-12-03 17:28:00,078 INFO L226 Difference]: Without dead ends: 279 [2018-12-03 17:28:00,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:28:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-03 17:28:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-12-03 17:28:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 17:28:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-12-03 17:28:00,142 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-12-03 17:28:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:00,142 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-12-03 17:28:00,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:28:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-12-03 17:28:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-12-03 17:28:00,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:00,144 INFO L402 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-12-03 17:28:00,144 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:00,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 26 times [2018-12-03 17:28:00,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:00,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:00,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:00,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:00,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 17:28:02,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:02,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:02,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:02,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:02,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:02,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:02,427 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:02,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 133 check-sat command(s) [2018-12-03 17:28:02,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:02,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 17:28:02,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 17:28:04,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:04,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 17:28:04,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:04,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:28:04,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:28:04,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:28:04,703 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-12-03 17:28:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:04,924 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-12-03 17:28:04,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:28:04,924 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-12-03 17:28:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:04,927 INFO L225 Difference]: With dead ends: 293 [2018-12-03 17:28:04,927 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 17:28:04,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:28:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 17:28:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-12-03 17:28:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 17:28:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-12-03 17:28:05,048 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-12-03 17:28:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:05,049 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-12-03 17:28:05,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:28:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-12-03 17:28:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-03 17:28:05,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:05,051 INFO L402 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-12-03 17:28:05,051 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:05,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:05,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 27 times [2018-12-03 17:28:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:05,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:05,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:05,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 17:28:05,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:05,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:05,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:05,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 17:28:05,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:05,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:05,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:05,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:06,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:06,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:06,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 17:28:06,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 17:28:07,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:07,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 17:28:07,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:07,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:28:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:28:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:28:07,083 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-12-03 17:28:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:07,292 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-12-03 17:28:07,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:28:07,292 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-12-03 17:28:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:07,294 INFO L225 Difference]: With dead ends: 305 [2018-12-03 17:28:07,294 INFO L226 Difference]: Without dead ends: 303 [2018-12-03 17:28:07,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:28:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-03 17:28:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-12-03 17:28:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-03 17:28:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-12-03 17:28:07,369 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-12-03 17:28:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:07,369 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-12-03 17:28:07,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:28:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-12-03 17:28:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-03 17:28:07,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:07,371 INFO L402 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-12-03 17:28:07,371 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:07,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 28 times [2018-12-03 17:28:07,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:07,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:07,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 17:28:08,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:08,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:08,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:08,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:08,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:08,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:08,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:08,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:08,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 17:28:08,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 17:28:10,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:10,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 17:28:10,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:10,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:28:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:28:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:28:10,413 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-12-03 17:28:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:10,618 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-12-03 17:28:10,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:28:10,619 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-12-03 17:28:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:10,620 INFO L225 Difference]: With dead ends: 317 [2018-12-03 17:28:10,620 INFO L226 Difference]: Without dead ends: 315 [2018-12-03 17:28:10,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:28:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-03 17:28:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-12-03 17:28:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-03 17:28:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-12-03 17:28:10,745 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-12-03 17:28:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:10,745 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-12-03 17:28:10,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:28:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-12-03 17:28:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-03 17:28:10,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:10,748 INFO L402 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-12-03 17:28:10,748 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:10,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 29 times [2018-12-03 17:28:10,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 17:28:11,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:11,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:11,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:11,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:11,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:11,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:11,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:11,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:12,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 146 check-sat command(s) [2018-12-03 17:28:12,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:12,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 17:28:12,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 17:28:13,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:13,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 17:28:13,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:13,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:28:13,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:28:13,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:28:13,211 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-12-03 17:28:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:13,442 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-12-03 17:28:13,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:28:13,442 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-12-03 17:28:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:13,444 INFO L225 Difference]: With dead ends: 329 [2018-12-03 17:28:13,444 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 17:28:13,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:28:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 17:28:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-12-03 17:28:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-03 17:28:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-12-03 17:28:13,552 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-12-03 17:28:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:13,553 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-12-03 17:28:13,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:28:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-12-03 17:28:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-12-03 17:28:13,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:13,555 INFO L402 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-12-03 17:28:13,555 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:13,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 30 times [2018-12-03 17:28:13,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:13,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:13,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:13,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:13,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 17:28:15,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:15,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:15,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:15,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:15,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:15,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:15,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:15,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:15,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:15,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:15,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 17:28:15,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 17:28:16,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:16,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 17:28:16,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:16,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:28:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:28:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:28:16,234 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-12-03 17:28:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:16,477 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-12-03 17:28:16,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:28:16,477 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-12-03 17:28:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:16,479 INFO L225 Difference]: With dead ends: 341 [2018-12-03 17:28:16,479 INFO L226 Difference]: Without dead ends: 339 [2018-12-03 17:28:16,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:28:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-03 17:28:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-12-03 17:28:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-03 17:28:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-12-03 17:28:16,582 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-12-03 17:28:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:16,582 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-12-03 17:28:16,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:28:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-12-03 17:28:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-12-03 17:28:16,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:16,584 INFO L402 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-12-03 17:28:16,584 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:16,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:16,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 31 times [2018-12-03 17:28:16,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:16,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:16,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:16,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:16,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 17:28:17,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:17,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:17,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:17,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:17,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:17,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:17,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:18,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 17:28:18,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 17:28:19,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:19,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 17:28:19,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:19,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:28:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:28:19,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:28:19,207 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-12-03 17:28:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:19,491 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-12-03 17:28:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:28:19,492 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-12-03 17:28:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:19,493 INFO L225 Difference]: With dead ends: 353 [2018-12-03 17:28:19,493 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 17:28:19,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:28:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 17:28:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-12-03 17:28:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-03 17:28:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-12-03 17:28:19,610 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-12-03 17:28:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:19,610 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-12-03 17:28:19,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:28:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-12-03 17:28:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-03 17:28:19,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:19,612 INFO L402 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-12-03 17:28:19,612 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:19,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 32 times [2018-12-03 17:28:19,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:19,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:19,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:19,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:19,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 17:28:20,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:20,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:20,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:20,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:20,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:20,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:20,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:20,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:20,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 169 check-sat command(s) [2018-12-03 17:28:20,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:20,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 17:28:20,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 17:28:21,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:21,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 17:28:21,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:21,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:28:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:28:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:28:21,842 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-12-03 17:28:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:22,114 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-12-03 17:28:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:28:22,114 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-12-03 17:28:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:22,116 INFO L225 Difference]: With dead ends: 365 [2018-12-03 17:28:22,116 INFO L226 Difference]: Without dead ends: 363 [2018-12-03 17:28:22,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:28:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-03 17:28:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-12-03 17:28:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-03 17:28:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-12-03 17:28:22,251 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-12-03 17:28:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:22,252 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-12-03 17:28:22,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:28:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-12-03 17:28:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-12-03 17:28:22,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:22,255 INFO L402 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-12-03 17:28:22,255 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:22,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:22,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 33 times [2018-12-03 17:28:22,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:22,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:22,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:22,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:22,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 17:28:23,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:23,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:23,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:23,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:23,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:23,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:23,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:23,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:23,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:23,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:23,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 17:28:23,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 17:28:24,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:24,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 17:28:24,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:24,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:28:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:28:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:28:24,607 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-12-03 17:28:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:24,905 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-12-03 17:28:24,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:28:24,905 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-12-03 17:28:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:24,907 INFO L225 Difference]: With dead ends: 377 [2018-12-03 17:28:24,907 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 17:28:24,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:28:24,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 17:28:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-12-03 17:28:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 17:28:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-12-03 17:28:25,063 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-12-03 17:28:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:25,063 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-12-03 17:28:25,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:28:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-12-03 17:28:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-12-03 17:28:25,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:25,066 INFO L402 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-12-03 17:28:25,066 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:25,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 34 times [2018-12-03 17:28:25,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:25,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:25,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:25,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:25,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 17:28:25,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:25,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:25,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:25,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:25,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:25,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:25,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:25,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:26,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 17:28:26,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 17:28:28,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:28,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 17:28:28,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:28,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:28:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:28:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:28:28,252 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-12-03 17:28:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:28,558 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-12-03 17:28:28,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:28:28,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-12-03 17:28:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:28,562 INFO L225 Difference]: With dead ends: 389 [2018-12-03 17:28:28,562 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 17:28:28,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:28:28,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 17:28:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-12-03 17:28:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-03 17:28:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-12-03 17:28:28,675 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-12-03 17:28:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:28,676 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-12-03 17:28:28,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:28:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-12-03 17:28:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-03 17:28:28,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:28,679 INFO L402 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-12-03 17:28:28,679 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:28,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 35 times [2018-12-03 17:28:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:28,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:28,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 17:28:29,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:29,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:29,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:29,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:29,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:29,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:29,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:29,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:30,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 182 check-sat command(s) [2018-12-03 17:28:30,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:30,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 17:28:30,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 17:28:31,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:31,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 17:28:31,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:31,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:28:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:28:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:28:31,756 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-12-03 17:28:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:32,111 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-12-03 17:28:32,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:28:32,112 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-12-03 17:28:32,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:32,114 INFO L225 Difference]: With dead ends: 401 [2018-12-03 17:28:32,114 INFO L226 Difference]: Without dead ends: 399 [2018-12-03 17:28:32,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:28:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-03 17:28:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-12-03 17:28:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-12-03 17:28:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-12-03 17:28:32,247 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-12-03 17:28:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:32,247 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-12-03 17:28:32,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:28:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-12-03 17:28:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-12-03 17:28:32,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:32,250 INFO L402 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-12-03 17:28:32,251 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:32,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 36 times [2018-12-03 17:28:32,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:32,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:32,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 17:28:33,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:33,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:33,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:33,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:33,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:33,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:33,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:33,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:33,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:33,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:33,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 17:28:33,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 17:28:34,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:34,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 17:28:34,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:34,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:28:34,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:28:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:28:34,982 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-12-03 17:28:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:35,295 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-12-03 17:28:35,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:28:35,296 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-12-03 17:28:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:35,297 INFO L225 Difference]: With dead ends: 413 [2018-12-03 17:28:35,297 INFO L226 Difference]: Without dead ends: 411 [2018-12-03 17:28:35,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:28:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-03 17:28:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-12-03 17:28:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-03 17:28:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-12-03 17:28:35,440 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-12-03 17:28:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:35,441 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-12-03 17:28:35,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:28:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-12-03 17:28:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-12-03 17:28:35,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:35,443 INFO L402 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-12-03 17:28:35,443 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:35,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 37 times [2018-12-03 17:28:35,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:35,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:35,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 17:28:36,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:36,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:36,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:36,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:36,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:36,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:36,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:36,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:36,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 17:28:36,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 17:28:38,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:38,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 17:28:38,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:38,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:28:38,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:28:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:28:38,534 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-12-03 17:28:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:38,848 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-12-03 17:28:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:28:38,848 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-12-03 17:28:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:38,850 INFO L225 Difference]: With dead ends: 425 [2018-12-03 17:28:38,850 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 17:28:38,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:28:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 17:28:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-12-03 17:28:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-03 17:28:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-12-03 17:28:39,001 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-12-03 17:28:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:39,001 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-12-03 17:28:39,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:28:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-12-03 17:28:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-12-03 17:28:39,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:39,003 INFO L402 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-12-03 17:28:39,003 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:39,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 38 times [2018-12-03 17:28:39,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:39,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:39,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 17:28:40,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:40,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:40,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:40,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:40,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:40,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:40,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:40,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:40,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 205 check-sat command(s) [2018-12-03 17:28:40,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:40,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 17:28:40,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 17:28:42,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:42,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 17:28:42,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:42,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:28:42,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:28:42,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:28:42,407 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-12-03 17:28:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:42,744 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-12-03 17:28:42,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:28:42,744 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-12-03 17:28:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:42,746 INFO L225 Difference]: With dead ends: 437 [2018-12-03 17:28:42,746 INFO L226 Difference]: Without dead ends: 435 [2018-12-03 17:28:42,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:28:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-03 17:28:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-12-03 17:28:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-03 17:28:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-12-03 17:28:42,904 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-12-03 17:28:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:42,905 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-12-03 17:28:42,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:28:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-12-03 17:28:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-12-03 17:28:42,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:42,907 INFO L402 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-12-03 17:28:42,907 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:42,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 39 times [2018-12-03 17:28:42,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:42,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:42,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 17:28:45,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:45,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:45,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:45,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:45,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:45,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:45,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:45,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:45,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:45,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:45,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 17:28:45,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 17:28:47,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:47,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 17:28:47,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:47,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:28:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:28:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:28:47,161 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-12-03 17:28:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:47,511 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-12-03 17:28:47,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:28:47,511 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-12-03 17:28:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:47,513 INFO L225 Difference]: With dead ends: 449 [2018-12-03 17:28:47,513 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 17:28:47,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:28:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 17:28:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-12-03 17:28:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-12-03 17:28:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-12-03 17:28:47,682 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-12-03 17:28:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:47,683 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-12-03 17:28:47,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:28:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-12-03 17:28:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-12-03 17:28:47,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:47,685 INFO L402 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-12-03 17:28:47,685 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:47,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 40 times [2018-12-03 17:28:47,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:47,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:47,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:47,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:47,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 17:28:48,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:48,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:48,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:48,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:48,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:48,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:48,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:48,835 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:49,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 17:28:49,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 17:28:51,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:51,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 17:28:51,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:51,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:28:51,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:28:51,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:28:51,174 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-12-03 17:28:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:51,528 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-12-03 17:28:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:28:51,528 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-12-03 17:28:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:51,530 INFO L225 Difference]: With dead ends: 461 [2018-12-03 17:28:51,530 INFO L226 Difference]: Without dead ends: 459 [2018-12-03 17:28:51,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:28:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-03 17:28:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-12-03 17:28:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-03 17:28:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-12-03 17:28:51,796 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-12-03 17:28:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:51,796 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-12-03 17:28:51,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:28:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-12-03 17:28:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-12-03 17:28:51,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:51,798 INFO L402 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-12-03 17:28:51,798 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:51,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 41 times [2018-12-03 17:28:51,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:51,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:51,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:51,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 17:28:53,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:53,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:53,329 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:53,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:53,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:53,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:53,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:53,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:54,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 218 check-sat command(s) [2018-12-03 17:28:54,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:54,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 17:28:54,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 17:28:56,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:56,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 17:28:56,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:56,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:28:56,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:28:56,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:28:56,007 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-12-03 17:28:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:56,424 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-12-03 17:28:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:28:56,425 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-12-03 17:28:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:56,426 INFO L225 Difference]: With dead ends: 473 [2018-12-03 17:28:56,426 INFO L226 Difference]: Without dead ends: 471 [2018-12-03 17:28:56,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:28:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-12-03 17:28:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-12-03 17:28:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 17:28:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-12-03 17:28:56,616 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-12-03 17:28:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:56,616 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-12-03 17:28:56,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:28:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-12-03 17:28:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-12-03 17:28:56,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:56,619 INFO L402 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-12-03 17:28:56,619 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:56,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:56,619 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 42 times [2018-12-03 17:28:56,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:56,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:56,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 17:28:57,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:57,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:57,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:57,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:57,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:57,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:28:57,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:57,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:57,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:57,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:57,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 17:28:58,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 17:29:00,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:00,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 17:29:00,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:00,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:29:00,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:29:00,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:29:00,381 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-12-03 17:29:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:00,786 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-12-03 17:29:00,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:29:00,786 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-12-03 17:29:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:00,788 INFO L225 Difference]: With dead ends: 485 [2018-12-03 17:29:00,788 INFO L226 Difference]: Without dead ends: 483 [2018-12-03 17:29:00,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:29:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-03 17:29:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-12-03 17:29:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-12-03 17:29:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-12-03 17:29:00,999 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-12-03 17:29:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:01,000 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-12-03 17:29:01,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:29:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-12-03 17:29:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-12-03 17:29:01,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:01,002 INFO L402 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-12-03 17:29:01,002 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:01,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 43 times [2018-12-03 17:29:01,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:01,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:01,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 17:29:01,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:01,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:01,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:01,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:01,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:01,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:01,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:01,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:02,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 17:29:02,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 17:29:04,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:04,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 17:29:04,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:04,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:29:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:29:04,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:29:04,545 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-12-03 17:29:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:05,138 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-12-03 17:29:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:29:05,139 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-12-03 17:29:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:05,140 INFO L225 Difference]: With dead ends: 497 [2018-12-03 17:29:05,140 INFO L226 Difference]: Without dead ends: 495 [2018-12-03 17:29:05,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:29:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-12-03 17:29:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-12-03 17:29:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-12-03 17:29:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-12-03 17:29:05,346 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-12-03 17:29:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:05,347 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-12-03 17:29:05,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:29:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-12-03 17:29:05,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-12-03 17:29:05,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:05,349 INFO L402 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-12-03 17:29:05,349 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:05,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:05,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 44 times [2018-12-03 17:29:05,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:05,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:05,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 17:29:06,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:06,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:06,249 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:06,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:06,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:06,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:06,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:06,258 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:07,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 241 check-sat command(s) [2018-12-03 17:29:07,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:07,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 17:29:07,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 17:29:09,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:09,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 17:29:09,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:09,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:29:09,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:29:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:29:09,609 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-12-03 17:29:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:10,055 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-12-03 17:29:10,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:29:10,056 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-12-03 17:29:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:10,058 INFO L225 Difference]: With dead ends: 509 [2018-12-03 17:29:10,058 INFO L226 Difference]: Without dead ends: 507 [2018-12-03 17:29:10,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:29:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-12-03 17:29:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-12-03 17:29:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-12-03 17:29:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-12-03 17:29:10,314 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-12-03 17:29:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:10,315 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-12-03 17:29:10,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:29:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-12-03 17:29:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-12-03 17:29:10,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:10,318 INFO L402 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-12-03 17:29:10,318 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:10,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 45 times [2018-12-03 17:29:10,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:10,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:10,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 17:29:11,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:11,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:11,305 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:11,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:11,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:11,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:11,315 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:11,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:11,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:11,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:11,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 17:29:11,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 17:29:14,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:14,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 17:29:14,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:14,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:29:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:29:14,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:29:14,150 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-12-03 17:29:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:14,615 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-12-03 17:29:14,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:29:14,615 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-12-03 17:29:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:14,617 INFO L225 Difference]: With dead ends: 521 [2018-12-03 17:29:14,617 INFO L226 Difference]: Without dead ends: 519 [2018-12-03 17:29:14,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 947 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:29:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-12-03 17:29:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-12-03 17:29:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-12-03 17:29:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-12-03 17:29:14,843 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-12-03 17:29:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:14,844 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-12-03 17:29:14,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:29:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-12-03 17:29:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-12-03 17:29:14,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:14,846 INFO L402 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-12-03 17:29:14,846 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:14,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:14,846 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 46 times [2018-12-03 17:29:14,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:14,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:14,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 17:29:15,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:15,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:15,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:15,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:15,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:15,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:15,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:15,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:16,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 17:29:16,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 17:29:18,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:18,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 17:29:18,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:18,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:29:18,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:29:18,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:29:18,471 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-12-03 17:29:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:19,470 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-12-03 17:29:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:29:19,470 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-12-03 17:29:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:19,473 INFO L225 Difference]: With dead ends: 533 [2018-12-03 17:29:19,473 INFO L226 Difference]: Without dead ends: 531 [2018-12-03 17:29:19,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 970 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:29:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-03 17:29:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-12-03 17:29:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 17:29:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-12-03 17:29:19,838 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-12-03 17:29:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:19,838 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-12-03 17:29:19,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:29:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-12-03 17:29:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-12-03 17:29:19,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:19,841 INFO L402 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-12-03 17:29:19,841 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:19,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 47 times [2018-12-03 17:29:19,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:19,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:19,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 17:29:20,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:20,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:20,953 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:20,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:20,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:20,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:20,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:20,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:21,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 254 check-sat command(s) [2018-12-03 17:29:21,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:21,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 17:29:22,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 17:29:24,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:24,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 17:29:24,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:24,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:29:24,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:29:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:29:24,730 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-12-03 17:29:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:25,375 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-12-03 17:29:25,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:29:25,383 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-12-03 17:29:25,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:25,385 INFO L225 Difference]: With dead ends: 545 [2018-12-03 17:29:25,386 INFO L226 Difference]: Without dead ends: 543 [2018-12-03 17:29:25,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 993 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:29:25,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-03 17:29:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-12-03 17:29:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-12-03 17:29:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-12-03 17:29:25,694 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-12-03 17:29:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:25,695 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-12-03 17:29:25,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:29:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-12-03 17:29:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-12-03 17:29:25,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:25,697 INFO L402 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-12-03 17:29:25,697 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:25,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 48 times [2018-12-03 17:29:25,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:25,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:25,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 17:29:26,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:26,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:26,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:26,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:26,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:26,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:26,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:26,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:27,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:27,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:27,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 17:29:27,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 17:29:29,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:29,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 17:29:29,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:29,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:29:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:29:29,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:29:29,925 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-12-03 17:29:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:30,596 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-12-03 17:29:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:29:30,596 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-12-03 17:29:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:30,598 INFO L225 Difference]: With dead ends: 557 [2018-12-03 17:29:30,598 INFO L226 Difference]: Without dead ends: 555 [2018-12-03 17:29:30,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:29:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-12-03 17:29:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-12-03 17:29:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-03 17:29:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-12-03 17:29:30,885 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-12-03 17:29:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:30,885 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-12-03 17:29:30,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:29:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-12-03 17:29:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-12-03 17:29:30,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:30,888 INFO L402 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-12-03 17:29:30,888 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:30,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 49 times [2018-12-03 17:29:30,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:30,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:30,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:30,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:30,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 17:29:32,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:32,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:32,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:32,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:32,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:32,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:32,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:32,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:32,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 17:29:32,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 17:29:35,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:35,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 17:29:35,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:35,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:29:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:29:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:29:35,230 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-12-03 17:29:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:35,861 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-12-03 17:29:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:29:35,861 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-12-03 17:29:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:35,864 INFO L225 Difference]: With dead ends: 569 [2018-12-03 17:29:35,864 INFO L226 Difference]: Without dead ends: 567 [2018-12-03 17:29:35,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:29:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-12-03 17:29:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-12-03 17:29:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-03 17:29:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-12-03 17:29:36,126 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-12-03 17:29:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:36,126 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-12-03 17:29:36,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:29:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-12-03 17:29:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-12-03 17:29:36,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:36,130 INFO L402 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-12-03 17:29:36,130 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:36,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:36,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 50 times [2018-12-03 17:29:36,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:36,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:36,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:36,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:36,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 17:29:37,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:37,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:37,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:37,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:37,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:37,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:37,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:37,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:38,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 277 check-sat command(s) [2018-12-03 17:29:38,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:38,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 17:29:38,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 17:29:41,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:41,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 17:29:41,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:41,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:29:41,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:29:41,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:29:41,522 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-12-03 17:29:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:42,084 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-12-03 17:29:42,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:29:42,084 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-12-03 17:29:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:42,086 INFO L225 Difference]: With dead ends: 581 [2018-12-03 17:29:42,086 INFO L226 Difference]: Without dead ends: 579 [2018-12-03 17:29:42,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:29:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-03 17:29:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-12-03 17:29:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-03 17:29:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-12-03 17:29:42,368 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-12-03 17:29:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:42,369 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-12-03 17:29:42,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:29:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-12-03 17:29:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-12-03 17:29:42,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:42,372 INFO L402 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-12-03 17:29:42,372 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:42,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 51 times [2018-12-03 17:29:42,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:42,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:42,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 17:29:43,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:43,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:43,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:43,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:43,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:43,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:43,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:43,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:44,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:44,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:44,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 17:29:44,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 17:29:47,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:47,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 17:29:47,224 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:47,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:29:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:29:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:29:47,226 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-12-03 17:29:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:47,816 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-12-03 17:29:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:29:47,817 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-12-03 17:29:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:47,819 INFO L225 Difference]: With dead ends: 593 [2018-12-03 17:29:47,819 INFO L226 Difference]: Without dead ends: 591 [2018-12-03 17:29:47,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1181 GetRequests, 1085 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:29:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-12-03 17:29:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-12-03 17:29:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-03 17:29:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-12-03 17:29:48,105 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-12-03 17:29:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:48,105 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-12-03 17:29:48,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:29:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-12-03 17:29:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-12-03 17:29:48,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:48,108 INFO L402 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-12-03 17:29:48,108 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:48,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:48,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 52 times [2018-12-03 17:29:48,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:48,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:48,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:48,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:48,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 17:29:49,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:49,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:49,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:49,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:49,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:49,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:49,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:49,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:49,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 17:29:50,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 17:29:53,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:53,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 17:29:53,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:53,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:29:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:29:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:29:53,164 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-12-03 17:29:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:53,799 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-12-03 17:29:53,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:29:53,799 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-12-03 17:29:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:53,801 INFO L225 Difference]: With dead ends: 605 [2018-12-03 17:29:53,802 INFO L226 Difference]: Without dead ends: 603 [2018-12-03 17:29:53,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1108 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:29:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-12-03 17:29:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-12-03 17:29:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-03 17:29:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-12-03 17:29:54,101 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-12-03 17:29:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:54,102 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-12-03 17:29:54,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:29:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-12-03 17:29:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-12-03 17:29:54,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:54,104 INFO L402 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-12-03 17:29:54,105 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:54,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 53 times [2018-12-03 17:29:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:54,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:54,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 17:29:55,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:55,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:55,691 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:55,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:55,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:55,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:55,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:55,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:56,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 290 check-sat command(s) [2018-12-03 17:29:56,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:56,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 17:29:57,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 17:30:00,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:00,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 17:30:00,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:00,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:30:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:30:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:30:00,307 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-12-03 17:30:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:00,969 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-12-03 17:30:00,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:30:00,969 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-12-03 17:30:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:00,971 INFO L225 Difference]: With dead ends: 617 [2018-12-03 17:30:00,971 INFO L226 Difference]: Without dead ends: 615 [2018-12-03 17:30:00,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1231 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:30:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-12-03 17:30:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-12-03 17:30:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-03 17:30:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-12-03 17:30:01,282 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-12-03 17:30:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:01,282 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-12-03 17:30:01,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:30:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-12-03 17:30:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-12-03 17:30:01,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:01,285 INFO L402 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-12-03 17:30:01,285 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:01,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:01,285 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 54 times [2018-12-03 17:30:01,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:01,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:01,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:01,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:01,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 17:30:02,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:02,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:02,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:02,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:02,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:02,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:02,690 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:03,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:03,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:03,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 17:30:03,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 17:30:06,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:06,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 17:30:06,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:06,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:30:06,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:30:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:30:06,542 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-12-03 17:30:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:07,206 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-12-03 17:30:07,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:30:07,207 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-12-03 17:30:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:07,209 INFO L225 Difference]: With dead ends: 629 [2018-12-03 17:30:07,209 INFO L226 Difference]: Without dead ends: 627 [2018-12-03 17:30:07,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1256 GetRequests, 1154 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:30:07,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-12-03 17:30:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-12-03 17:30:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-03 17:30:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-12-03 17:30:07,534 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-12-03 17:30:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:07,534 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-12-03 17:30:07,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:30:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-12-03 17:30:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-12-03 17:30:07,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:07,537 INFO L402 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-12-03 17:30:07,537 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:07,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 55 times [2018-12-03 17:30:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:07,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:07,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:07,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:07,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 17:30:08,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:08,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:08,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:08,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:08,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:08,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:08,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:08,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:09,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 17:30:09,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 17:30:13,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:13,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 17:30:13,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:13,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:30:13,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:30:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:30:13,006 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-12-03 17:30:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:13,726 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-12-03 17:30:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:30:13,726 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-12-03 17:30:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:13,728 INFO L225 Difference]: With dead ends: 641 [2018-12-03 17:30:13,729 INFO L226 Difference]: Without dead ends: 639 [2018-12-03 17:30:13,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1281 GetRequests, 1177 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:30:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-03 17:30:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-12-03 17:30:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-12-03 17:30:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-12-03 17:30:14,068 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-12-03 17:30:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:14,068 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-12-03 17:30:14,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:30:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-12-03 17:30:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-12-03 17:30:14,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:14,071 INFO L402 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-12-03 17:30:14,071 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:14,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 56 times [2018-12-03 17:30:14,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:14,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:14,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 17:30:15,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:15,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:15,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:15,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:15,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:15,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:15,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:15,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:17,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 313 check-sat command(s) [2018-12-03 17:30:17,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:17,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 17:30:17,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 17:30:21,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:21,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 17:30:21,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:21,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:30:21,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:30:21,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:30:21,180 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-12-03 17:30:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:21,833 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-12-03 17:30:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:30:21,833 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-12-03 17:30:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:21,835 INFO L225 Difference]: With dead ends: 653 [2018-12-03 17:30:21,835 INFO L226 Difference]: Without dead ends: 651 [2018-12-03 17:30:21,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1306 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:30:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-12-03 17:30:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-12-03 17:30:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-12-03 17:30:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-12-03 17:30:22,200 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-12-03 17:30:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:22,201 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-12-03 17:30:22,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:30:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-12-03 17:30:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-12-03 17:30:22,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:22,204 INFO L402 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-12-03 17:30:22,204 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:22,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 57 times [2018-12-03 17:30:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:22,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:22,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 17:30:23,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:23,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:23,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:23,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:23,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:23,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:23,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:23,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:24,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:24,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:24,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 17:30:24,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 17:30:28,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:28,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 17:30:28,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:28,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:30:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:30:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:30:28,051 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-12-03 17:30:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:28,837 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-12-03 17:30:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:30:28,837 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-12-03 17:30:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:28,839 INFO L225 Difference]: With dead ends: 665 [2018-12-03 17:30:28,839 INFO L226 Difference]: Without dead ends: 663 [2018-12-03 17:30:28,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1331 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:30:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-12-03 17:30:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-12-03 17:30:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-03 17:30:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-12-03 17:30:29,214 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-12-03 17:30:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:29,214 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-12-03 17:30:29,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:30:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-12-03 17:30:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-12-03 17:30:29,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:29,217 INFO L402 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-12-03 17:30:29,218 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:29,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:29,218 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 58 times [2018-12-03 17:30:29,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:29,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:29,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:29,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 17:30:31,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:31,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:31,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:31,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:31,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:31,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:31,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:31,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:31,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 17:30:31,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 17:30:35,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:35,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 17:30:35,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:35,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:30:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:30:35,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:30:35,326 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-12-03 17:30:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:36,086 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-12-03 17:30:36,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:30:36,086 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-12-03 17:30:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:36,088 INFO L225 Difference]: With dead ends: 677 [2018-12-03 17:30:36,088 INFO L226 Difference]: Without dead ends: 675 [2018-12-03 17:30:36,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 1246 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:30:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-12-03 17:30:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-12-03 17:30:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-12-03 17:30:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-12-03 17:30:36,478 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-12-03 17:30:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:36,478 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-12-03 17:30:36,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:30:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-12-03 17:30:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-12-03 17:30:36,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:36,482 INFO L402 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-12-03 17:30:36,482 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:36,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 59 times [2018-12-03 17:30:36,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:36,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:36,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:36,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:36,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 17:30:39,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:39,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:39,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:39,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:39,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:39,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:39,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:39,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:40,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 326 check-sat command(s) [2018-12-03 17:30:40,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:40,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 17:30:40,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 17:30:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:44,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 17:30:44,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:44,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:30:44,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:30:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:30:44,550 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-12-03 17:30:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:45,328 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-12-03 17:30:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:30:45,328 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-12-03 17:30:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:45,331 INFO L225 Difference]: With dead ends: 689 [2018-12-03 17:30:45,331 INFO L226 Difference]: Without dead ends: 687 [2018-12-03 17:30:45,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1269 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:30:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-12-03 17:30:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-12-03 17:30:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-12-03 17:30:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-12-03 17:30:45,794 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-12-03 17:30:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:45,794 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-12-03 17:30:45,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:30:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-12-03 17:30:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-12-03 17:30:45,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:45,798 INFO L402 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-12-03 17:30:45,798 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:45,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 60 times [2018-12-03 17:30:45,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:45,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:45,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 17:30:47,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:47,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:47,519 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:47,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:47,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:47,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:47,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:47,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:47,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:47,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:47,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 17:30:48,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 17:30:52,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:52,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 17:30:52,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:52,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:30:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:30:52,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:30:52,313 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-12-03 17:30:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:53,173 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-12-03 17:30:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:30:53,174 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-12-03 17:30:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:53,176 INFO L225 Difference]: With dead ends: 701 [2018-12-03 17:30:53,176 INFO L226 Difference]: Without dead ends: 699 [2018-12-03 17:30:53,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1406 GetRequests, 1292 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:30:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-12-03 17:30:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-12-03 17:30:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-12-03 17:30:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-12-03 17:30:53,624 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-12-03 17:30:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:53,624 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-12-03 17:30:53,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:30:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-12-03 17:30:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-12-03 17:30:53,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:53,627 INFO L402 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-12-03 17:30:53,628 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:53,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:53,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 61 times [2018-12-03 17:30:53,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:53,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:53,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:53,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:53,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 17:30:55,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:55,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:55,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:55,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:55,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:55,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:30:55,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:55,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:55,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 17:30:56,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 17:31:00,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:00,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 17:31:00,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:00,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:31:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:31:00,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:31:00,131 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-12-03 17:31:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:01,020 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-12-03 17:31:01,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:31:01,021 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-12-03 17:31:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:01,023 INFO L225 Difference]: With dead ends: 713 [2018-12-03 17:31:01,023 INFO L226 Difference]: Without dead ends: 711 [2018-12-03 17:31:01,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1315 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:31:01,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-12-03 17:31:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-12-03 17:31:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 17:31:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-12-03 17:31:01,491 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-12-03 17:31:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:01,491 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-12-03 17:31:01,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:31:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-12-03 17:31:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-12-03 17:31:01,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:01,494 INFO L402 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-12-03 17:31:01,495 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:01,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:01,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 62 times [2018-12-03 17:31:01,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:01,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:01,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:01,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:01,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 17:31:03,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:03,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:03,187 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:03,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:03,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:03,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:03,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:03,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:04,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 349 check-sat command(s) [2018-12-03 17:31:04,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:04,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 17:31:05,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 17:31:09,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:09,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 17:31:09,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:09,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:31:09,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:31:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:31:09,750 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-12-03 17:31:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:10,536 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-12-03 17:31:10,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:31:10,536 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-12-03 17:31:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:10,539 INFO L225 Difference]: With dead ends: 725 [2018-12-03 17:31:10,539 INFO L226 Difference]: Without dead ends: 723 [2018-12-03 17:31:10,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1456 GetRequests, 1338 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:31:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-03 17:31:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-12-03 17:31:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-12-03 17:31:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-12-03 17:31:11,005 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-12-03 17:31:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:11,006 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-12-03 17:31:11,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:31:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-12-03 17:31:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-12-03 17:31:11,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:11,010 INFO L402 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-12-03 17:31:11,010 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:11,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 63 times [2018-12-03 17:31:11,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:11,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:11,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:11,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 17:31:13,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:13,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:13,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:13,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:13,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:13,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:13,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:13,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:13,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:13,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:13,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 17:31:13,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 17:31:18,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:18,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 17:31:18,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:18,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:31:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:31:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:31:18,215 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-12-03 17:31:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:19,084 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-12-03 17:31:19,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:31:19,084 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-12-03 17:31:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:19,087 INFO L225 Difference]: With dead ends: 737 [2018-12-03 17:31:19,087 INFO L226 Difference]: Without dead ends: 735 [2018-12-03 17:31:19,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1481 GetRequests, 1361 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:31:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-03 17:31:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-12-03 17:31:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-12-03 17:31:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-12-03 17:31:19,565 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-12-03 17:31:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:19,566 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-12-03 17:31:19,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:31:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-12-03 17:31:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-12-03 17:31:19,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:19,570 INFO L402 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-12-03 17:31:19,570 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:19,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:19,570 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 64 times [2018-12-03 17:31:19,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:19,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:19,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:19,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:19,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 17:31:21,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:21,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:21,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:21,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:21,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:21,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:21,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:21,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 17:31:22,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 17:31:26,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:26,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 17:31:26,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:26,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:31:26,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:31:26,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:31:26,515 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-12-03 17:31:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:27,336 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-12-03 17:31:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:31:27,336 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-12-03 17:31:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:27,339 INFO L225 Difference]: With dead ends: 749 [2018-12-03 17:31:27,339 INFO L226 Difference]: Without dead ends: 747 [2018-12-03 17:31:27,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1384 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:31:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-12-03 17:31:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-12-03 17:31:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-03 17:31:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-12-03 17:31:27,843 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-12-03 17:31:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:27,844 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-12-03 17:31:27,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:31:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-12-03 17:31:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-12-03 17:31:27,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:27,847 INFO L402 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-12-03 17:31:27,848 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:27,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:27,848 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 65 times [2018-12-03 17:31:27,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:27,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:27,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:27,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:27,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 17:31:29,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:29,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:29,710 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:29,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:29,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:29,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:29,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:29,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:31,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 362 check-sat command(s) [2018-12-03 17:31:31,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:31,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 17:31:32,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 17:31:36,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:36,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 17:31:36,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:36,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:31:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:31:36,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:31:36,551 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-12-03 17:31:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:37,887 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-12-03 17:31:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:31:37,888 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-12-03 17:31:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:37,890 INFO L225 Difference]: With dead ends: 761 [2018-12-03 17:31:37,890 INFO L226 Difference]: Without dead ends: 759 [2018-12-03 17:31:37,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1531 GetRequests, 1407 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:31:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-12-03 17:31:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-12-03 17:31:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-12-03 17:31:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-12-03 17:31:38,399 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-12-03 17:31:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:38,399 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-12-03 17:31:38,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:31:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-12-03 17:31:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-12-03 17:31:38,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:38,403 INFO L402 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-12-03 17:31:38,403 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:38,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 66 times [2018-12-03 17:31:38,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:38,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:38,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:38,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:38,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 17:31:40,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:40,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:40,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:40,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:40,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:40,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:40,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:40,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:40,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:40,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:40,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 17:31:41,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 17:31:46,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:46,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 17:31:46,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:46,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:31:46,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:31:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:31:46,076 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-12-03 17:31:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:46,976 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-12-03 17:31:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:31:46,976 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-12-03 17:31:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:46,979 INFO L225 Difference]: With dead ends: 773 [2018-12-03 17:31:46,979 INFO L226 Difference]: Without dead ends: 771 [2018-12-03 17:31:46,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1556 GetRequests, 1430 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:31:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-12-03 17:31:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-12-03 17:31:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-12-03 17:31:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-12-03 17:31:47,517 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-12-03 17:31:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:47,518 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-12-03 17:31:47,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:31:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-12-03 17:31:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-12-03 17:31:47,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:47,522 INFO L402 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-12-03 17:31:47,522 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:47,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 67 times [2018-12-03 17:31:47,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:47,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:47,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:47,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:47,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 17:31:50,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:50,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:50,082 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:50,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:50,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:50,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:50,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:50,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 17:31:50,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 17:31:55,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:55,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 17:31:55,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:55,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:31:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:31:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:31:55,882 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-12-03 17:31:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:56,808 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-12-03 17:31:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:31:56,809 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-12-03 17:31:56,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:56,811 INFO L225 Difference]: With dead ends: 785 [2018-12-03 17:31:56,811 INFO L226 Difference]: Without dead ends: 783 [2018-12-03 17:31:56,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1581 GetRequests, 1453 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:31:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-03 17:31:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-12-03 17:31:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-03 17:31:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-12-03 17:31:57,401 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-12-03 17:31:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:57,401 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-12-03 17:31:57,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:31:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-12-03 17:31:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-12-03 17:31:57,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:57,405 INFO L402 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-12-03 17:31:57,405 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:57,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 68 times [2018-12-03 17:31:57,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:57,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:57,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:57,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:57,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 17:31:59,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:59,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:59,677 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:59,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:59,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:59,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:59,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:01,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 385 check-sat command(s) [2018-12-03 17:32:01,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:01,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 17:32:02,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 17:32:07,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:07,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 17:32:07,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:07,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:32:07,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:32:07,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:32:07,439 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-12-03 17:32:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:08,427 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-12-03 17:32:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:32:08,427 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-12-03 17:32:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:08,430 INFO L225 Difference]: With dead ends: 797 [2018-12-03 17:32:08,430 INFO L226 Difference]: Without dead ends: 795 [2018-12-03 17:32:08,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1606 GetRequests, 1476 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:32:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-12-03 17:32:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-12-03 17:32:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-12-03 17:32:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-12-03 17:32:09,008 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-12-03 17:32:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:09,009 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-12-03 17:32:09,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:32:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-12-03 17:32:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-12-03 17:32:09,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:09,013 INFO L402 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-12-03 17:32:09,013 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:09,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:09,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 69 times [2018-12-03 17:32:09,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:09,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:09,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:09,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:09,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 17:32:11,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:11,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:11,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:11,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:11,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:11,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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:11,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:11,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:11,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:11,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:11,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 17:32:12,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 17:32:17,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:17,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 17:32:17,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:17,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:32:17,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:32:17,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:32:17,197 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-12-03 17:32:18,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:18,216 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-12-03 17:32:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:32:18,216 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-12-03 17:32:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:18,219 INFO L225 Difference]: With dead ends: 809 [2018-12-03 17:32:18,219 INFO L226 Difference]: Without dead ends: 807 [2018-12-03 17:32:18,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1631 GetRequests, 1499 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:32:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-12-03 17:32:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-12-03 17:32:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-12-03 17:32:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-12-03 17:32:18,804 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-12-03 17:32:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:18,804 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-12-03 17:32:18,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:32:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-12-03 17:32:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-12-03 17:32:18,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:18,809 INFO L402 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-12-03 17:32:18,809 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:18,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 70 times [2018-12-03 17:32:18,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:18,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:18,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:18,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:18,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 17:32:21,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:21,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:21,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:21,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:21,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:21,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:21,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:21,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:21,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 17:32:21,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 17:32:27,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:27,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 17:32:27,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:27,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:32:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:32:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:32:27,386 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-12-03 17:32:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:28,456 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-12-03 17:32:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:32:28,456 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-12-03 17:32:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:28,459 INFO L225 Difference]: With dead ends: 821 [2018-12-03 17:32:28,459 INFO L226 Difference]: Without dead ends: 819 [2018-12-03 17:32:28,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1656 GetRequests, 1522 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:32:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-03 17:32:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-12-03 17:32:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-03 17:32:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-12-03 17:32:29,138 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-12-03 17:32:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:29,139 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-12-03 17:32:29,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:32:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-12-03 17:32:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-12-03 17:32:29,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:29,143 INFO L402 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-12-03 17:32:29,144 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:29,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:29,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 71 times [2018-12-03 17:32:29,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:29,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:29,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:29,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:29,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 17:32:31,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:31,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:31,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:31,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:31,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:31,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:31,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:31,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:33,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 398 check-sat command(s) [2018-12-03 17:32:33,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:33,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 17:32:34,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 17:32:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:39,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 17:32:39,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:39,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:32:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:32:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:32:39,796 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-12-03 17:32:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:40,884 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-12-03 17:32:40,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:32:40,885 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-12-03 17:32:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:40,888 INFO L225 Difference]: With dead ends: 833 [2018-12-03 17:32:40,888 INFO L226 Difference]: Without dead ends: 831 [2018-12-03 17:32:40,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1681 GetRequests, 1545 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:32:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-03 17:32:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-12-03 17:32:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-12-03 17:32:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-12-03 17:32:41,515 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-12-03 17:32:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:41,515 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-12-03 17:32:41,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:32:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-12-03 17:32:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-12-03 17:32:41,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:41,519 INFO L402 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-12-03 17:32:41,520 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:41,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:41,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 72 times [2018-12-03 17:32:41,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:41,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:41,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:41,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:41,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 17:32:44,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:44,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:44,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:44,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:44,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:44,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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:44,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:44,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:44,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:44,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:44,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 17:32:45,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 17:32:51,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:51,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 17:32:51,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:51,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:32:51,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:32:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:32:51,153 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-12-03 17:32:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:53,258 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-12-03 17:32:53,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:32:53,258 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-12-03 17:32:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:53,262 INFO L225 Difference]: With dead ends: 845 [2018-12-03 17:32:53,262 INFO L226 Difference]: Without dead ends: 843 [2018-12-03 17:32:53,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1706 GetRequests, 1568 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:32:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-12-03 17:32:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-12-03 17:32:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-12-03 17:32:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-12-03 17:32:53,999 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-12-03 17:32:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:54,000 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-12-03 17:32:54,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:32:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-12-03 17:32:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-12-03 17:32:54,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:54,004 INFO L402 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-12-03 17:32:54,005 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:54,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 73 times [2018-12-03 17:32:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:54,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:54,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 17:32:56,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:56,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:56,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:56,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:56,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:56,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:56,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:56,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:56,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 17:32:57,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 17:33:03,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:03,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 17:33:03,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:03,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:33:03,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:33:03,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:33:03,218 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-12-03 17:33:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:04,422 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-12-03 17:33:04,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:33:04,422 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-12-03 17:33:04,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:04,425 INFO L225 Difference]: With dead ends: 857 [2018-12-03 17:33:04,425 INFO L226 Difference]: Without dead ends: 855 [2018-12-03 17:33:04,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1731 GetRequests, 1591 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:33:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-12-03 17:33:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-12-03 17:33:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-03 17:33:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-12-03 17:33:05,168 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-12-03 17:33:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:05,168 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-12-03 17:33:05,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:33:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-12-03 17:33:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-12-03 17:33:05,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:05,173 INFO L402 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-12-03 17:33:05,174 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:05,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:05,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 74 times [2018-12-03 17:33:05,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:05,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:05,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:05,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:05,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 17:33:07,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:07,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:07,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:07,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:07,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:07,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:07,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:07,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:10,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 421 check-sat command(s) [2018-12-03 17:33:10,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:10,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 17:33:10,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 17:33:16,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:16,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 17:33:16,941 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:16,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:33:16,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:33:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:33:16,942 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-12-03 17:33:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:18,210 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-12-03 17:33:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:33:18,210 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-12-03 17:33:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:18,212 INFO L225 Difference]: With dead ends: 869 [2018-12-03 17:33:18,212 INFO L226 Difference]: Without dead ends: 867 [2018-12-03 17:33:18,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1614 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:33:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-03 17:33:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-12-03 17:33:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-03 17:33:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-12-03 17:33:18,932 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-12-03 17:33:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:18,932 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-12-03 17:33:18,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:33:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-12-03 17:33:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-12-03 17:33:18,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:18,937 INFO L402 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-12-03 17:33:18,937 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:18,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:18,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 75 times [2018-12-03 17:33:18,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:18,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:18,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:18,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:18,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 17:33:21,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:21,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:21,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:21,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:21,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:21,787 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 17:33:21,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:21,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:22,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:22,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:22,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 17:33:22,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 17:33:28,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:28,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 17:33:28,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:28,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:33:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:33:28,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:33:28,982 INFO L87 Difference]: Start difference. First operand 856 states and 927 transitions. Second operand 74 states. [2018-12-03 17:33:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:30,261 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-12-03 17:33:30,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:33:30,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 855 [2018-12-03 17:33:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:30,263 INFO L225 Difference]: With dead ends: 881 [2018-12-03 17:33:30,263 INFO L226 Difference]: Without dead ends: 879 [2018-12-03 17:33:30,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1781 GetRequests, 1637 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:33:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-03 17:33:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 868. [2018-12-03 17:33:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-12-03 17:33:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 940 transitions. [2018-12-03 17:33:30,986 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 940 transitions. Word has length 855 [2018-12-03 17:33:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:30,987 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 940 transitions. [2018-12-03 17:33:30,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:33:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 940 transitions. [2018-12-03 17:33:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-12-03 17:33:30,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:30,991 INFO L402 BasicCegarLoop]: trace histogram [720, 72, 72, 1, 1, 1] [2018-12-03 17:33:30,992 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:30,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:30,992 INFO L82 PathProgramCache]: Analyzing trace with hash 696090067, now seen corresponding path program 76 times [2018-12-03 17:33:30,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:30,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:30,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:30,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 17:33:33,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:33,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:33,582 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:33,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:33,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:33,582 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:33,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:33,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:34,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 17:33:34,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 17:33:41,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:41,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 17:33:41,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:41,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:33:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:33:41,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:33:41,310 INFO L87 Difference]: Start difference. First operand 868 states and 940 transitions. Second operand 75 states. [2018-12-03 17:33:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:42,624 INFO L93 Difference]: Finished difference Result 893 states and 967 transitions. [2018-12-03 17:33:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:33:42,624 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 867 [2018-12-03 17:33:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:42,626 INFO L225 Difference]: With dead ends: 893 [2018-12-03 17:33:42,626 INFO L226 Difference]: Without dead ends: 891 [2018-12-03 17:33:42,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1806 GetRequests, 1660 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:33:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-12-03 17:33:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 880. [2018-12-03 17:33:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-12-03 17:33:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 953 transitions. [2018-12-03 17:33:43,379 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 953 transitions. Word has length 867 [2018-12-03 17:33:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:43,380 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 953 transitions. [2018-12-03 17:33:43,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:33:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 953 transitions. [2018-12-03 17:33:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-12-03 17:33:43,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:43,385 INFO L402 BasicCegarLoop]: trace histogram [730, 73, 73, 1, 1, 1] [2018-12-03 17:33:43,385 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:43,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:43,386 INFO L82 PathProgramCache]: Analyzing trace with hash 943168797, now seen corresponding path program 77 times [2018-12-03 17:33:43,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:43,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:43,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:43,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:43,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 17:33:46,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:46,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:46,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:46,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:46,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:46,269 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:46,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:46,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:49,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 434 check-sat command(s) [2018-12-03 17:33:49,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:49,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 17:33:49,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 17:33:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:56,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 17:33:56,685 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:56,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:33:56,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:33:56,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:33:56,686 INFO L87 Difference]: Start difference. First operand 880 states and 953 transitions. Second operand 76 states. [2018-12-03 17:33:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:57,980 INFO L93 Difference]: Finished difference Result 905 states and 980 transitions. [2018-12-03 17:33:57,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:33:57,980 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 879 [2018-12-03 17:33:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:57,982 INFO L225 Difference]: With dead ends: 905 [2018-12-03 17:33:57,982 INFO L226 Difference]: Without dead ends: 903 [2018-12-03 17:33:57,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1831 GetRequests, 1683 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:33:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-12-03 17:33:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2018-12-03 17:33:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-03 17:33:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 966 transitions. [2018-12-03 17:33:58,744 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 966 transitions. Word has length 879 [2018-12-03 17:33:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:58,745 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 966 transitions. [2018-12-03 17:33:58,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:33:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 966 transitions. [2018-12-03 17:33:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-12-03 17:33:58,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:58,752 INFO L402 BasicCegarLoop]: trace histogram [740, 74, 74, 1, 1, 1] [2018-12-03 17:33:58,753 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:58,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash -811917977, now seen corresponding path program 78 times [2018-12-03 17:33:58,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:58,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:58,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:58,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:58,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 17:34:01,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:01,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:01,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:01,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:01,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:01,793 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:01,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:01,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:02,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:02,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:02,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 17:34:02,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 17:34:09,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:09,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 17:34:09,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:09,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:34:09,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:34:09,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:34:09,593 INFO L87 Difference]: Start difference. First operand 892 states and 966 transitions. Second operand 77 states. [2018-12-03 17:34:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:10,969 INFO L93 Difference]: Finished difference Result 917 states and 993 transitions. [2018-12-03 17:34:10,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:34:10,969 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 891 [2018-12-03 17:34:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:10,971 INFO L225 Difference]: With dead ends: 917 [2018-12-03 17:34:10,971 INFO L226 Difference]: Without dead ends: 915 [2018-12-03 17:34:10,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1856 GetRequests, 1706 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:34:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-03 17:34:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 904. [2018-12-03 17:34:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-03 17:34:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 979 transitions. [2018-12-03 17:34:11,775 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 979 transitions. Word has length 891 [2018-12-03 17:34:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:11,775 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 979 transitions. [2018-12-03 17:34:11,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:34:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 979 transitions. [2018-12-03 17:34:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2018-12-03 17:34:11,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:11,780 INFO L402 BasicCegarLoop]: trace histogram [750, 75, 75, 1, 1, 1] [2018-12-03 17:34:11,781 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:11,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash -543261007, now seen corresponding path program 79 times [2018-12-03 17:34:11,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:11,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:11,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 17:34:14,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:14,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:14,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:14,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:14,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:14,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:14,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:14,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:14,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 17:34:15,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 17:34:22,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:22,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 17:34:22,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:22,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:34:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:34:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:34:22,656 INFO L87 Difference]: Start difference. First operand 904 states and 979 transitions. Second operand 78 states. [2018-12-03 17:34:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:24,000 INFO L93 Difference]: Finished difference Result 929 states and 1006 transitions. [2018-12-03 17:34:24,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:34:24,001 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 903 [2018-12-03 17:34:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:24,002 INFO L225 Difference]: With dead ends: 929 [2018-12-03 17:34:24,002 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 17:34:24,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1881 GetRequests, 1729 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:34:24,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 17:34:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 916. [2018-12-03 17:34:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-03 17:34:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2018-12-03 17:34:24,852 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 903 [2018-12-03 17:34:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:24,853 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2018-12-03 17:34:24,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:34:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2018-12-03 17:34:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-12-03 17:34:24,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:24,858 INFO L402 BasicCegarLoop]: trace histogram [760, 76, 76, 1, 1, 1] [2018-12-03 17:34:24,858 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:24,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1703395077, now seen corresponding path program 80 times [2018-12-03 17:34:24,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:24,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:24,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:24,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 17:34:27,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:27,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:27,925 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:27,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:27,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:27,926 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:27,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:31,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 457 check-sat command(s) [2018-12-03 17:34:31,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:31,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 17:34:31,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 17:34:38,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:38,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 17:34:38,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:38,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:34:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:34:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:34:38,733 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 79 states. [2018-12-03 17:34:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:40,094 INFO L93 Difference]: Finished difference Result 941 states and 1019 transitions. [2018-12-03 17:34:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:34:40,094 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 915 [2018-12-03 17:34:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:40,095 INFO L225 Difference]: With dead ends: 941 [2018-12-03 17:34:40,096 INFO L226 Difference]: Without dead ends: 939 [2018-12-03 17:34:40,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1906 GetRequests, 1752 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:34:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-12-03 17:34:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 928. [2018-12-03 17:34:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-12-03 17:34:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1005 transitions. [2018-12-03 17:34:40,941 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1005 transitions. Word has length 915 [2018-12-03 17:34:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:40,942 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1005 transitions. [2018-12-03 17:34:40,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:34:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1005 transitions. [2018-12-03 17:34:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-12-03 17:34:40,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:40,948 INFO L402 BasicCegarLoop]: trace histogram [770, 77, 77, 1, 1, 1] [2018-12-03 17:34:40,948 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:40,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash 345957445, now seen corresponding path program 81 times [2018-12-03 17:34:40,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:40,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:40,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 17:34:44,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:44,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:44,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:44,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:44,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:44,076 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:44,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:44,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:44,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:44,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:44,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 17:34:45,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 17:34:52,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:52,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 17:34:52,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:52,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:34:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:34:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:34:52,660 INFO L87 Difference]: Start difference. First operand 928 states and 1005 transitions. Second operand 80 states. [2018-12-03 17:34:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:54,175 INFO L93 Difference]: Finished difference Result 953 states and 1032 transitions. [2018-12-03 17:34:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:34:54,175 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 927 [2018-12-03 17:34:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:54,177 INFO L225 Difference]: With dead ends: 953 [2018-12-03 17:34:54,178 INFO L226 Difference]: Without dead ends: 951 [2018-12-03 17:34:54,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1931 GetRequests, 1775 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:34:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-03 17:34:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 940. [2018-12-03 17:34:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-12-03 17:34:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1018 transitions. [2018-12-03 17:34:55,074 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1018 transitions. Word has length 927 [2018-12-03 17:34:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:55,075 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1018 transitions. [2018-12-03 17:34:55,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:34:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1018 transitions. [2018-12-03 17:34:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-12-03 17:34:55,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:55,084 INFO L402 BasicCegarLoop]: trace histogram [780, 78, 78, 1, 1, 1] [2018-12-03 17:34:55,084 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:55,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:55,084 INFO L82 PathProgramCache]: Analyzing trace with hash -456595313, now seen corresponding path program 82 times [2018-12-03 17:34:55,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:55,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:55,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 17:34:58,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:58,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:58,326 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:58,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:58,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:58,326 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:58,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:58,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:58,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 17:34:59,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 17:35:06,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:06,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 17:35:06,757 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:06,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:35:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:35:06,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:35:06,758 INFO L87 Difference]: Start difference. First operand 940 states and 1018 transitions. Second operand 81 states. [2018-12-03 17:35:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:08,275 INFO L93 Difference]: Finished difference Result 965 states and 1045 transitions. [2018-12-03 17:35:08,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:35:08,275 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 939 [2018-12-03 17:35:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:08,277 INFO L225 Difference]: With dead ends: 965 [2018-12-03 17:35:08,277 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 17:35:08,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1956 GetRequests, 1798 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:35:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 17:35:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2018-12-03 17:35:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-12-03 17:35:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1031 transitions. [2018-12-03 17:35:09,184 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1031 transitions. Word has length 939 [2018-12-03 17:35:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:09,185 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1031 transitions. [2018-12-03 17:35:09,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:35:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1031 transitions. [2018-12-03 17:35:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2018-12-03 17:35:09,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:09,192 INFO L402 BasicCegarLoop]: trace histogram [790, 79, 79, 1, 1, 1] [2018-12-03 17:35:09,193 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:09,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1007890983, now seen corresponding path program 83 times [2018-12-03 17:35:09,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:09,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:09,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 17:35:12,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:12,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:12,310 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:12,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:12,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:12,311 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:12,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:12,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:15,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 470 check-sat command(s) [2018-12-03 17:35:15,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:15,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 17:35:16,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 17:35:24,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:24,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 17:35:24,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:24,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 17:35:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 17:35:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:35:24,352 INFO L87 Difference]: Start difference. First operand 952 states and 1031 transitions. Second operand 82 states. [2018-12-03 17:35:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:25,856 INFO L93 Difference]: Finished difference Result 977 states and 1058 transitions. [2018-12-03 17:35:25,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:35:25,856 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 951 [2018-12-03 17:35:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:25,858 INFO L225 Difference]: With dead ends: 977 [2018-12-03 17:35:25,858 INFO L226 Difference]: Without dead ends: 975 [2018-12-03 17:35:25,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1981 GetRequests, 1821 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:35:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-03 17:35:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 964. [2018-12-03 17:35:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-12-03 17:35:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1044 transitions. [2018-12-03 17:35:26,893 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1044 transitions. Word has length 951 [2018-12-03 17:35:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:26,894 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1044 transitions. [2018-12-03 17:35:26,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 17:35:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1044 transitions. [2018-12-03 17:35:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-12-03 17:35:26,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:26,901 INFO L402 BasicCegarLoop]: trace histogram [800, 80, 80, 1, 1, 1] [2018-12-03 17:35:26,901 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:26,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash 759239715, now seen corresponding path program 84 times [2018-12-03 17:35:26,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:26,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:26,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 17:35:30,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:30,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:30,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:30,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:30,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:30,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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:30,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:30,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:30,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:30,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:30,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 17:35:31,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 17:35:39,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:39,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 17:35:39,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:39,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:35:39,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:35:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:35:39,394 INFO L87 Difference]: Start difference. First operand 964 states and 1044 transitions. Second operand 83 states. [2018-12-03 17:35:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:40,921 INFO L93 Difference]: Finished difference Result 989 states and 1071 transitions. [2018-12-03 17:35:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:35:40,922 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 963 [2018-12-03 17:35:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:40,924 INFO L225 Difference]: With dead ends: 989 [2018-12-03 17:35:40,924 INFO L226 Difference]: Without dead ends: 987 [2018-12-03 17:35:40,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2006 GetRequests, 1844 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:35:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-12-03 17:35:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 976. [2018-12-03 17:35:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-12-03 17:35:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1057 transitions. [2018-12-03 17:35:41,890 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1057 transitions. Word has length 963 [2018-12-03 17:35:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:41,891 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1057 transitions. [2018-12-03 17:35:41,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:35:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1057 transitions. [2018-12-03 17:35:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-12-03 17:35:41,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:41,898 INFO L402 BasicCegarLoop]: trace histogram [810, 81, 81, 1, 1, 1] [2018-12-03 17:35:41,898 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:41,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash -29607059, now seen corresponding path program 85 times [2018-12-03 17:35:41,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:41,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:41,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 17:35:45,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:45,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:45,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:45,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:45,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:45,371 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:45,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:45,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:35:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:45,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 17:35:46,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 17:35:54,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:54,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:35:54,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:54,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:35:54,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:35:54,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:35:54,830 INFO L87 Difference]: Start difference. First operand 976 states and 1057 transitions. Second operand 84 states. [2018-12-03 17:35:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:56,455 INFO L93 Difference]: Finished difference Result 1001 states and 1084 transitions. [2018-12-03 17:35:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:35:56,455 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 975 [2018-12-03 17:35:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:56,457 INFO L225 Difference]: With dead ends: 1001 [2018-12-03 17:35:56,457 INFO L226 Difference]: Without dead ends: 999 [2018-12-03 17:35:56,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2031 GetRequests, 1867 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:35:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-12-03 17:35:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 988. [2018-12-03 17:35:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-12-03 17:35:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1070 transitions. [2018-12-03 17:35:57,448 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1070 transitions. Word has length 975 [2018-12-03 17:35:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:57,449 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1070 transitions. [2018-12-03 17:35:57,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:35:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1070 transitions. [2018-12-03 17:35:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-12-03 17:35:57,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:57,455 INFO L402 BasicCegarLoop]: trace histogram [820, 82, 82, 1, 1, 1] [2018-12-03 17:35:57,455 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:57,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:57,455 INFO L82 PathProgramCache]: Analyzing trace with hash 378848183, now seen corresponding path program 86 times [2018-12-03 17:35:57,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:57,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:57,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:57,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:57,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 17:36:01,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:01,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:01,102 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:01,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:01,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:01,102 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:01,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:01,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:04,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 493 check-sat command(s) [2018-12-03 17:36:04,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:04,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 17:36:05,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 17:36:13,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:13,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:36:13,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:36:13,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:36:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:36:13,755 INFO L87 Difference]: Start difference. First operand 988 states and 1070 transitions. Second operand 85 states. [2018-12-03 17:36:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:15,420 INFO L93 Difference]: Finished difference Result 1013 states and 1097 transitions. [2018-12-03 17:36:15,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:36:15,420 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 987 [2018-12-03 17:36:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:15,423 INFO L225 Difference]: With dead ends: 1013 [2018-12-03 17:36:15,423 INFO L226 Difference]: Without dead ends: 1011 [2018-12-03 17:36:15,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2056 GetRequests, 1890 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:36:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-12-03 17:36:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1000. [2018-12-03 17:36:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-12-03 17:36:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1083 transitions. [2018-12-03 17:36:16,538 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1083 transitions. Word has length 987 [2018-12-03 17:36:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:16,539 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1083 transitions. [2018-12-03 17:36:16,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:36:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1083 transitions. [2018-12-03 17:36:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-12-03 17:36:16,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:16,546 INFO L402 BasicCegarLoop]: trace histogram [830, 83, 83, 1, 1, 1] [2018-12-03 17:36:16,546 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:16,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash -129946367, now seen corresponding path program 87 times [2018-12-03 17:36:16,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:16,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:16,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 17:36:20,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:20,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:20,168 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:20,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:20,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:20,169 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:20,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:20,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:20,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:20,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:20,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 17:36:21,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 17:36:29,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:29,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:36:29,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:29,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:36:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:36:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:36:29,922 INFO L87 Difference]: Start difference. First operand 1000 states and 1083 transitions. Second operand 86 states. [2018-12-03 17:36:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:31,578 INFO L93 Difference]: Finished difference Result 1025 states and 1110 transitions. [2018-12-03 17:36:31,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:36:31,579 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 999 [2018-12-03 17:36:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:31,580 INFO L225 Difference]: With dead ends: 1025 [2018-12-03 17:36:31,580 INFO L226 Difference]: Without dead ends: 1023 [2018-12-03 17:36:31,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2081 GetRequests, 1913 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:36:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-12-03 17:36:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1012. [2018-12-03 17:36:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-12-03 17:36:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1096 transitions. [2018-12-03 17:36:32,639 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1096 transitions. Word has length 999 [2018-12-03 17:36:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:32,640 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1096 transitions. [2018-12-03 17:36:32,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:36:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1096 transitions. [2018-12-03 17:36:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-12-03 17:36:32,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:32,646 INFO L402 BasicCegarLoop]: trace histogram [840, 84, 84, 1, 1, 1] [2018-12-03 17:36:32,646 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:32,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:32,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1735915339, now seen corresponding path program 88 times [2018-12-03 17:36:32,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:32,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:32,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 17:36:36,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:36,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:36,747 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:36,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:36,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:36,747 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:36,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:36,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:36:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:37,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 17:36:37,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 17:36:46,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:46,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:36:46,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:46,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:36:46,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:36:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:36:46,682 INFO L87 Difference]: Start difference. First operand 1012 states and 1096 transitions. Second operand 87 states. [2018-12-03 17:36:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:48,479 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2018-12-03 17:36:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:36:48,480 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1011 [2018-12-03 17:36:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:48,481 INFO L225 Difference]: With dead ends: 1037 [2018-12-03 17:36:48,481 INFO L226 Difference]: Without dead ends: 1035 [2018-12-03 17:36:48,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2106 GetRequests, 1936 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:36:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-12-03 17:36:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1024. [2018-12-03 17:36:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-12-03 17:36:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1109 transitions. [2018-12-03 17:36:49,699 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1109 transitions. Word has length 1011 [2018-12-03 17:36:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:49,699 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1109 transitions. [2018-12-03 17:36:49,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:36:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1109 transitions. [2018-12-03 17:36:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-12-03 17:36:49,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:49,705 INFO L402 BasicCegarLoop]: trace histogram [850, 85, 85, 1, 1, 1] [2018-12-03 17:36:49,705 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:49,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:49,706 INFO L82 PathProgramCache]: Analyzing trace with hash 179282581, now seen corresponding path program 89 times [2018-12-03 17:36:49,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:49,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:49,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 17:36:53,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:53,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:53,254 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:53,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:53,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:53,254 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:53,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:53,263 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:57,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 506 check-sat command(s) [2018-12-03 17:36:57,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:57,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 17:36:58,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 17:37:07,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:07,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:37:07,083 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:07,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:37:07,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:37:07,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:37:07,085 INFO L87 Difference]: Start difference. First operand 1024 states and 1109 transitions. Second operand 88 states. [2018-12-03 17:37:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:08,962 INFO L93 Difference]: Finished difference Result 1049 states and 1136 transitions. [2018-12-03 17:37:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:37:08,962 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1023 [2018-12-03 17:37:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:08,963 INFO L225 Difference]: With dead ends: 1049 [2018-12-03 17:37:08,963 INFO L226 Difference]: Without dead ends: 1047 [2018-12-03 17:37:08,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2131 GetRequests, 1959 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:37:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-12-03 17:37:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1036. [2018-12-03 17:37:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-12-03 17:37:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1122 transitions. [2018-12-03 17:37:10,079 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1122 transitions. Word has length 1023 [2018-12-03 17:37:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:10,079 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1122 transitions. [2018-12-03 17:37:10,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:37:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1122 transitions. [2018-12-03 17:37:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-12-03 17:37:10,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:10,085 INFO L402 BasicCegarLoop]: trace histogram [860, 86, 86, 1, 1, 1] [2018-12-03 17:37:10,085 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:10,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 178171615, now seen corresponding path program 90 times [2018-12-03 17:37:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:10,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:10,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 17:37:13,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:13,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:13,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:13,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:13,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:13,643 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:13,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:37:13,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:37:14,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:37:14,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:14,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 17:37:14,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 17:37:24,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:24,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 17:37:24,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:24,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:37:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:37:24,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:37:24,237 INFO L87 Difference]: Start difference. First operand 1036 states and 1122 transitions. Second operand 89 states. [2018-12-03 17:37:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:26,110 INFO L93 Difference]: Finished difference Result 1061 states and 1149 transitions. [2018-12-03 17:37:26,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:37:26,110 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1035 [2018-12-03 17:37:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:26,112 INFO L225 Difference]: With dead ends: 1061 [2018-12-03 17:37:26,112 INFO L226 Difference]: Without dead ends: 1059 [2018-12-03 17:37:26,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2156 GetRequests, 1982 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:37:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-12-03 17:37:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1048. [2018-12-03 17:37:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-12-03 17:37:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1135 transitions. [2018-12-03 17:37:27,218 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1135 transitions. Word has length 1035 [2018-12-03 17:37:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:27,219 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1135 transitions. [2018-12-03 17:37:27,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:37:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1135 transitions. [2018-12-03 17:37:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-12-03 17:37:27,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:27,225 INFO L402 BasicCegarLoop]: trace histogram [870, 87, 87, 1, 1, 1] [2018-12-03 17:37:27,225 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:27,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:27,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1304716247, now seen corresponding path program 91 times [2018-12-03 17:37:27,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:27,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:27,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 17:37:30,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:30,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:30,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:30,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:30,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:30,889 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:30,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:30,936 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:31,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 17:37:32,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 17:37:41,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:41,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:37:41,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:41,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:37:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:37:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:37:41,635 INFO L87 Difference]: Start difference. First operand 1048 states and 1135 transitions. Second operand 90 states. [2018-12-03 17:37:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:43,398 INFO L93 Difference]: Finished difference Result 1073 states and 1162 transitions. [2018-12-03 17:37:43,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:37:43,399 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1047 [2018-12-03 17:37:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:43,400 INFO L225 Difference]: With dead ends: 1073 [2018-12-03 17:37:43,400 INFO L226 Difference]: Without dead ends: 1071 [2018-12-03 17:37:43,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2181 GetRequests, 2005 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:37:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-12-03 17:37:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2018-12-03 17:37:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-12-03 17:37:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1148 transitions. [2018-12-03 17:37:44,593 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1148 transitions. Word has length 1047 [2018-12-03 17:37:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:44,593 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1148 transitions. [2018-12-03 17:37:44,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:37:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1148 transitions. [2018-12-03 17:37:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-12-03 17:37:44,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:44,600 INFO L402 BasicCegarLoop]: trace histogram [880, 88, 88, 1, 1, 1] [2018-12-03 17:37:44,600 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:44,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 247261811, now seen corresponding path program 92 times [2018-12-03 17:37:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:44,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:44,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 17:37:48,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:48,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:48,608 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:48,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:48,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:48,609 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:48,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:37:48,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:37:52,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 529 check-sat command(s) [2018-12-03 17:37:52,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:52,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 17:37:53,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 17:38:03,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:03,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:38:03,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:03,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:38:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:38:03,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:38:03,363 INFO L87 Difference]: Start difference. First operand 1060 states and 1148 transitions. Second operand 91 states. [2018-12-03 17:38:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:05,222 INFO L93 Difference]: Finished difference Result 1085 states and 1175 transitions. [2018-12-03 17:38:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:38:05,223 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1059 [2018-12-03 17:38:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:05,224 INFO L225 Difference]: With dead ends: 1085 [2018-12-03 17:38:05,224 INFO L226 Difference]: Without dead ends: 1083 [2018-12-03 17:38:05,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2206 GetRequests, 2028 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:38:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-12-03 17:38:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1072. [2018-12-03 17:38:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-12-03 17:38:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1161 transitions. [2018-12-03 17:38:06,411 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1161 transitions. Word has length 1059 [2018-12-03 17:38:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:06,412 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 1161 transitions. [2018-12-03 17:38:06,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:38:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1161 transitions. [2018-12-03 17:38:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-12-03 17:38:06,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:06,418 INFO L402 BasicCegarLoop]: trace histogram [890, 89, 89, 1, 1, 1] [2018-12-03 17:38:06,418 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:06,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1885791811, now seen corresponding path program 93 times [2018-12-03 17:38:06,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:06,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:06,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:06,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:06,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 17:38:10,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:10,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:10,194 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:10,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:10,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:10,194 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:10,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:38:10,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:38:10,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:38:10,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:10,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 17:38:11,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 17:38:21,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:21,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 17:38:21,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:21,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:38:21,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:38:21,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:38:21,243 INFO L87 Difference]: Start difference. First operand 1072 states and 1161 transitions. Second operand 92 states. [2018-12-03 17:38:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:23,206 INFO L93 Difference]: Finished difference Result 1097 states and 1188 transitions. [2018-12-03 17:38:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:38:23,206 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1071 [2018-12-03 17:38:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:23,207 INFO L225 Difference]: With dead ends: 1097 [2018-12-03 17:38:23,208 INFO L226 Difference]: Without dead ends: 1095 [2018-12-03 17:38:23,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2231 GetRequests, 2051 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:38:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-12-03 17:38:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1084. [2018-12-03 17:38:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-12-03 17:38:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1174 transitions. [2018-12-03 17:38:24,481 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1174 transitions. Word has length 1071 [2018-12-03 17:38:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:24,482 INFO L480 AbstractCegarLoop]: Abstraction has 1084 states and 1174 transitions. [2018-12-03 17:38:24,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:38:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1174 transitions. [2018-12-03 17:38:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2018-12-03 17:38:24,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:24,489 INFO L402 BasicCegarLoop]: trace histogram [900, 90, 90, 1, 1, 1] [2018-12-03 17:38:24,490 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:24,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1501124089, now seen corresponding path program 94 times [2018-12-03 17:38:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:24,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:24,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 17:38:28,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:28,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:28,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:28,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:28,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:28,593 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:28,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:28,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:38:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:29,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 17:38:30,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 17:38:39,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:39,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 17:38:39,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:39,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:38:39,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:38:39,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:38:39,969 INFO L87 Difference]: Start difference. First operand 1084 states and 1174 transitions. Second operand 93 states. [2018-12-03 17:38:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:41,910 INFO L93 Difference]: Finished difference Result 1109 states and 1201 transitions. [2018-12-03 17:38:41,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:38:41,910 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1083 [2018-12-03 17:38:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:41,911 INFO L225 Difference]: With dead ends: 1109 [2018-12-03 17:38:41,911 INFO L226 Difference]: Without dead ends: 1107 [2018-12-03 17:38:41,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2256 GetRequests, 2074 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:38:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-12-03 17:38:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1096. [2018-12-03 17:38:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-12-03 17:38:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1187 transitions. [2018-12-03 17:38:43,252 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1187 transitions. Word has length 1083 [2018-12-03 17:38:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:43,253 INFO L480 AbstractCegarLoop]: Abstraction has 1096 states and 1187 transitions. [2018-12-03 17:38:43,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:38:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1187 transitions. [2018-12-03 17:38:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-12-03 17:38:43,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:43,260 INFO L402 BasicCegarLoop]: trace histogram [910, 91, 91, 1, 1, 1] [2018-12-03 17:38:43,260 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:43,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:43,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1736186705, now seen corresponding path program 95 times [2018-12-03 17:38:43,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:43,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:43,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:43,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:43,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 17:38:47,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:47,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:47,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:47,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:47,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:47,261 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:47,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:38:47,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:38:51,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 542 check-sat command(s) [2018-12-03 17:38:51,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:51,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 17:38:52,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 17:39:02,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:02,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 17:39:02,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:02,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:39:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:39:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:39:02,682 INFO L87 Difference]: Start difference. First operand 1096 states and 1187 transitions. Second operand 94 states. [2018-12-03 17:39:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:04,747 INFO L93 Difference]: Finished difference Result 1121 states and 1214 transitions. [2018-12-03 17:39:04,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:39:04,747 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1095 [2018-12-03 17:39:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:04,749 INFO L225 Difference]: With dead ends: 1121 [2018-12-03 17:39:04,749 INFO L226 Difference]: Without dead ends: 1119 [2018-12-03 17:39:04,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2281 GetRequests, 2097 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:39:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-03 17:39:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1108. [2018-12-03 17:39:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-12-03 17:39:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1200 transitions. [2018-12-03 17:39:06,068 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1200 transitions. Word has length 1095 [2018-12-03 17:39:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:06,069 INFO L480 AbstractCegarLoop]: Abstraction has 1108 states and 1200 transitions. [2018-12-03 17:39:06,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:39:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1200 transitions. [2018-12-03 17:39:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-12-03 17:39:06,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:06,076 INFO L402 BasicCegarLoop]: trace histogram [920, 92, 92, 1, 1, 1] [2018-12-03 17:39:06,076 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:06,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:06,077 INFO L82 PathProgramCache]: Analyzing trace with hash 682618267, now seen corresponding path program 96 times [2018-12-03 17:39:06,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:06,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:06,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 17:39:10,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:10,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:10,434 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:10,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:10,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:10,434 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:10,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:39:10,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:39:11,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:39:11,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:11,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 17:39:11,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 17:39:22,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:22,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 17:39:22,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:22,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:39:22,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:39:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:39:22,327 INFO L87 Difference]: Start difference. First operand 1108 states and 1200 transitions. Second operand 95 states. [2018-12-03 17:39:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:24,454 INFO L93 Difference]: Finished difference Result 1133 states and 1227 transitions. [2018-12-03 17:39:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:39:24,454 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1107 [2018-12-03 17:39:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:24,456 INFO L225 Difference]: With dead ends: 1133 [2018-12-03 17:39:24,456 INFO L226 Difference]: Without dead ends: 1131 [2018-12-03 17:39:24,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2306 GetRequests, 2120 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:39:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-12-03 17:39:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1120. [2018-12-03 17:39:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-12-03 17:39:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1213 transitions. [2018-12-03 17:39:25,799 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1213 transitions. Word has length 1107 [2018-12-03 17:39:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:25,800 INFO L480 AbstractCegarLoop]: Abstraction has 1120 states and 1213 transitions. [2018-12-03 17:39:25,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:39:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1213 transitions. [2018-12-03 17:39:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-12-03 17:39:25,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:25,807 INFO L402 BasicCegarLoop]: trace histogram [930, 93, 93, 1, 1, 1] [2018-12-03 17:39:25,807 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:25,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash 580428005, now seen corresponding path program 97 times [2018-12-03 17:39:25,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:25,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:25,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:25,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:25,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 17:39:30,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:30,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:30,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:30,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:30,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:30,141 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:30,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:30,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:39:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:30,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 17:39:31,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 17:39:42,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:42,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:39:42,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:42,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:39:42,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:39:42,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:39:42,122 INFO L87 Difference]: Start difference. First operand 1120 states and 1213 transitions. Second operand 96 states. [2018-12-03 17:39:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:44,252 INFO L93 Difference]: Finished difference Result 1145 states and 1240 transitions. [2018-12-03 17:39:44,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:39:44,252 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1119 [2018-12-03 17:39:44,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:44,253 INFO L225 Difference]: With dead ends: 1145 [2018-12-03 17:39:44,254 INFO L226 Difference]: Without dead ends: 1143 [2018-12-03 17:39:44,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2331 GetRequests, 2143 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:39:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-12-03 17:39:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1132. [2018-12-03 17:39:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-03 17:39:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1226 transitions. [2018-12-03 17:39:45,733 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1226 transitions. Word has length 1119 [2018-12-03 17:39:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:45,734 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1226 transitions. [2018-12-03 17:39:45,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:39:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1226 transitions. [2018-12-03 17:39:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2018-12-03 17:39:45,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:45,742 INFO L402 BasicCegarLoop]: trace histogram [940, 94, 94, 1, 1, 1] [2018-12-03 17:39:45,742 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:45,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash 267171119, now seen corresponding path program 98 times [2018-12-03 17:39:45,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:45,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:45,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 17:39:50,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:50,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:50,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:50,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:50,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:50,169 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:50,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:39:50,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:39:55,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 565 check-sat command(s) [2018-12-03 17:39:55,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:55,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 17:39:55,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 17:40:06,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:06,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:40:06,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:06,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:40:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:40:06,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:40:06,816 INFO L87 Difference]: Start difference. First operand 1132 states and 1226 transitions. Second operand 97 states. [2018-12-03 17:40:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:09,009 INFO L93 Difference]: Finished difference Result 1157 states and 1253 transitions. [2018-12-03 17:40:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:40:09,009 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1131 [2018-12-03 17:40:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:09,011 INFO L225 Difference]: With dead ends: 1157 [2018-12-03 17:40:09,011 INFO L226 Difference]: Without dead ends: 1155 [2018-12-03 17:40:09,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2356 GetRequests, 2166 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:40:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-12-03 17:40:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1144. [2018-12-03 17:40:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-12-03 17:40:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1239 transitions. [2018-12-03 17:40:10,412 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1239 transitions. Word has length 1131 [2018-12-03 17:40:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:10,413 INFO L480 AbstractCegarLoop]: Abstraction has 1144 states and 1239 transitions. [2018-12-03 17:40:10,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:40:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1239 transitions. [2018-12-03 17:40:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2018-12-03 17:40:10,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:10,423 INFO L402 BasicCegarLoop]: trace histogram [950, 95, 95, 1, 1, 1] [2018-12-03 17:40:10,423 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:10,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:10,424 INFO L82 PathProgramCache]: Analyzing trace with hash -844977543, now seen corresponding path program 99 times [2018-12-03 17:40:10,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:10,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:10,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:10,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:10,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-12-03 17:40:14,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:14,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:14,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:14,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:14,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:14,705 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:14,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:14,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:15,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:15,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:15,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-12-03 17:40:16,297 INFO L316 TraceCheckSpWp]: Computing backward predicates...