java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:47:15,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:47:15,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:47:15,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:47:15,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:47:15,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:47:15,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:47:15,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:47:15,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:47:15,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:47:15,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:47:15,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:47:15,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:47:15,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:47:15,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:47:15,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:47:15,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:47:15,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:47:15,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:47:15,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:47:15,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:47:15,528 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:47:15,530 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:47:15,531 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:47:15,531 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:47:15,532 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:47:15,533 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:47:15,534 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:47:15,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:47:15,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:47:15,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:47:15,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:47:15,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:47:15,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:47:15,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:47:15,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:47:15,540 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:47:15,553 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:47:15,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:47:15,554 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:47:15,554 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:47:15,554 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:47:15,555 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:47:15,555 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:47:15,555 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:47:15,555 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:47:15,556 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:47:15,556 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:47:15,556 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:47:15,556 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:47:15,556 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:47:15,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:47:15,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:47:15,558 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:47:15,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:47:15,558 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:47:15,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:47:15,558 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:47:15,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:47:15,559 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:47:15,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:47:15,559 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:47:15,559 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:47:15,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:47:15,560 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:47:15,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:47:15,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:47:15,560 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:47:15,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:47:15,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:47:15,561 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:47:15,561 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:47:15,561 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:47:15,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:47:15,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:47:15,562 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:47:15,562 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:47:15,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:47:15,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:47:15,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:47:15,634 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:47:15,635 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:47:15,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 18:47:15,636 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-12-03 18:47:15,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:47:15,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:47:15,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:47:15,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:47:15,675 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:47:15,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:47:15,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:47:15,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:47:15,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:47:15,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... [2018-12-03 18:47:15,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:47:15,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:47:15,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:47:15,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:47:15,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:47:15,815 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 18:47:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:47:15,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:47:16,125 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:47:16,126 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:47:16,126 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:47:16 BoogieIcfgContainer [2018-12-03 18:47:16,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:47:16,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:47:16,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:47:16,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:47:16,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:15" (1/2) ... [2018-12-03 18:47:16,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7614c381 and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:47:16, skipping insertion in model container [2018-12-03 18:47:16,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:47:16" (2/2) ... [2018-12-03 18:47:16,134 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 18:47:16,144 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:47:16,152 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:47:16,170 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:47:16,206 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:47:16,206 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:47:16,206 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:47:16,207 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:47:16,207 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:47:16,207 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:47:16,207 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:47:16,207 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:47:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 18:47:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:47:16,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:16,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:16,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:16,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1807861163, now seen corresponding path program 1 times [2018-12-03 18:47:16,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:16,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:16,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:16,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:47:16,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:47:16,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:16,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:47:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:47:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:47:16,460 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 18:47:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:16,576 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-03 18:47:16,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:47:16,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 18:47:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:16,588 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:47:16,589 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:47:16,593 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 18:47:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:47:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:47:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:47:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-03 18:47:16,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-12-03 18:47:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:16,635 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-03 18:47:16,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:47:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-03 18:47:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:47:16,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:16,636 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:16,636 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:16,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:16,637 INFO L82 PathProgramCache]: Analyzing trace with hash 89245487, now seen corresponding path program 1 times [2018-12-03 18:47:16,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:16,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:16,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:16,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:16,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:16,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:16,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:16,716 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 18:47:16,718 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [13], [17], [23], [25] [2018-12-03 18:47:16,777 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:47:16,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:47:17,024 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:47:17,026 INFO L272 AbstractInterpreter]: Visited 5 different actions 26 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:47:17,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:17,046 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:47:17,105 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 44.33% of their original sizes. [2018-12-03 18:47:17,105 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:47:17,219 INFO L418 sIntCurrentIteration]: We unified 8 AI predicates to 8 [2018-12-03 18:47:17,220 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:47:17,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:47:17,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2018-12-03 18:47:17,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:17,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:47:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:47:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:47:17,224 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-12-03 18:47:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:17,547 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-12-03 18:47:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:47:17,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 18:47:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:17,548 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:47:17,549 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:47:17,550 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:47:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:47:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-03 18:47:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:47:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-12-03 18:47:17,558 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2018-12-03 18:47:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:17,559 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-03 18:47:17,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:47:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2018-12-03 18:47:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:47:17,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:17,560 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:17,560 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:17,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 89305069, now seen corresponding path program 1 times [2018-12-03 18:47:17,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:17,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:17,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:17,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:17,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:17,616 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 18:47:17,617 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [15], [17], [23], [25] [2018-12-03 18:47:17,618 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:47:17,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:47:17,907 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:47:17,907 INFO L272 AbstractInterpreter]: Visited 7 different actions 70 times. Merged at 5 different actions 49 times. Widened at 4 different actions 26 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:47:17,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:17,943 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:47:17,969 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 55.82% of their original sizes. [2018-12-03 18:47:17,971 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:47:18,288 INFO L418 sIntCurrentIteration]: We unified 8 AI predicates to 8 [2018-12-03 18:47:18,288 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:47:18,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:47:18,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2018-12-03 18:47:18,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:18,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:47:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:47:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:47:18,290 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 7 states. [2018-12-03 18:47:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:18,876 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-03 18:47:18,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:47:18,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 18:47:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:18,877 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:47:18,877 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:47:18,878 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:47:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:47:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-12-03 18:47:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:47:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 18:47:18,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2018-12-03 18:47:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:18,886 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 18:47:18,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:47:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 18:47:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:47:18,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:18,887 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:18,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:18,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash -655877233, now seen corresponding path program 1 times [2018-12-03 18:47:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:18,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:18,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:19,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:19,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:19,044 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-03 18:47:19,044 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [13], [15], [17], [21], [23], [25] [2018-12-03 18:47:19,050 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:47:19,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:47:19,646 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:47:19,646 INFO L272 AbstractInterpreter]: Visited 10 different actions 276 times. Merged at 9 different actions 208 times. Widened at 8 different actions 154 times. Found 50 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:47:19,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:19,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:47:19,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:19,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:19,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:19,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:19,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:19,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:20,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:20,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 18:47:20,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:20,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:47:20,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:47:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:47:20,038 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2018-12-03 18:47:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:20,162 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-12-03 18:47:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:47:20,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 18:47:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:20,165 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:47:20,165 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:47:20,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:47:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:47:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:47:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:47:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 18:47:20,178 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-12-03 18:47:20,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:20,178 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 18:47:20,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:47:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 18:47:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:47:20,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:20,181 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:20,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:20,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:20,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1708107501, now seen corresponding path program 2 times [2018-12-03 18:47:20,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:20,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:20,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:20,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:20,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:20,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:20,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:20,457 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:20,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:20,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:20,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:20,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:20,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:20,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 18:47:20,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:20,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:20,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:20,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:20,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 18:47:20,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:20,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:47:20,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:47:20,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:47:20,719 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2018-12-03 18:47:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:20,872 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-03 18:47:20,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:47:20,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-03 18:47:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:20,873 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:47:20,874 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:47:20,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:47:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:47:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:47:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:47:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 18:47:20,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-03 18:47:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:20,882 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 18:47:20,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:47:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 18:47:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:47:20,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:20,884 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:20,884 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:20,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:20,884 INFO L82 PathProgramCache]: Analyzing trace with hash 710886807, now seen corresponding path program 3 times [2018-12-03 18:47:20,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:20,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:20,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:20,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:20,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:21,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:21,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:21,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:21,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:21,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:21,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:21,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:21,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:21,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:21,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:21,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:21,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:21,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:21,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 18:47:21,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:21,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:47:21,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:47:21,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:47:21,863 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-12-03 18:47:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:21,922 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-03 18:47:21,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:47:21,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-03 18:47:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:21,925 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:47:21,925 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:47:21,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:47:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:47:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:47:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:47:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 18:47:21,937 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-12-03 18:47:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:21,939 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 18:47:21,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:47:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 18:47:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:47:21,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:21,940 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:21,940 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:21,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:21,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1787109659, now seen corresponding path program 4 times [2018-12-03 18:47:21,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:21,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:21,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:21,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:21,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:22,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:22,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:22,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:22,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:22,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:22,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:22,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:22,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:22,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:22,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:22,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:22,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 18:47:22,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:22,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:47:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:47:22,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:47:22,664 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2018-12-03 18:47:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:22,766 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-03 18:47:22,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:47:22,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-03 18:47:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:22,768 INFO L225 Difference]: With dead ends: 35 [2018-12-03 18:47:22,768 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:47:22,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:47:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:47:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:47:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:47:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 18:47:22,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-12-03 18:47:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:22,777 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 18:47:22,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:47:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 18:47:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:47:22,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:22,778 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:22,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:22,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:22,779 INFO L82 PathProgramCache]: Analyzing trace with hash 950152095, now seen corresponding path program 5 times [2018-12-03 18:47:22,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:22,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:22,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:22,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:22,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:22,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:22,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:22,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:22,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 18:47:22,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:22,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:22,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:22,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:22,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 18:47:22,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:22,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:22,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:23,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:23,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 18:47:23,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:23,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:47:23,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:47:23,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:47:23,391 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-12-03 18:47:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:23,452 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-03 18:47:23,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:47:23,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-03 18:47:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:23,453 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:47:23,453 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:47:23,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:47:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:47:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:47:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:47:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 18:47:23,462 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-12-03 18:47:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:23,462 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 18:47:23,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:47:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 18:47:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:47:23,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:23,464 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:23,464 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:23,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash -207182557, now seen corresponding path program 6 times [2018-12-03 18:47:23,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:23,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:23,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:23,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:23,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:23,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:23,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:23,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:23,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:23,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:23,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:23,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:23,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:23,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:23,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:23,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:23,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:24,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:24,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 18:47:24,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:24,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:47:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:47:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:47:24,078 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2018-12-03 18:47:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:24,168 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-03 18:47:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:47:24,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-03 18:47:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:24,169 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:47:24,169 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:47:24,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:47:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:47:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:47:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:47:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 18:47:24,178 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-12-03 18:47:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:24,178 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 18:47:24,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:47:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 18:47:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:47:24,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:24,179 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:24,180 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:24,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash -9253465, now seen corresponding path program 7 times [2018-12-03 18:47:24,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:24,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:24,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:24,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:24,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:24,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:24,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:24,362 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:24,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:24,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:24,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:24,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:24,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:24,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:24,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:24,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:24,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 18:47:24,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:24,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:47:24,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:47:24,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:47:24,636 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2018-12-03 18:47:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:24,784 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-03 18:47:24,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:47:24,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-12-03 18:47:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:24,788 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:47:24,789 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:47:24,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:47:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:47:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:47:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:47:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-03 18:47:24,797 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-12-03 18:47:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:24,798 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-03 18:47:24,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:47:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-03 18:47:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 18:47:24,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:24,799 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:24,799 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:24,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1222042923, now seen corresponding path program 8 times [2018-12-03 18:47:24,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:24,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:24,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:24,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:24,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:24,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:24,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:24,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:24,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:24,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:24,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:24,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:24,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:25,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 18:47:25,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:25,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:25,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:25,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:25,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 18:47:25,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:25,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:47:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:47:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:47:25,336 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 11 states. [2018-12-03 18:47:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:25,429 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-03 18:47:25,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:47:25,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-12-03 18:47:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:25,430 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:47:25,431 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 18:47:25,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:47:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 18:47:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 18:47:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:47:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-03 18:47:25,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-12-03 18:47:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:25,441 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-03 18:47:25,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:47:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-03 18:47:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:47:25,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:25,442 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:25,442 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:25,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -913101905, now seen corresponding path program 9 times [2018-12-03 18:47:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:25,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:25,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:25,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:25,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:25,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:25,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 18:47:25,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:25,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:25,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:25,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:25,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:25,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:25,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:25,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:25,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:25,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 18:47:25,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:25,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:47:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:47:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:47:25,964 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 12 states. [2018-12-03 18:47:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:26,021 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-03 18:47:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:47:26,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 18:47:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:26,028 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:47:26,028 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:47:26,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:47:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:47:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 18:47:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:47:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-03 18:47:26,039 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-12-03 18:47:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:26,039 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-03 18:47:26,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:47:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-03 18:47:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:47:26,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:26,041 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:26,041 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:26,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:26,041 INFO L82 PathProgramCache]: Analyzing trace with hash 207085875, now seen corresponding path program 10 times [2018-12-03 18:47:26,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:26,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:26,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:26,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:26,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:26,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:26,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:26,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:26,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:26,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:26,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:26,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:26,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:26,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:26,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:26,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:26,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 18:47:26,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:26,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:47:26,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:47:26,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:47:26,676 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 13 states. [2018-12-03 18:47:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:26,776 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-03 18:47:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:47:26,777 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 18:47:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:26,778 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:47:26,778 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:47:26,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:47:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:47:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:47:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:47:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-03 18:47:26,785 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-12-03 18:47:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:26,785 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-03 18:47:26,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:47:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-03 18:47:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:47:26,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:26,786 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:26,786 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:26,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1329248841, now seen corresponding path program 11 times [2018-12-03 18:47:26,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:26,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:26,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:26,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:26,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:26,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:26,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:26,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:26,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:26,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:26,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:26,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:26,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:27,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 18:47:27,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:27,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:27,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:27,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:27,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 18:47:27,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:27,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:47:27,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:47:27,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:47:27,317 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 14 states. [2018-12-03 18:47:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:27,374 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-03 18:47:27,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:47:27,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-03 18:47:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:27,376 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:47:27,376 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:47:27,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 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 18:47:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:47:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 18:47:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:47:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-03 18:47:27,385 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-12-03 18:47:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:27,386 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-03 18:47:27,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:47:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-03 18:47:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:47:27,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:27,386 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:27,387 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:27,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash -278161093, now seen corresponding path program 12 times [2018-12-03 18:47:27,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:27,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:27,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:27,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:27,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:27,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:27,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:27,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:27,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:27,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:27,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:27,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:27,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:27,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:27,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:27,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:27,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:27,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:27,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 18:47:27,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:27,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:47:27,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:47:27,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:47:27,866 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 15 states. [2018-12-03 18:47:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:27,917 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-03 18:47:27,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:47:27,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-12-03 18:47:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:27,918 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:47:27,918 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 18:47:27,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:47:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 18:47:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 18:47:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:47:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-12-03 18:47:27,927 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-12-03 18:47:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:27,927 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-12-03 18:47:27,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:47:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-12-03 18:47:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:47:27,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:27,928 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:27,928 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:27,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash 499850175, now seen corresponding path program 13 times [2018-12-03 18:47:27,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:27,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:27,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:27,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:27,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:28,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:28,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:28,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:28,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:28,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:28,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:28,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:28,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:28,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:28,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:28,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:28,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 18:47:28,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:28,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:47:28,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:47:28,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:47:28,666 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 16 states. [2018-12-03 18:47:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:28,772 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-03 18:47:28,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:47:28,776 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-12-03 18:47:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:28,777 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:47:28,777 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:47:28,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:47:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:47:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 18:47:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:47:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-03 18:47:28,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-12-03 18:47:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:28,787 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-03 18:47:28,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:47:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-03 18:47:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:47:28,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:28,788 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:28,788 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:28,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash 844369219, now seen corresponding path program 14 times [2018-12-03 18:47:28,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:28,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:28,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:28,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:28,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:29,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:29,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:29,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:29,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:29,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:29,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:29,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:29,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:29,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 18:47:29,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:29,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:29,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:29,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:29,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 18:47:29,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:29,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:47:29,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:47:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:47:29,603 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 17 states. [2018-12-03 18:47:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:29,655 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-12-03 18:47:29,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:47:29,658 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-12-03 18:47:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:29,659 INFO L225 Difference]: With dead ends: 55 [2018-12-03 18:47:29,659 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:47:29,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:47:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:47:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:47:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:47:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-03 18:47:29,668 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-12-03 18:47:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:29,668 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-03 18:47:29,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:47:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-03 18:47:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:47:29,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:29,669 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:29,669 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:29,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1214688711, now seen corresponding path program 15 times [2018-12-03 18:47:29,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:29,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:29,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:29,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:29,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:29,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:29,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:29,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:29,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:29,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:29,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:29,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:29,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:29,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:29,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:29,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:29,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:30,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:30,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 18:47:30,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:30,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:47:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:47:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:47:30,832 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 18 states. [2018-12-03 18:47:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:30,860 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-12-03 18:47:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:47:30,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-12-03 18:47:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:30,861 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:47:30,862 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 18:47:30,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 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 18:47:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 18:47:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 18:47:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 18:47:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-12-03 18:47:30,876 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2018-12-03 18:47:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:30,876 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-12-03 18:47:30,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:47:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-12-03 18:47:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 18:47:30,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:30,877 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:30,878 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:30,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash 609434955, now seen corresponding path program 16 times [2018-12-03 18:47:30,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:30,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:30,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:31,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:31,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:31,772 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:31,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:31,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:31,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:31,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:31,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:31,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:31,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:32,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:32,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 18:47:32,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:32,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:47:32,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:47:32,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:47:32,731 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 19 states. [2018-12-03 18:47:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:32,783 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-03 18:47:32,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:47:32,784 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-12-03 18:47:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:32,785 INFO L225 Difference]: With dead ends: 59 [2018-12-03 18:47:32,785 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 18:47:32,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:47:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 18:47:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 18:47:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 18:47:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-03 18:47:32,795 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2018-12-03 18:47:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:32,795 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-03 18:47:32,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:47:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-03 18:47:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:47:32,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:32,796 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:32,797 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:32,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1218839601, now seen corresponding path program 17 times [2018-12-03 18:47:32,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:32,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:32,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:32,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:32,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:33,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:33,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:33,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:33,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 18:47:33,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:33,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:33,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:33,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:33,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 18:47:33,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:33,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:33,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:34,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 18:47:34,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:34,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:47:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:47:34,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:47:34,413 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 20 states. [2018-12-03 18:47:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:34,454 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-03 18:47:34,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:47:34,455 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-12-03 18:47:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:34,455 INFO L225 Difference]: With dead ends: 61 [2018-12-03 18:47:34,455 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 18:47:34,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:47:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 18:47:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 18:47:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:47:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-12-03 18:47:34,464 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2018-12-03 18:47:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:34,464 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-12-03 18:47:34,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:47:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-12-03 18:47:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:47:34,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:34,465 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:34,465 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:34,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1549063853, now seen corresponding path program 18 times [2018-12-03 18:47:34,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:34,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:34,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:34,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:34,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:34,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:34,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:34,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:34,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:34,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:34,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:34,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:34,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:34,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:34,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:34,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:35,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:35,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 18:47:35,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:35,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:47:35,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:47:35,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:47:35,303 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 21 states. [2018-12-03 18:47:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:35,370 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-12-03 18:47:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:47:35,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-12-03 18:47:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:35,372 INFO L225 Difference]: With dead ends: 63 [2018-12-03 18:47:35,372 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:47:35,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:47:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:47:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 18:47:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:47:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-03 18:47:35,382 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2018-12-03 18:47:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:35,382 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-03 18:47:35,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:47:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-03 18:47:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:47:35,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:35,383 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:35,383 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:35,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1066990121, now seen corresponding path program 19 times [2018-12-03 18:47:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:35,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:35,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:35,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:35,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:35,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:35,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:35,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:35,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:35,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:35,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:35,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:35,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:36,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:36,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 18:47:36,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:36,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:47:36,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:47:36,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:47:36,233 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 22 states. [2018-12-03 18:47:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:36,476 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-03 18:47:36,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:47:36,476 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-12-03 18:47:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:36,477 INFO L225 Difference]: With dead ends: 65 [2018-12-03 18:47:36,477 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 18:47:36,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:47:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 18:47:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 18:47:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:47:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-03 18:47:36,485 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2018-12-03 18:47:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:36,486 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-03 18:47:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:47:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-03 18:47:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 18:47:36,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:36,486 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:36,486 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:36,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1650601637, now seen corresponding path program 20 times [2018-12-03 18:47:36,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:36,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:36,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:36,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:36,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:36,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:36,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:36,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:36,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:36,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:36,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:36,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 18:47:36,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:36,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:36,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:37,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:37,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 18:47:37,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:37,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:47:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:47:37,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:47:37,737 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 23 states. [2018-12-03 18:47:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:37,805 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-03 18:47:37,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:47:37,805 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-12-03 18:47:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:37,806 INFO L225 Difference]: With dead ends: 67 [2018-12-03 18:47:37,806 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 18:47:37,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:47:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 18:47:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 18:47:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 18:47:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 18:47:37,816 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2018-12-03 18:47:37,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:37,816 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 18:47:37,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:47:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 18:47:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:47:37,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:37,817 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:37,817 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:37,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash 139447263, now seen corresponding path program 21 times [2018-12-03 18:47:37,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:37,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:37,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:38,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:38,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:38,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:38,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:38,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:38,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:38,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:38,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:38,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:38,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:38,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:39,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:39,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 18:47:39,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:39,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:47:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:47:39,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:47:39,051 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 24 states. [2018-12-03 18:47:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:39,142 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-03 18:47:39,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:47:39,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-12-03 18:47:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:39,144 INFO L225 Difference]: With dead ends: 69 [2018-12-03 18:47:39,144 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 18:47:39,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:47:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 18:47:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 18:47:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 18:47:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-03 18:47:39,153 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2018-12-03 18:47:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:39,153 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-03 18:47:39,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:47:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-03 18:47:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 18:47:39,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:39,154 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:39,154 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:39,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1905445533, now seen corresponding path program 22 times [2018-12-03 18:47:39,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:39,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:39,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:39,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:39,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:39,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:39,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:39,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:39,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:39,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:39,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:39,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:39,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:39,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:40,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:40,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 18:47:40,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:40,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:47:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:47:40,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:47:40,300 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 25 states. [2018-12-03 18:47:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:40,360 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-03 18:47:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:47:40,360 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-12-03 18:47:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:40,361 INFO L225 Difference]: With dead ends: 71 [2018-12-03 18:47:40,361 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 18:47:40,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:47:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 18:47:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 18:47:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 18:47:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-03 18:47:40,373 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2018-12-03 18:47:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:40,373 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-03 18:47:40,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:47:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-03 18:47:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:47:40,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:40,374 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:40,374 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:40,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:40,374 INFO L82 PathProgramCache]: Analyzing trace with hash 47599079, now seen corresponding path program 23 times [2018-12-03 18:47:40,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:40,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:40,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:40,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:40,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:40,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:40,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:40,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:40,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 18:47:40,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:40,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:40,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:40,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:40,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 18:47:40,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:40,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:40,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:41,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:41,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 18:47:41,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:41,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 18:47:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 18:47:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:47:41,565 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 26 states. [2018-12-03 18:47:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:41,648 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-03 18:47:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:47:41,649 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-12-03 18:47:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:41,649 INFO L225 Difference]: With dead ends: 73 [2018-12-03 18:47:41,650 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 18:47:41,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:47:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 18:47:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 18:47:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 18:47:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-03 18:47:41,659 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2018-12-03 18:47:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:41,659 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-03 18:47:41,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 18:47:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-03 18:47:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 18:47:41,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:41,660 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:41,660 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:41,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash 22762859, now seen corresponding path program 24 times [2018-12-03 18:47:41,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:41,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:41,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:41,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:42,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:42,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:42,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:42,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 18:47:42,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:42,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:42,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:42,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:42,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:42,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:42,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:42,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:42,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:42,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 18:47:42,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:42,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:47:42,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:47:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:47:42,792 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 27 states. [2018-12-03 18:47:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:42,828 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-03 18:47:42,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:47:42,828 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-12-03 18:47:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:42,829 INFO L225 Difference]: With dead ends: 75 [2018-12-03 18:47:42,829 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 18:47:42,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:47:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 18:47:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 18:47:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:47:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-12-03 18:47:42,839 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2018-12-03 18:47:42,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:42,839 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-12-03 18:47:42,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:47:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-12-03 18:47:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 18:47:42,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:42,840 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:42,840 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:42,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1924959215, now seen corresponding path program 25 times [2018-12-03 18:47:42,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:42,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:42,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:43,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:43,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:43,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:43,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:43,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:43,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:43,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:43,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:43,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:43,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:44,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:44,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 18:47:44,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:44,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:47:44,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:47:44,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:47:44,909 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 28 states. [2018-12-03 18:47:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:45,061 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-03 18:47:45,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:47:45,061 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-12-03 18:47:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:45,062 INFO L225 Difference]: With dead ends: 77 [2018-12-03 18:47:45,062 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 18:47:45,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:47:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 18:47:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 18:47:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 18:47:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 18:47:45,073 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2018-12-03 18:47:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:45,073 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 18:47:45,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:47:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 18:47:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 18:47:45,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:45,074 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:45,074 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:45,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash 279589235, now seen corresponding path program 26 times [2018-12-03 18:47:45,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:45,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:45,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:45,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:45,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:45,777 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:45,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:45,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:45,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:45,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:45,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:45,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 18:47:45,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:45,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:45,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:46,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:46,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 18:47:46,669 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:46,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:47:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:47:46,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:47:46,670 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 29 states. [2018-12-03 18:47:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:46,770 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-03 18:47:46,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:47:46,770 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-12-03 18:47:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:46,771 INFO L225 Difference]: With dead ends: 79 [2018-12-03 18:47:46,771 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 18:47:46,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:47:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 18:47:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 18:47:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:47:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-03 18:47:46,783 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2018-12-03 18:47:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:46,783 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-03 18:47:46,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:47:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-03 18:47:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 18:47:46,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:46,784 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:46,784 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:46,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -372996617, now seen corresponding path program 27 times [2018-12-03 18:47:46,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:46,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:46,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:47,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:47,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:47,377 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:47,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:47,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:47,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:47,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:47,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:47,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:47,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:47,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:47,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:48,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:48,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 18:47:48,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:48,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:47:48,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:47:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:47:48,420 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 30 states. [2018-12-03 18:47:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:48,484 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-03 18:47:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:47:48,484 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-12-03 18:47:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:48,485 INFO L225 Difference]: With dead ends: 81 [2018-12-03 18:47:48,485 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 18:47:48,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:47:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 18:47:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 18:47:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 18:47:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-03 18:47:48,493 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2018-12-03 18:47:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:48,494 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-03 18:47:48,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:47:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-03 18:47:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 18:47:48,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:48,494 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:48,494 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:48,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash -442775173, now seen corresponding path program 28 times [2018-12-03 18:47:48,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:48,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:48,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:48,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:49,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:49,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:49,716 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:49,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:49,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:49,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:49,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:49,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:49,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:49,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:50,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:50,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 18:47:50,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:50,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:47:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:47:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:47:50,737 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 31 states. [2018-12-03 18:47:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:50,843 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-03 18:47:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:47:50,843 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-12-03 18:47:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:50,844 INFO L225 Difference]: With dead ends: 83 [2018-12-03 18:47:50,845 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 18:47:50,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:47:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 18:47:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 18:47:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 18:47:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-12-03 18:47:50,854 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2018-12-03 18:47:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:50,855 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-12-03 18:47:50,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:47:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-12-03 18:47:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 18:47:50,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:50,855 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:50,856 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:50,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1219509247, now seen corresponding path program 29 times [2018-12-03 18:47:50,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:50,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:50,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:50,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:51,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:51,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:51,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:51,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:51,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:51,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:51,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:51,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 18:47:51,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:51,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:51,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:52,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:52,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 18:47:52,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:52,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:47:52,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:47:52,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:47:52,513 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 32 states. [2018-12-03 18:47:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:52,568 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-03 18:47:52,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:47:52,569 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-12-03 18:47:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:52,570 INFO L225 Difference]: With dead ends: 85 [2018-12-03 18:47:52,570 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 18:47:52,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:47:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 18:47:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 18:47:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 18:47:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-03 18:47:52,582 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2018-12-03 18:47:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:52,582 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-03 18:47:52,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:47:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-03 18:47:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 18:47:52,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:52,583 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:52,583 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:52,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash 947002755, now seen corresponding path program 30 times [2018-12-03 18:47:52,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:52,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:52,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:52,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:52,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:53,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:53,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:53,099 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:53,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:53,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:53,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:53,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:53,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:53,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:53,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:53,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:53,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:54,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:54,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 18:47:54,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:54,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:47:54,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:47:54,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:47:54,355 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 33 states. [2018-12-03 18:47:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:54,493 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-03 18:47:54,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:47:54,493 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2018-12-03 18:47:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:54,494 INFO L225 Difference]: With dead ends: 87 [2018-12-03 18:47:54,494 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 18:47:54,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:47:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 18:47:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 18:47:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 18:47:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-12-03 18:47:54,505 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2018-12-03 18:47:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:54,505 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-12-03 18:47:54,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:47:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-12-03 18:47:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:47:54,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:54,506 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:54,506 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:54,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1061268999, now seen corresponding path program 31 times [2018-12-03 18:47:54,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:54,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:54,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:54,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:54,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:55,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:55,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:55,177 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:55,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:55,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:55,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:55,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:55,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:55,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:55,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:56,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 18:47:56,346 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:56,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:47:56,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:47:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:47:56,347 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 34 states. [2018-12-03 18:47:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:56,436 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-03 18:47:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:47:56,437 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-12-03 18:47:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:56,438 INFO L225 Difference]: With dead ends: 89 [2018-12-03 18:47:56,438 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 18:47:56,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:47:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 18:47:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 18:47:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 18:47:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-12-03 18:47:56,447 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2018-12-03 18:47:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:56,448 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-12-03 18:47:56,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:47:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-12-03 18:47:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 18:47:56,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:56,448 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:56,449 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:56,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash -798020213, now seen corresponding path program 32 times [2018-12-03 18:47:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:56,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:56,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:56,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:56,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:56,985 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:56,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:56,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:56,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:47:56,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:56,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:57,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 18:47:57,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:57,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:57,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:58,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:58,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 18:47:58,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:58,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:47:58,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:47:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:47:58,538 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 35 states. [2018-12-03 18:47:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:58,650 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-03 18:47:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:47:58,651 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2018-12-03 18:47:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:58,652 INFO L225 Difference]: With dead ends: 91 [2018-12-03 18:47:58,652 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 18:47:58,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:47:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 18:47:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 18:47:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 18:47:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-03 18:47:58,661 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2018-12-03 18:47:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:58,661 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-03 18:47:58,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:47:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-03 18:47:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 18:47:58,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:58,662 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:47:58,662 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:58,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash -868557809, now seen corresponding path program 33 times [2018-12-03 18:47:58,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:58,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:58,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:58,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:58,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:00,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:00,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:00,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:00,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:00,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:00,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:00,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:00,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:00,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:00,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:00,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:00,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:01,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:01,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 18:48:01,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:01,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:48:01,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:48:01,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:48:01,641 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 36 states. [2018-12-03 18:48:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:01,859 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-12-03 18:48:01,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:48:01,859 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-12-03 18:48:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:01,860 INFO L225 Difference]: With dead ends: 93 [2018-12-03 18:48:01,860 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 18:48:01,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:48:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 18:48:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 18:48:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 18:48:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-12-03 18:48:01,869 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2018-12-03 18:48:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:01,869 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-12-03 18:48:01,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:48:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-12-03 18:48:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 18:48:01,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:01,870 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:01,870 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:01,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 64289171, now seen corresponding path program 34 times [2018-12-03 18:48:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:01,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:01,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:03,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:03,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:03,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:03,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:03,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:03,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:03,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:03,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:03,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:03,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:05,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:05,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 18:48:05,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:05,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:48:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:48:05,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:48:05,050 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 37 states. [2018-12-03 18:48:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:05,163 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-03 18:48:05,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:48:05,164 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-12-03 18:48:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:05,165 INFO L225 Difference]: With dead ends: 95 [2018-12-03 18:48:05,165 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 18:48:05,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:48:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 18:48:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 18:48:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 18:48:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-03 18:48:05,175 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2018-12-03 18:48:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:05,175 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-03 18:48:05,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:48:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-03 18:48:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 18:48:05,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:05,176 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:05,176 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:05,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:05,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1117927913, now seen corresponding path program 35 times [2018-12-03 18:48:05,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:05,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:05,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:05,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:05,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:05,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:05,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:05,870 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:05,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:05,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:05,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:05,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:05,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:05,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 18:48:05,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:05,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:05,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:07,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:07,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 18:48:07,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:07,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 18:48:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 18:48:07,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:48:07,398 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2018-12-03 18:48:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:07,491 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-12-03 18:48:07,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:48:07,492 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-12-03 18:48:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:07,493 INFO L225 Difference]: With dead ends: 97 [2018-12-03 18:48:07,493 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 18:48:07,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:48:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 18:48:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 18:48:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 18:48:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-12-03 18:48:07,506 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2018-12-03 18:48:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:07,506 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-12-03 18:48:07,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 18:48:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-12-03 18:48:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 18:48:07,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:07,507 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:07,507 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:07,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:07,508 INFO L82 PathProgramCache]: Analyzing trace with hash 937787803, now seen corresponding path program 36 times [2018-12-03 18:48:07,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:07,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:07,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:08,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:08,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:08,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:08,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:08,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:08,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:08,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:08,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:08,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:08,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:10,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:10,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 18:48:10,483 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:10,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:48:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:48:10,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:48:10,484 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 39 states. [2018-12-03 18:48:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:10,566 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-03 18:48:10,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:48:10,566 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2018-12-03 18:48:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:10,567 INFO L225 Difference]: With dead ends: 99 [2018-12-03 18:48:10,567 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 18:48:10,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:48:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 18:48:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 18:48:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 18:48:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-12-03 18:48:10,580 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2018-12-03 18:48:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:10,580 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-12-03 18:48:10,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:48:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-12-03 18:48:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 18:48:10,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:10,581 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:10,581 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:10,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 795634719, now seen corresponding path program 37 times [2018-12-03 18:48:10,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:10,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:10,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:10,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:10,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:11,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:11,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:11,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:11,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:11,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:11,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:11,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:11,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:11,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:12,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:12,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 18:48:12,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:12,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:48:12,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:48:12,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:48:12,881 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 40 states. [2018-12-03 18:48:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:12,963 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-12-03 18:48:12,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:48:12,964 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 87 [2018-12-03 18:48:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:12,965 INFO L225 Difference]: With dead ends: 101 [2018-12-03 18:48:12,965 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 18:48:12,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:48:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 18:48:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 18:48:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 18:48:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-03 18:48:12,977 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 87 [2018-12-03 18:48:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:12,978 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-03 18:48:12,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:48:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-03 18:48:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 18:48:12,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:12,978 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:12,979 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:12,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1625474467, now seen corresponding path program 38 times [2018-12-03 18:48:12,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:13,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:13,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:13,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:13,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:13,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:13,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:13,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:13,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:13,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 18:48:13,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:13,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:13,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:15,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:15,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 18:48:15,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:15,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:48:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:48:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:48:15,891 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 41 states. [2018-12-03 18:48:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:15,979 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-12-03 18:48:15,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:48:15,980 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 89 [2018-12-03 18:48:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:15,981 INFO L225 Difference]: With dead ends: 103 [2018-12-03 18:48:15,981 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 18:48:15,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:48:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 18:48:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 18:48:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 18:48:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-12-03 18:48:15,993 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 89 [2018-12-03 18:48:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:15,993 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-12-03 18:48:15,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:48:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-12-03 18:48:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 18:48:15,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:15,994 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:15,994 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:15,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:15,994 INFO L82 PathProgramCache]: Analyzing trace with hash 237555239, now seen corresponding path program 39 times [2018-12-03 18:48:15,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:15,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:15,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:15,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:15,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:16,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:16,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:16,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:16,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:16,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:16,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:16,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:16,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:16,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:16,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:16,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:16,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:18,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:18,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 18:48:18,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:18,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:48:18,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:48:18,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:48:18,640 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 42 states. [2018-12-03 18:48:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:18,883 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-12-03 18:48:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:48:18,884 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 91 [2018-12-03 18:48:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:18,885 INFO L225 Difference]: With dead ends: 105 [2018-12-03 18:48:18,885 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 18:48:18,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:48:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 18:48:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 18:48:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 18:48:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-12-03 18:48:18,896 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2018-12-03 18:48:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:18,897 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-12-03 18:48:18,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:48:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-12-03 18:48:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 18:48:18,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:18,897 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:18,897 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:18,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:18,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2112961109, now seen corresponding path program 40 times [2018-12-03 18:48:18,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:18,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:18,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:18,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:18,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:19,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:19,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:19,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:19,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:19,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:19,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:19,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:19,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:19,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:19,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:22,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:22,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 18:48:22,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:22,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:48:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:48:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:48:22,052 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 43 states. [2018-12-03 18:48:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:22,160 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-12-03 18:48:22,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:48:22,161 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 93 [2018-12-03 18:48:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:22,162 INFO L225 Difference]: With dead ends: 107 [2018-12-03 18:48:22,162 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 18:48:22,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:48:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 18:48:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 18:48:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 18:48:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-12-03 18:48:22,174 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 93 [2018-12-03 18:48:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:22,174 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-12-03 18:48:22,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:48:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-12-03 18:48:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 18:48:22,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:22,175 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:22,175 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:22,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1806373841, now seen corresponding path program 41 times [2018-12-03 18:48:22,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:22,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:22,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:23,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:23,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:23,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:23,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:23,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:23,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:23,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:23,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:23,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 18:48:23,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:23,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:23,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1731 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:25,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:25,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 18:48:25,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:25,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:48:25,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:48:25,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:48:25,636 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 44 states. [2018-12-03 18:48:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:25,756 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-12-03 18:48:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:48:25,757 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 95 [2018-12-03 18:48:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:25,758 INFO L225 Difference]: With dead ends: 109 [2018-12-03 18:48:25,758 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 18:48:25,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:48:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 18:48:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 18:48:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 18:48:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-03 18:48:25,770 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 95 [2018-12-03 18:48:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:25,770 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-03 18:48:25,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:48:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-03 18:48:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 18:48:25,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:25,771 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:25,771 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:25,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash 766214579, now seen corresponding path program 42 times [2018-12-03 18:48:25,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:25,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:25,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:25,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:27,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:27,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:27,057 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:27,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:27,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:27,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:27,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:27,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:27,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:27,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:27,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:27,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:29,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:29,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 18:48:29,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:29,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:48:29,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:48:29,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:48:29,332 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 45 states. [2018-12-03 18:48:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:29,698 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-12-03 18:48:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:48:29,699 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 97 [2018-12-03 18:48:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:29,700 INFO L225 Difference]: With dead ends: 111 [2018-12-03 18:48:29,700 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 18:48:29,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:48:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 18:48:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 18:48:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 18:48:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-03 18:48:29,712 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 97 [2018-12-03 18:48:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:29,712 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-03 18:48:29,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:48:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-03 18:48:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 18:48:29,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:29,713 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:29,713 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:29,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:29,714 INFO L82 PathProgramCache]: Analyzing trace with hash -877476297, now seen corresponding path program 43 times [2018-12-03 18:48:29,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:29,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:29,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:29,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:29,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:30,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:30,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:30,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:30,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:30,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:30,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:30,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:30,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:31,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:31,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:33,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:33,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 18:48:33,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:33,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 18:48:33,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 18:48:33,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:48:33,400 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 46 states. [2018-12-03 18:48:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:33,504 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-12-03 18:48:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:48:33,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 99 [2018-12-03 18:48:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:33,513 INFO L225 Difference]: With dead ends: 113 [2018-12-03 18:48:33,513 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 18:48:33,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:48:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 18:48:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 18:48:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 18:48:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-12-03 18:48:33,529 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 99 [2018-12-03 18:48:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:33,529 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-12-03 18:48:33,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 18:48:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-12-03 18:48:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 18:48:33,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:33,531 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:33,531 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:33,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 83556795, now seen corresponding path program 44 times [2018-12-03 18:48:33,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:33,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:33,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:33,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:33,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:36,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:36,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:36,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:36,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:36,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:36,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:36,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:36,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:36,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 18:48:36,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:36,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:36,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:39,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:39,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 18:48:39,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:39,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:48:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:48:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:48:39,127 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 47 states. [2018-12-03 18:48:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:39,321 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-12-03 18:48:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:48:39,322 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 101 [2018-12-03 18:48:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:39,323 INFO L225 Difference]: With dead ends: 115 [2018-12-03 18:48:39,323 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 18:48:39,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:48:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 18:48:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 18:48:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 18:48:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-03 18:48:39,339 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 101 [2018-12-03 18:48:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:39,339 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-03 18:48:39,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:48:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-03 18:48:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 18:48:39,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:39,340 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:39,340 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:39,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash 218389567, now seen corresponding path program 45 times [2018-12-03 18:48:39,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:39,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:39,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:39,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:39,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:40,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:40,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:40,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:40,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:40,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:40,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:40,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:40,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:40,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:40,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:40,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:40,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:42,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:42,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 18:48:42,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:42,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:48:42,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:48:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:48:42,846 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 48 states. [2018-12-03 18:48:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:42,928 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-12-03 18:48:42,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:48:42,929 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 103 [2018-12-03 18:48:42,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:42,930 INFO L225 Difference]: With dead ends: 117 [2018-12-03 18:48:42,930 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 18:48:42,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:48:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 18:48:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 18:48:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 18:48:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-03 18:48:42,947 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 103 [2018-12-03 18:48:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:42,947 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-03 18:48:42,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:48:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-03 18:48:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 18:48:42,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:42,948 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:42,948 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:42,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash 943664579, now seen corresponding path program 46 times [2018-12-03 18:48:42,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:42,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:42,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:44,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:44,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:44,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:44,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:44,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:44,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:44,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:44,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:44,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:44,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:47,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:47,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 18:48:47,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:47,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:48:47,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:48:47,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:48:47,301 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 49 states. [2018-12-03 18:48:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:47,431 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-12-03 18:48:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:48:47,432 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 105 [2018-12-03 18:48:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:47,433 INFO L225 Difference]: With dead ends: 119 [2018-12-03 18:48:47,433 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 18:48:47,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:48:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 18:48:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 18:48:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 18:48:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-03 18:48:47,448 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2018-12-03 18:48:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:47,448 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-03 18:48:47,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:48:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-03 18:48:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 18:48:47,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:47,449 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:47,449 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:47,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2146718137, now seen corresponding path program 47 times [2018-12-03 18:48:47,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:47,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:47,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:48,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:48,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:48,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:48,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:48,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:48,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:48,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:48,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:48,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 18:48:48,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:48,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:48,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:51,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:51,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 18:48:51,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:51,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 18:48:51,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 18:48:51,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:48:51,462 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2018-12-03 18:48:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:51,577 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-12-03 18:48:51,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:48:51,577 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2018-12-03 18:48:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:51,578 INFO L225 Difference]: With dead ends: 121 [2018-12-03 18:48:51,579 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 18:48:51,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:48:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 18:48:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 18:48:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 18:48:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-12-03 18:48:51,595 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 107 [2018-12-03 18:48:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:51,595 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-12-03 18:48:51,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 18:48:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-12-03 18:48:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 18:48:51,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:51,596 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:51,597 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:51,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash 112860619, now seen corresponding path program 48 times [2018-12-03 18:48:51,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:51,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:51,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:52,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:52,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:52,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:52,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:52,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:52,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:52,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:52,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:52,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:52,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:52,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:52,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:55,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:55,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 18:48:55,327 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:55,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:48:55,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:48:55,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:48:55,328 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 51 states. [2018-12-03 18:48:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:55,440 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-12-03 18:48:55,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:48:55,440 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 109 [2018-12-03 18:48:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:55,441 INFO L225 Difference]: With dead ends: 123 [2018-12-03 18:48:55,442 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 18:48:55,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:48:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 18:48:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 18:48:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 18:48:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-03 18:48:55,454 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 109 [2018-12-03 18:48:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:55,454 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-03 18:48:55,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:48:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-03 18:48:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 18:48:55,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:55,455 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:48:55,456 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:55,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1685406641, now seen corresponding path program 49 times [2018-12-03 18:48:55,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:55,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:55,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:56,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:56,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:56,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:56,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:56,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:56,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:48:56,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:56,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:56,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:56,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:48:59,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:59,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 18:48:59,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:59,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:48:59,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:48:59,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:48:59,922 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 52 states. [2018-12-03 18:49:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:00,055 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-12-03 18:49:00,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:49:00,055 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 111 [2018-12-03 18:49:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:00,057 INFO L225 Difference]: With dead ends: 125 [2018-12-03 18:49:00,057 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 18:49:00,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 18:49:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 18:49:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 18:49:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-12-03 18:49:00,072 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2018-12-03 18:49:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:00,072 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-12-03 18:49:00,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:49:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-12-03 18:49:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 18:49:00,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:00,073 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:00,073 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:00,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1051576787, now seen corresponding path program 50 times [2018-12-03 18:49:00,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:00,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:00,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:01,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:01,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:01,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:01,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:01,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:01,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:01,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:01,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:01,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 18:49:01,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:01,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:01,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:04,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:04,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 18:49:04,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:04,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:49:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:49:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 18:49:04,519 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 53 states. [2018-12-03 18:49:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:04,628 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-12-03 18:49:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:49:04,629 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 113 [2018-12-03 18:49:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:04,630 INFO L225 Difference]: With dead ends: 127 [2018-12-03 18:49:04,630 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 18:49:04,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 18:49:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 18:49:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 18:49:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 18:49:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-12-03 18:49:04,646 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 113 [2018-12-03 18:49:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:04,646 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-12-03 18:49:04,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:49:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-12-03 18:49:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 18:49:04,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:04,647 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:04,647 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:04,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:04,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1522301353, now seen corresponding path program 51 times [2018-12-03 18:49:04,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:04,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:04,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:05,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:05,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:05,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:05,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:05,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:05,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:05,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:05,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:05,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:05,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:05,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:05,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:09,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:09,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 18:49:09,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:09,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 18:49:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 18:49:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:49:09,273 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 54 states. [2018-12-03 18:49:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:09,376 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-12-03 18:49:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 18:49:09,377 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 115 [2018-12-03 18:49:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:09,378 INFO L225 Difference]: With dead ends: 129 [2018-12-03 18:49:09,378 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 18:49:09,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:49:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 18:49:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 18:49:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 18:49:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-12-03 18:49:09,395 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 115 [2018-12-03 18:49:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:09,396 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-12-03 18:49:09,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 18:49:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-12-03 18:49:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 18:49:09,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:09,397 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:09,397 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:09,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1118031397, now seen corresponding path program 52 times [2018-12-03 18:49:09,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:09,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:09,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:09,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:10,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:10,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:10,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:10,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:10,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:10,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:10,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:10,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:10,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:14,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:14,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 18:49:14,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:14,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 18:49:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 18:49:14,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 18:49:14,233 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 55 states. [2018-12-03 18:49:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:14,328 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-12-03 18:49:14,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:49:14,329 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 117 [2018-12-03 18:49:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:14,329 INFO L225 Difference]: With dead ends: 131 [2018-12-03 18:49:14,329 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 18:49:14,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 180 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 18:49:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 18:49:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 18:49:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 18:49:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-12-03 18:49:14,343 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 117 [2018-12-03 18:49:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:14,343 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-12-03 18:49:14,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 18:49:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-12-03 18:49:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 18:49:14,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:14,344 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:14,344 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:14,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash 838339679, now seen corresponding path program 53 times [2018-12-03 18:49:14,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:14,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:15,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:15,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:15,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:15,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:15,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:15,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:15,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:15,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:15,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 18:49:15,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:15,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:15,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:19,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 18:49:19,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:19,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 18:49:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 18:49:19,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 18:49:19,281 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 56 states. [2018-12-03 18:49:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:19,393 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-12-03 18:49:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:49:19,394 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 119 [2018-12-03 18:49:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:19,395 INFO L225 Difference]: With dead ends: 133 [2018-12-03 18:49:19,395 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 18:49:19,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 18:49:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 18:49:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 18:49:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 18:49:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-03 18:49:19,411 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 119 [2018-12-03 18:49:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:19,411 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-03 18:49:19,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 18:49:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-03 18:49:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 18:49:19,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:19,412 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:19,413 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:19,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash -284731933, now seen corresponding path program 54 times [2018-12-03 18:49:19,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:19,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:19,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:19,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:19,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:20,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:20,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:20,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:20,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:20,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:20,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:20,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:20,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:20,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:20,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:20,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:20,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:24,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:24,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 18:49:24,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:24,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 18:49:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 18:49:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:49:24,255 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 57 states. [2018-12-03 18:49:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:24,427 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-03 18:49:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 18:49:24,428 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 121 [2018-12-03 18:49:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:24,429 INFO L225 Difference]: With dead ends: 135 [2018-12-03 18:49:24,429 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 18:49:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:49:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 18:49:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 18:49:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 18:49:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-12-03 18:49:24,446 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 121 [2018-12-03 18:49:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:24,446 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-12-03 18:49:24,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 18:49:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-12-03 18:49:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 18:49:24,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:24,447 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:24,448 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:24,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1519759769, now seen corresponding path program 55 times [2018-12-03 18:49:24,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:24,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:24,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:24,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:24,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3089 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:25,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:25,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:25,636 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:25,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:25,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:25,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:25,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:25,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:25,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3089 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:25,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3089 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:29,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:29,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 18:49:29,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:29,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 18:49:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 18:49:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 18:49:29,407 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 58 states. [2018-12-03 18:49:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:29,506 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-12-03 18:49:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 18:49:29,506 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 123 [2018-12-03 18:49:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:29,507 INFO L225 Difference]: With dead ends: 137 [2018-12-03 18:49:29,507 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 18:49:29,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 18:49:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 18:49:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 18:49:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 18:49:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-12-03 18:49:29,521 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 123 [2018-12-03 18:49:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:29,521 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-12-03 18:49:29,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 18:49:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-12-03 18:49:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 18:49:29,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:29,522 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:29,522 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:29,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:29,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1324430827, now seen corresponding path program 56 times [2018-12-03 18:49:29,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:29,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:29,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:30,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:30,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:30,762 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:30,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:30,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:30,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:30,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:30,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:30,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 18:49:30,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:30,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:30,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3201 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:34,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:34,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 18:49:34,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:34,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 18:49:34,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 18:49:34,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 18:49:34,684 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 59 states. [2018-12-03 18:49:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:34,843 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-12-03 18:49:34,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:49:34,843 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 125 [2018-12-03 18:49:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:34,844 INFO L225 Difference]: With dead ends: 139 [2018-12-03 18:49:34,844 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 18:49:34,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 18:49:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 18:49:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 18:49:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 18:49:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-12-03 18:49:34,860 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 125 [2018-12-03 18:49:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:34,860 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-12-03 18:49:34,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 18:49:34,860 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-12-03 18:49:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 18:49:34,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:34,861 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:34,861 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:34,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1302573969, now seen corresponding path program 57 times [2018-12-03 18:49:34,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:34,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:34,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:36,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:36,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:36,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:36,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:36,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:36,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:36,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:36,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:36,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:36,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:36,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:36,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3315 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:40,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:40,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 18:49:40,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:40,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 18:49:40,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 18:49:40,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:49:40,128 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 60 states. [2018-12-03 18:49:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:40,306 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-12-03 18:49:40,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:49:40,307 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 127 [2018-12-03 18:49:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:40,308 INFO L225 Difference]: With dead ends: 141 [2018-12-03 18:49:40,308 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 18:49:40,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:49:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 18:49:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 18:49:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 18:49:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-12-03 18:49:40,323 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 127 [2018-12-03 18:49:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:40,323 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-12-03 18:49:40,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 18:49:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-12-03 18:49:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 18:49:40,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:40,324 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:40,324 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:40,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash -413412877, now seen corresponding path program 58 times [2018-12-03 18:49:40,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:40,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:40,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:41,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:41,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:41,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:41,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:41,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:41,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:41,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:41,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:41,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:41,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3431 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:45,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:45,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 18:49:45,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:45,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 18:49:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 18:49:45,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 18:49:45,756 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 61 states. [2018-12-03 18:49:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:45,919 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-03 18:49:45,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 18:49:45,919 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 129 [2018-12-03 18:49:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:45,920 INFO L225 Difference]: With dead ends: 143 [2018-12-03 18:49:45,921 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 18:49:45,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 198 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 18:49:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 18:49:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 18:49:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 18:49:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-12-03 18:49:45,935 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 129 [2018-12-03 18:49:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:45,935 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-12-03 18:49:45,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 18:49:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-12-03 18:49:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 18:49:45,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:45,936 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:45,936 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:45,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash -628095369, now seen corresponding path program 59 times [2018-12-03 18:49:45,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:45,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:45,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3549 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:47,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:47,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:47,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:47,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:47,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:47,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:47,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:47,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:47,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 18:49:47,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:47,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3549 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:47,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3549 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:51,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:51,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 18:49:51,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:51,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 18:49:51,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 18:49:51,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 18:49:51,565 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 62 states. [2018-12-03 18:49:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:51,769 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-12-03 18:49:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 18:49:51,769 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 131 [2018-12-03 18:49:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:51,770 INFO L225 Difference]: With dead ends: 145 [2018-12-03 18:49:51,770 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 18:49:51,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 18:49:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 18:49:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 18:49:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 18:49:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-12-03 18:49:51,787 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 131 [2018-12-03 18:49:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:51,787 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-12-03 18:49:51,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 18:49:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-12-03 18:49:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 18:49:51,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:51,788 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:51,789 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:51,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash -779539973, now seen corresponding path program 60 times [2018-12-03 18:49:51,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:51,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:51,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:51,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:51,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3669 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:53,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:53,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:53,613 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:53,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:53,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:53,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:49:53,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:53,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:53,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:53,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:53,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3669 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:53,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3669 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:49:58,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:58,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 18:49:58,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:58,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 18:49:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 18:49:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:49:58,911 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 63 states. [2018-12-03 18:49:59,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:59,035 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-12-03 18:49:59,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 18:49:59,035 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 133 [2018-12-03 18:49:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:59,036 INFO L225 Difference]: With dead ends: 147 [2018-12-03 18:49:59,036 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 18:49:59,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:49:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 18:49:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 18:49:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 18:49:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-03 18:49:59,049 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 133 [2018-12-03 18:49:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:59,050 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-03 18:49:59,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 18:49:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-03 18:49:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 18:49:59,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:59,051 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:49:59,051 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:59,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash -288916353, now seen corresponding path program 61 times [2018-12-03 18:49:59,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:59,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:59,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:59,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:59,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:00,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:00,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:00,494 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:00,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:00,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:00,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:00,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:00,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:50:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:00,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:00,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:05,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:05,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 18:50:05,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:05,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 18:50:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 18:50:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 18:50:05,468 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 64 states. [2018-12-03 18:50:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:05,654 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-12-03 18:50:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:50:05,655 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 135 [2018-12-03 18:50:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:05,656 INFO L225 Difference]: With dead ends: 149 [2018-12-03 18:50:05,656 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 18:50:05,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 18:50:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 18:50:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 18:50:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 18:50:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-12-03 18:50:05,670 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 135 [2018-12-03 18:50:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:05,670 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-12-03 18:50:05,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 18:50:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-12-03 18:50:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 18:50:05,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:05,671 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:50:05,672 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:05,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1246020093, now seen corresponding path program 62 times [2018-12-03 18:50:05,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:05,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:05,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:07,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:07,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:07,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:07,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:07,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:07,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:50:07,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:50:07,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 18:50:07,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:07,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:07,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:11,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:11,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 18:50:11,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:11,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 18:50:11,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 18:50:11,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 18:50:11,830 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 65 states. [2018-12-03 18:50:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:12,048 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-12-03 18:50:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 18:50:12,051 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 137 [2018-12-03 18:50:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:12,051 INFO L225 Difference]: With dead ends: 151 [2018-12-03 18:50:12,051 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 18:50:12,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 18:50:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 18:50:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 18:50:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 18:50:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-12-03 18:50:12,066 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 137 [2018-12-03 18:50:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:12,066 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-12-03 18:50:12,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 18:50:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-12-03 18:50:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 18:50:12,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:12,067 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:50:12,067 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:12,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1899712889, now seen corresponding path program 63 times [2018-12-03 18:50:12,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:12,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:12,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:12,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:12,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:13,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:13,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:13,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:13,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:13,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:13,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:13,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:50:13,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:50:13,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:50:13,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:13,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:13,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:18,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:18,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 18:50:18,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:18,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 18:50:18,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 18:50:18,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:50:18,581 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 66 states. [2018-12-03 18:50:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:18,754 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-12-03 18:50:18,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 18:50:18,755 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 139 [2018-12-03 18:50:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:18,756 INFO L225 Difference]: With dead ends: 153 [2018-12-03 18:50:18,756 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 18:50:18,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:50:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 18:50:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 18:50:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 18:50:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-12-03 18:50:18,772 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 139 [2018-12-03 18:50:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:18,772 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-12-03 18:50:18,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 18:50:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2018-12-03 18:50:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 18:50:18,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:18,773 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:50:18,773 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:18,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1261702667, now seen corresponding path program 64 times [2018-12-03 18:50:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:18,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:18,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4169 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:20,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:20,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:20,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:20,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:20,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:20,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:20,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:20,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:50:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:20,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4169 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:20,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4169 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:25,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:25,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 18:50:25,033 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:25,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 18:50:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 18:50:25,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 18:50:25,034 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 67 states. [2018-12-03 18:50:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:25,236 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-12-03 18:50:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 18:50:25,236 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 141 [2018-12-03 18:50:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:25,238 INFO L225 Difference]: With dead ends: 155 [2018-12-03 18:50:25,238 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 18:50:25,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 18:50:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 18:50:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 18:50:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 18:50:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-12-03 18:50:25,257 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 141 [2018-12-03 18:50:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:25,258 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-12-03 18:50:25,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 18:50:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-12-03 18:50:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 18:50:25,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:25,259 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:50:25,259 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:25,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1454793585, now seen corresponding path program 65 times [2018-12-03 18:50:25,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:25,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:25,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:25,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:25,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:27,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:27,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:27,557 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:27,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:27,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:27,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:50:27,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:50:27,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 18:50:27,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:27,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:27,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4299 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:32,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:32,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 18:50:32,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:32,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 18:50:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 18:50:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:50:32,613 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 68 states. [2018-12-03 18:50:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:33,368 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-12-03 18:50:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:50:33,369 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 143 [2018-12-03 18:50:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:33,370 INFO L225 Difference]: With dead ends: 157 [2018-12-03 18:50:33,370 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 18:50:33,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:50:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 18:50:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 18:50:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 18:50:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-12-03 18:50:33,385 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 143 [2018-12-03 18:50:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:33,385 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-12-03 18:50:33,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 18:50:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-12-03 18:50:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 18:50:33,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:33,386 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:50:33,386 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:33,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash -667575789, now seen corresponding path program 66 times [2018-12-03 18:50:33,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:33,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:33,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:33,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:33,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:35,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:35,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:35,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:35,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:35,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:35,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:35,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:50:35,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:50:35,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:50:35,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:35,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:35,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:40,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:40,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 18:50:40,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:40,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 18:50:40,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 18:50:40,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:50:40,213 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 69 states. [2018-12-03 18:50:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:40,355 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-12-03 18:50:40,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:50:40,356 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 145 [2018-12-03 18:50:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:40,357 INFO L225 Difference]: With dead ends: 159 [2018-12-03 18:50:40,357 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 18:50:40,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:50:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 18:50:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 18:50:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 18:50:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-12-03 18:50:40,373 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 145 [2018-12-03 18:50:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:40,373 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-12-03 18:50:40,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 18:50:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-12-03 18:50:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 18:50:40,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:40,374 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:50:40,375 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:40,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:40,375 INFO L82 PathProgramCache]: Analyzing trace with hash -65517929, now seen corresponding path program 67 times [2018-12-03 18:50:40,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:40,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:40,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:40,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:40,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:42,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:42,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:42,324 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:42,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:42,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:42,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:42,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:42,334 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:50:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:42,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:42,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:47,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:47,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 18:50:47,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:47,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 18:50:47,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 18:50:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 18:50:47,580 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 70 states. [2018-12-03 18:50:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:47,821 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-12-03 18:50:47,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 18:50:47,822 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 147 [2018-12-03 18:50:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:47,823 INFO L225 Difference]: With dead ends: 161 [2018-12-03 18:50:47,823 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 18:50:47,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 18:50:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 18:50:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 18:50:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 18:50:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-03 18:50:47,843 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 147 [2018-12-03 18:50:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:47,843 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-03 18:50:47,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 18:50:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-03 18:50:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 18:50:47,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:47,844 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:50:47,845 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:47,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1308499429, now seen corresponding path program 68 times [2018-12-03 18:50:47,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:47,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:47,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:50,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:50,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:50,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:50,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 18:50:50,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:50,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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:50,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:50:50,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:50:50,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 18:50:50,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:50,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:50,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:55,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:55,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 18:50:55,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:55,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 18:50:55,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 18:50:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 18:50:55,681 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 71 states. [2018-12-03 18:50:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:55,892 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2018-12-03 18:50:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 18:50:55,892 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 149 [2018-12-03 18:50:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:55,893 INFO L225 Difference]: With dead ends: 163 [2018-12-03 18:50:55,893 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 18:50:55,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 18:50:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 18:50:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 18:50:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 18:50:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-12-03 18:50:55,908 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 149 [2018-12-03 18:50:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:55,909 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-12-03 18:50:55,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 18:50:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-12-03 18:50:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 18:50:55,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:55,910 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:50:55,910 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:55,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1812812641, now seen corresponding path program 69 times [2018-12-03 18:50:55,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:55,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:55,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4839 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:57,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:57,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:57,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:57,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:57,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:57,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:50:57,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:50:57,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:50:57,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:50:57,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:57,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4839 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:50:57,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4839 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:03,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:03,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 18:51:03,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:03,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 18:51:03,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 18:51:03,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:51:03,331 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 72 states. [2018-12-03 18:51:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:03,514 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-12-03 18:51:03,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 18:51:03,514 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 151 [2018-12-03 18:51:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:03,515 INFO L225 Difference]: With dead ends: 165 [2018-12-03 18:51:03,516 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 18:51:03,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:51:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 18:51:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 18:51:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 18:51:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2018-12-03 18:51:03,532 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 151 [2018-12-03 18:51:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:03,532 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-12-03 18:51:03,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 18:51:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2018-12-03 18:51:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 18:51:03,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:03,533 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:51:03,533 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:03,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:03,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1126504925, now seen corresponding path program 70 times [2018-12-03 18:51:03,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:03,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:03,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4979 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:05,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:05,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:05,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:05,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:05,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:05,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:51:05,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:05,719 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:51:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:05,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4979 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:05,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4979 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:11,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 18:51:11,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:11,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 18:51:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 18:51:11,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 18:51:11,428 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 73 states. [2018-12-03 18:51:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:11,647 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-12-03 18:51:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 18:51:11,648 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 153 [2018-12-03 18:51:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:11,649 INFO L225 Difference]: With dead ends: 167 [2018-12-03 18:51:11,649 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 18:51:11,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 18:51:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 18:51:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 18:51:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 18:51:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-12-03 18:51:11,668 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 153 [2018-12-03 18:51:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:11,668 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-12-03 18:51:11,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 18:51:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-12-03 18:51:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 18:51:11,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:11,669 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:51:11,669 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:11,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1285213863, now seen corresponding path program 71 times [2018-12-03 18:51:11,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:11,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:11,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:11,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:11,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5121 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:13,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:13,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:13,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:13,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 18:51:13,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:13,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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:51:13,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:51:13,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:51:13,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 18:51:13,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:13,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5121 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:13,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5121 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:19,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:19,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 18:51:19,786 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:19,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 18:51:19,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 18:51:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 18:51:19,788 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 74 states. [2018-12-03 18:51:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:20,186 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2018-12-03 18:51:20,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 18:51:20,187 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 155 [2018-12-03 18:51:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:20,188 INFO L225 Difference]: With dead ends: 169 [2018-12-03 18:51:20,188 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 18:51:20,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 18:51:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 18:51:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 18:51:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 18:51:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-12-03 18:51:20,207 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 155 [2018-12-03 18:51:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:20,207 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-12-03 18:51:20,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 18:51:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-12-03 18:51:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 18:51:20,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:20,208 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:51:20,208 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:20,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash -335370709, now seen corresponding path program 72 times [2018-12-03 18:51:20,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:20,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:20,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:22,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:22,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:22,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:22,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:22,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:22,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:51:22,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:51:22,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:51:22,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:51:22,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:22,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:22,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5265 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:28,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:28,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 18:51:28,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:28,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 18:51:28,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 18:51:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:51:28,292 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand 75 states. [2018-12-03 18:51:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:28,448 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-12-03 18:51:28,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 18:51:28,448 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 157 [2018-12-03 18:51:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:28,449 INFO L225 Difference]: With dead ends: 171 [2018-12-03 18:51:28,449 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 18:51:28,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:51:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 18:51:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 18:51:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 18:51:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-12-03 18:51:28,471 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 157 [2018-12-03 18:51:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:28,472 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-12-03 18:51:28,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 18:51:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-12-03 18:51:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 18:51:28,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:28,473 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:51:28,473 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:28,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:28,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1355984047, now seen corresponding path program 73 times [2018-12-03 18:51:28,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:28,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:28,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:28,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:28,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5411 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:30,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:30,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:30,766 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:30,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:30,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:30,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:51:30,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:30,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:51:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:30,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5411 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:30,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5411 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:36,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:36,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 18:51:36,933 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:36,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 18:51:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 18:51:36,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 18:51:36,935 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 76 states. [2018-12-03 18:51:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:37,166 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-12-03 18:51:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 18:51:37,167 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 159 [2018-12-03 18:51:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:37,168 INFO L225 Difference]: With dead ends: 173 [2018-12-03 18:51:37,168 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 18:51:37,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 18:51:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 18:51:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 18:51:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 18:51:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-12-03 18:51:37,189 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 159 [2018-12-03 18:51:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:37,189 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-12-03 18:51:37,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 18:51:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-12-03 18:51:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 18:51:37,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:37,190 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:51:37,190 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:37,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1044700621, now seen corresponding path program 74 times [2018-12-03 18:51:37,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:37,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:37,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:37,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:37,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5559 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:39,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:39,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:39,328 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:39,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:39,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:39,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:51:39,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:51:39,336 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:51:39,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 18:51:39,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:39,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5559 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:39,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5559 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:45,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:45,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 18:51:45,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:45,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 18:51:45,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 18:51:45,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 18:51:45,886 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 77 states. [2018-12-03 18:51:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:46,130 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-12-03 18:51:46,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 18:51:46,131 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 161 [2018-12-03 18:51:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:46,132 INFO L225 Difference]: With dead ends: 175 [2018-12-03 18:51:46,132 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 18:51:46,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 18:51:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 18:51:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 18:51:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 18:51:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-03 18:51:46,153 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 161 [2018-12-03 18:51:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:46,153 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-03 18:51:46,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 18:51:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-03 18:51:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 18:51:46,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:46,154 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:51:46,154 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:46,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:46,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1705228617, now seen corresponding path program 75 times [2018-12-03 18:51:46,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:46,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:46,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:46,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:46,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5709 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:48,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:48,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:48,306 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:48,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:48,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:48,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:51:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:51:48,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:51:48,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:51:48,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:51:48,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5709 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:48,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:51:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5709 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:54,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:51:54,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 18:51:54,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:51:54,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 18:51:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 18:51:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:51:54,703 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 78 states. [2018-12-03 18:51:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:51:54,948 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-12-03 18:51:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 18:51:54,948 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 163 [2018-12-03 18:51:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:51:54,949 INFO L225 Difference]: With dead ends: 177 [2018-12-03 18:51:54,949 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 18:51:54,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:51:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 18:51:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 18:51:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 18:51:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-12-03 18:51:54,965 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 163 [2018-12-03 18:51:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:51:54,966 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-12-03 18:51:54,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 18:51:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-12-03 18:51:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 18:51:54,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:51:54,966 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:51:54,967 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:51:54,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:51:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash -817472965, now seen corresponding path program 76 times [2018-12-03 18:51:54,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:51:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:54,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:51:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:51:54,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:51:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5861 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:57,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:57,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:51:57,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:51:57,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:51:57,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:51:57,349 INFO 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 18:51:57,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:51:57,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:51:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:51:57,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:51:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5861 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:51:57,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5861 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 18:52:04,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:04,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 18:52:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 18:52:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 18:52:04,073 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 79 states. [2018-12-03 18:52:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:04,353 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-12-03 18:52:04,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 18:52:04,353 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 165 [2018-12-03 18:52:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:04,354 INFO L225 Difference]: With dead ends: 179 [2018-12-03 18:52:04,355 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 18:52:04,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 252 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 18:52:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 18:52:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 18:52:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 18:52:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-12-03 18:52:04,372 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 165 [2018-12-03 18:52:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:04,372 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-12-03 18:52:04,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 18:52:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-12-03 18:52:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 18:52:04,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:04,373 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:52:04,373 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:04,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1912183999, now seen corresponding path program 77 times [2018-12-03 18:52:04,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:04,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:52:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:04,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6015 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:06,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:06,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:06,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:06,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:06,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:06,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:52:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:52:06,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:52:07,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 18:52:07,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:52:07,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6015 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:07,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6015 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:13,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:13,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 18:52:13,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:13,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 18:52:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 18:52:13,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 18:52:13,908 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 80 states. [2018-12-03 18:52:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:14,168 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-12-03 18:52:14,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 18:52:14,168 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 167 [2018-12-03 18:52:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:14,169 INFO L225 Difference]: With dead ends: 181 [2018-12-03 18:52:14,169 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 18:52:14,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 18:52:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 18:52:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 18:52:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 18:52:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-12-03 18:52:14,186 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 167 [2018-12-03 18:52:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:14,186 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-12-03 18:52:14,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 18:52:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-12-03 18:52:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 18:52:14,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:14,187 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:52:14,187 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:14,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash 887508547, now seen corresponding path program 78 times [2018-12-03 18:52:14,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:14,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:14,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:52:14,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:14,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:16,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:16,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:16,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:16,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:16,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:16,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:52:16,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:52:16,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:52:16,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:52:16,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:52:16,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:16,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6171 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:23,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:23,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 18:52:23,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:23,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 18:52:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 18:52:23,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:52:23,660 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 81 states. [2018-12-03 18:52:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:23,851 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-12-03 18:52:23,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 18:52:23,851 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 169 [2018-12-03 18:52:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:23,852 INFO L225 Difference]: With dead ends: 183 [2018-12-03 18:52:23,852 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 18:52:23,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 258 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 18:52:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 18:52:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 18:52:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 18:52:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-12-03 18:52:23,875 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 169 [2018-12-03 18:52:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:23,876 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-12-03 18:52:23,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 18:52:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-12-03 18:52:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 18:52:23,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:23,877 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:52:23,877 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:23,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash -278090041, now seen corresponding path program 79 times [2018-12-03 18:52:23,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:23,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:52:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:23,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6329 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:26,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:26,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:26,571 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:26,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:26,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:26,571 INFO 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 18:52:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:52:26,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:52:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:26,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6329 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:26,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6329 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:33,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 18:52:33,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:33,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 18:52:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 18:52:33,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 18:52:33,647 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 82 states. [2018-12-03 18:52:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:33,873 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-12-03 18:52:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 18:52:33,873 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 171 [2018-12-03 18:52:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:33,874 INFO L225 Difference]: With dead ends: 185 [2018-12-03 18:52:33,874 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 18:52:33,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 18:52:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 18:52:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 18:52:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 18:52:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2018-12-03 18:52:33,892 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 171 [2018-12-03 18:52:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:33,892 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2018-12-03 18:52:33,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 18:52:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2018-12-03 18:52:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 18:52:33,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:33,893 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:52:33,893 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:33,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash 568131147, now seen corresponding path program 80 times [2018-12-03 18:52:33,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:33,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:52:33,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:33,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6489 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:36,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:36,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:36,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:36,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:36,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:36,742 INFO 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 18:52:36,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:52:36,754 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:52:36,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 18:52:36,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:52:36,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6489 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:37,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6489 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:44,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:44,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 18:52:44,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:44,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 18:52:44,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 18:52:44,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 18:52:44,248 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 83 states. [2018-12-03 18:52:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:44,547 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2018-12-03 18:52:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 18:52:44,547 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 173 [2018-12-03 18:52:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:44,548 INFO L225 Difference]: With dead ends: 187 [2018-12-03 18:52:44,548 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 18:52:44,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 264 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 18:52:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 18:52:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 18:52:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 18:52:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-12-03 18:52:44,567 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 173 [2018-12-03 18:52:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:44,567 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-12-03 18:52:44,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 18:52:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-12-03 18:52:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 18:52:44,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:44,568 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:52:44,568 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:44,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2037873871, now seen corresponding path program 81 times [2018-12-03 18:52:44,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:44,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:52:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:44,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6651 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:47,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:47,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:47,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:47,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:47,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:47,298 INFO 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 18:52:47,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:52:47,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:52:47,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:52:47,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:52:47,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6651 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:47,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:52:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6651 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:54,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:52:54,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 18:52:54,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:52:54,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 18:52:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 18:52:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:52:54,767 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 84 states. [2018-12-03 18:52:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:52:55,083 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2018-12-03 18:52:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 18:52:55,084 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 175 [2018-12-03 18:52:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:52:55,084 INFO L225 Difference]: With dead ends: 189 [2018-12-03 18:52:55,084 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 18:52:55,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:52:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 18:52:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 18:52:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 18:52:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2018-12-03 18:52:55,101 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 175 [2018-12-03 18:52:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:52:55,101 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2018-12-03 18:52:55,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 18:52:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-12-03 18:52:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 18:52:55,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:52:55,102 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:52:55,102 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:52:55,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:52:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1416391251, now seen corresponding path program 82 times [2018-12-03 18:52:55,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:52:55,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:55,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:52:55,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:52:55,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:52:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6815 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:58,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:58,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:52:58,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:52:58,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:52:58,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:52:58,157 INFO 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 18:52:58,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:52:58,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:52:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:52:58,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:52:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6815 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:52:58,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6815 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:05,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:05,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 18:53:05,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:05,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 18:53:05,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 18:53:05,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 18:53:05,936 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 85 states. [2018-12-03 18:53:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:06,247 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-12-03 18:53:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 18:53:06,247 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 177 [2018-12-03 18:53:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:06,248 INFO L225 Difference]: With dead ends: 191 [2018-12-03 18:53:06,249 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 18:53:06,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 18:53:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 18:53:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 18:53:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 18:53:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-12-03 18:53:06,267 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 177 [2018-12-03 18:53:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:06,267 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-12-03 18:53:06,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 18:53:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-12-03 18:53:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 18:53:06,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:06,268 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:53:06,269 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:06,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1172047575, now seen corresponding path program 83 times [2018-12-03 18:53:06,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:06,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:06,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:53:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:06,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6981 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:09,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:09,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:09,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:09,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:09,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:09,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:53:09,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:53:09,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:53:09,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 18:53:09,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:53:09,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6981 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:09,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6981 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:17,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:17,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 18:53:17,346 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:17,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 18:53:17,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 18:53:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 18:53:17,348 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 86 states. [2018-12-03 18:53:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:17,542 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2018-12-03 18:53:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 18:53:17,543 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 179 [2018-12-03 18:53:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:17,544 INFO L225 Difference]: With dead ends: 193 [2018-12-03 18:53:17,544 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 18:53:17,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 273 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 18:53:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 18:53:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 18:53:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 18:53:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-12-03 18:53:17,562 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 179 [2018-12-03 18:53:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:17,562 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-12-03 18:53:17,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 18:53:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-12-03 18:53:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 18:53:17,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:17,563 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:53:17,564 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:17,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1713991077, now seen corresponding path program 84 times [2018-12-03 18:53:17,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:17,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:53:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:17,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7149 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:20,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:20,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:20,226 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:20,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:20,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:20,226 INFO 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 18:53:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:53:20,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:53:20,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:53:20,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:53:20,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7149 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:20,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7149 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:28,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:28,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 18:53:28,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:28,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 18:53:28,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 18:53:28,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 18:53:28,328 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 87 states. [2018-12-03 18:53:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:28,660 INFO L93 Difference]: Finished difference Result 195 states and 199 transitions. [2018-12-03 18:53:28,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 18:53:28,661 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 181 [2018-12-03 18:53:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:28,662 INFO L225 Difference]: With dead ends: 195 [2018-12-03 18:53:28,662 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 18:53:28,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 18:53:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 18:53:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 18:53:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 18:53:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-12-03 18:53:28,682 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 181 [2018-12-03 18:53:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:28,682 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-12-03 18:53:28,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 18:53:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-12-03 18:53:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 18:53:28,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:28,683 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:53:28,683 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:28,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:28,684 INFO L82 PathProgramCache]: Analyzing trace with hash -648262433, now seen corresponding path program 85 times [2018-12-03 18:53:28,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:28,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:28,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:53:28,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:28,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7319 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:31,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:31,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:31,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:31,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:31,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:31,431 INFO 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 18:53:31,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:53:31,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:53:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:31,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7319 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:31,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7319 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:39,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:39,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 18:53:39,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:39,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 18:53:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 18:53:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 18:53:39,860 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 88 states. [2018-12-03 18:53:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:40,118 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-12-03 18:53:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 18:53:40,119 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 183 [2018-12-03 18:53:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:40,120 INFO L225 Difference]: With dead ends: 197 [2018-12-03 18:53:40,120 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 18:53:40,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 18:53:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 18:53:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 18:53:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 18:53:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2018-12-03 18:53:40,145 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 183 [2018-12-03 18:53:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:40,145 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2018-12-03 18:53:40,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 18:53:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2018-12-03 18:53:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 18:53:40,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:40,146 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:53:40,146 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:40,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:40,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1314748003, now seen corresponding path program 86 times [2018-12-03 18:53:40,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:40,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:40,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:53:40,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:40,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7491 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:43,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:43,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:43,219 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:43,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:43,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:43,220 INFO 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 18:53:43,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:53:43,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:53:43,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 18:53:43,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:53:43,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7491 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:43,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:53:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7491 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:51,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:53:51,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 18:53:51,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:53:51,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 18:53:51,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 18:53:51,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 18:53:51,709 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 89 states. [2018-12-03 18:53:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:53:51,921 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2018-12-03 18:53:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 18:53:51,922 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 185 [2018-12-03 18:53:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:53:51,923 INFO L225 Difference]: With dead ends: 199 [2018-12-03 18:53:51,923 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 18:53:51,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 18:53:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 18:53:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 18:53:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 18:53:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-12-03 18:53:51,943 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 185 [2018-12-03 18:53:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:53:51,943 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-12-03 18:53:51,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 18:53:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-12-03 18:53:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 18:53:51,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:53:51,944 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:53:51,944 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:53:51,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:53:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2017833241, now seen corresponding path program 87 times [2018-12-03 18:53:51,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:53:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:51,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:53:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:53:51,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:53:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:53:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7665 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:54,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:54,944 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:53:54,944 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:53:54,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:53:54,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:53:54,945 INFO 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 18:53:54,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:53:54,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:53:55,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:53:55,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:53:55,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:53:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7665 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:53:55,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7665 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:03,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:03,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 18:54:03,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:03,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 18:54:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 18:54:03,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 18:54:03,909 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 90 states. [2018-12-03 18:54:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:04,111 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2018-12-03 18:54:04,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 18:54:04,111 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 187 [2018-12-03 18:54:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:04,112 INFO L225 Difference]: With dead ends: 201 [2018-12-03 18:54:04,113 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 18:54:04,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 18:54:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 18:54:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 18:54:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 18:54:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 192 transitions. [2018-12-03 18:54:04,134 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 192 transitions. Word has length 187 [2018-12-03 18:54:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:04,134 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 192 transitions. [2018-12-03 18:54:04,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 18:54:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 192 transitions. [2018-12-03 18:54:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 18:54:04,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:04,135 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:54:04,135 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:04,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash -582805909, now seen corresponding path program 88 times [2018-12-03 18:54:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:04,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:04,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:54:04,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:04,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7841 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:07,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:07,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:07,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:07,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:54:07,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:07,114 INFO 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 18:54:07,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:54:07,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:54:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:07,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7841 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:07,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7841 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:16,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:16,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 18:54:16,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:16,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 18:54:16,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 18:54:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 18:54:16,032 INFO L87 Difference]: Start difference. First operand 190 states and 192 transitions. Second operand 91 states. [2018-12-03 18:54:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:16,332 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2018-12-03 18:54:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 18:54:16,332 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 189 [2018-12-03 18:54:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:16,334 INFO L225 Difference]: With dead ends: 203 [2018-12-03 18:54:16,334 INFO L226 Difference]: Without dead ends: 192 [2018-12-03 18:54:16,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 18:54:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-03 18:54:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-12-03 18:54:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 18:54:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-12-03 18:54:16,353 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 189 [2018-12-03 18:54:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:16,353 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-12-03 18:54:16,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 18:54:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-12-03 18:54:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 18:54:16,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:16,354 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:54:16,354 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:16,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash -206041873, now seen corresponding path program 89 times [2018-12-03 18:54:16,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:16,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:54:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:16,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8019 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:19,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:19,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:19,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:19,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:54:19,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:19,546 INFO 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 18:54:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:54:19,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:54:19,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 18:54:19,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:54:19,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8019 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:19,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8019 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:28,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:28,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 18:54:28,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:28,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 18:54:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 18:54:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 18:54:28,987 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 92 states. [2018-12-03 18:54:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:29,366 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2018-12-03 18:54:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 18:54:29,366 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 191 [2018-12-03 18:54:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:29,367 INFO L225 Difference]: With dead ends: 205 [2018-12-03 18:54:29,367 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 18:54:29,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 18:54:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 18:54:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-12-03 18:54:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 18:54:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2018-12-03 18:54:29,385 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 191 [2018-12-03 18:54:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:29,386 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2018-12-03 18:54:29,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 18:54:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2018-12-03 18:54:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 18:54:29,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:29,386 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:54:29,387 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:29,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1086943859, now seen corresponding path program 90 times [2018-12-03 18:54:29,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:29,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:54:29,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:29,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8199 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:32,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:32,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:32,489 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:32,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 18:54:32,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:32,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 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 18:54:32,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:54:32,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:54:32,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:54:32,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:54:32,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8199 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:32,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8199 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:41,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:41,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 18:54:41,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:41,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 18:54:41,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 18:54:41,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 18:54:41,848 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand 93 states. [2018-12-03 18:54:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:42,097 INFO L93 Difference]: Finished difference Result 207 states and 211 transitions. [2018-12-03 18:54:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 18:54:42,097 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 193 [2018-12-03 18:54:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:42,098 INFO L225 Difference]: With dead ends: 207 [2018-12-03 18:54:42,098 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 18:54:42,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 18:54:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 18:54:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 18:54:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 18:54:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-12-03 18:54:42,117 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 193 [2018-12-03 18:54:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:42,117 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-12-03 18:54:42,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 18:54:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-12-03 18:54:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 18:54:42,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:42,118 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:54:42,118 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:42,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1894283529, now seen corresponding path program 91 times [2018-12-03 18:54:42,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:42,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:42,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:54:42,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:42,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:45,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:45,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:45,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:45,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:54:45,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:45,467 INFO 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 18:54:45,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:54:45,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:54:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:45,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:45,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:54:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:54:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 18:54:54,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:54:54,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 18:54:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 18:54:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 18:54:54,962 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 94 states. [2018-12-03 18:54:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:54:55,242 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-12-03 18:54:55,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 18:54:55,243 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 195 [2018-12-03 18:54:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:54:55,244 INFO L225 Difference]: With dead ends: 209 [2018-12-03 18:54:55,244 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 18:54:55,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 18:54:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 18:54:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 18:54:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 18:54:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2018-12-03 18:54:55,263 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 195 [2018-12-03 18:54:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:54:55,263 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2018-12-03 18:54:55,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 18:54:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2018-12-03 18:54:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 18:54:55,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:54:55,264 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:54:55,264 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:54:55,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:54:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2110616965, now seen corresponding path program 92 times [2018-12-03 18:54:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:54:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:54:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:54:55,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:54:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:54:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8565 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:58,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:58,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:54:58,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:54:58,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 18:54:58,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:54:58,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 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 18:54:58,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:54:58,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:54:58,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 18:54:58,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:54:58,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:54:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8565 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:54:58,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:55:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8565 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:08,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:55:08,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 18:55:08,448 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:55:08,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 18:55:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 18:55:08,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 18:55:08,451 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand 95 states. [2018-12-03 18:55:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:55:08,880 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-12-03 18:55:08,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 18:55:08,880 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 197 [2018-12-03 18:55:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:55:08,881 INFO L225 Difference]: With dead ends: 211 [2018-12-03 18:55:08,881 INFO L226 Difference]: Without dead ends: 200 [2018-12-03 18:55:08,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 18:55:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-03 18:55:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-12-03 18:55:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 18:55:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-12-03 18:55:08,901 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 197 [2018-12-03 18:55:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:55:08,901 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-12-03 18:55:08,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 18:55:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-12-03 18:55:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 18:55:08,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:55:08,902 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:55:08,902 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:55:08,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:55:08,902 INFO L82 PathProgramCache]: Analyzing trace with hash 446348543, now seen corresponding path program 93 times [2018-12-03 18:55:08,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:55:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:08,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:55:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:08,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:55:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8751 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:12,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:12,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:55:12,402 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:55:12,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:55:12,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:12,402 INFO 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 18:55:12,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:55:12,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:55:12,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:55:12,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:55:12,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:55:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8751 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:12,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:55:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8751 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:22,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:55:22,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 18:55:22,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:55:22,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 18:55:22,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 18:55:22,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 18:55:22,490 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 96 states. [2018-12-03 18:55:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:55:22,825 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2018-12-03 18:55:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 18:55:22,825 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 199 [2018-12-03 18:55:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:55:22,827 INFO L225 Difference]: With dead ends: 213 [2018-12-03 18:55:22,827 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 18:55:22,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 18:55:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 18:55:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-12-03 18:55:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 18:55:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 204 transitions. [2018-12-03 18:55:22,847 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 204 transitions. Word has length 199 [2018-12-03 18:55:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:55:22,847 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 204 transitions. [2018-12-03 18:55:22,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 18:55:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2018-12-03 18:55:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 18:55:22,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:55:22,848 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:55:22,848 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:55:22,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:55:22,849 INFO L82 PathProgramCache]: Analyzing trace with hash 968908419, now seen corresponding path program 94 times [2018-12-03 18:55:22,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:55:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:22,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:55:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:22,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:55:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8939 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:26,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:26,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:55:26,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:55:26,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:55:26,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:26,456 INFO 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 18:55:26,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:55:26,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:55:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:26,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:55:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8939 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:26,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:55:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8939 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:55:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 18:55:36,723 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:55:36,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 18:55:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 18:55:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 18:55:36,725 INFO L87 Difference]: Start difference. First operand 202 states and 204 transitions. Second operand 97 states. [2018-12-03 18:55:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:55:36,980 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2018-12-03 18:55:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 18:55:36,982 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 201 [2018-12-03 18:55:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:55:36,983 INFO L225 Difference]: With dead ends: 215 [2018-12-03 18:55:36,983 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 18:55:36,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 18:55:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 18:55:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-12-03 18:55:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 18:55:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2018-12-03 18:55:37,004 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 201 [2018-12-03 18:55:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:55:37,004 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2018-12-03 18:55:37,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 18:55:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2018-12-03 18:55:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 18:55:37,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:55:37,005 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:55:37,005 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:55:37,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:55:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash 637775623, now seen corresponding path program 95 times [2018-12-03 18:55:37,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:55:37,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:37,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:55:37,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:37,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:55:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9129 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:40,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:40,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:55:40,689 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:55:40,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:55:40,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:40,689 INFO 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 18:55:40,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:55:40,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:55:41,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 18:55:41,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:55:41,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:55:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9129 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:41,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:55:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9129 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:51,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:55:51,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 18:55:51,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:55:51,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 18:55:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 18:55:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 18:55:51,304 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 98 states. [2018-12-03 18:55:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:55:51,704 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2018-12-03 18:55:51,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 18:55:51,705 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 203 [2018-12-03 18:55:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:55:51,706 INFO L225 Difference]: With dead ends: 217 [2018-12-03 18:55:51,706 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 18:55:51,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 18:55:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 18:55:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-12-03 18:55:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 18:55:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-12-03 18:55:51,725 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 203 [2018-12-03 18:55:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:55:51,726 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-12-03 18:55:51,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 18:55:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-12-03 18:55:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 18:55:51,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:55:51,727 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:55:51,727 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:55:51,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:55:51,727 INFO L82 PathProgramCache]: Analyzing trace with hash 246738571, now seen corresponding path program 96 times [2018-12-03 18:55:51,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:55:51,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:51,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:55:51,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:55:51,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:55:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:55:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9321 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:55,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:55,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:55:55,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:55:55,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:55:55,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:55:55,107 INFO 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 18:55:55,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:55:55,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:55:55,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:55:55,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:55:55,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:55:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9321 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:55:55,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9321 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:05,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:05,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 18:56:05,723 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:05,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 18:56:05,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 18:56:05,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 18:56:05,725 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 99 states. [2018-12-03 18:56:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:06,076 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2018-12-03 18:56:06,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 18:56:06,077 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 205 [2018-12-03 18:56:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:06,077 INFO L225 Difference]: With dead ends: 219 [2018-12-03 18:56:06,078 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 18:56:06,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 18:56:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 18:56:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-12-03 18:56:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 18:56:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2018-12-03 18:56:06,097 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 205 [2018-12-03 18:56:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:06,097 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2018-12-03 18:56:06,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 18:56:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2018-12-03 18:56:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 18:56:06,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:06,098 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:56:06,098 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:06,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:06,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1877713649, now seen corresponding path program 97 times [2018-12-03 18:56:06,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:06,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:06,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9515 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:09,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:09,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:09,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:09,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:09,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:09,611 INFO 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 18:56:09,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:09,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:09,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9515 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:09,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9515 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:20,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:20,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 18:56:20,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:20,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 18:56:20,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 18:56:20,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 18:56:20,322 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 100 states. [2018-12-03 18:56:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:20,828 INFO L93 Difference]: Finished difference Result 221 states and 225 transitions. [2018-12-03 18:56:20,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 18:56:20,829 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 207 [2018-12-03 18:56:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:20,830 INFO L225 Difference]: With dead ends: 221 [2018-12-03 18:56:20,830 INFO L226 Difference]: Without dead ends: 210 [2018-12-03 18:56:20,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 18:56:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-03 18:56:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-12-03 18:56:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 18:56:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-12-03 18:56:20,850 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 207 [2018-12-03 18:56:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:20,850 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-12-03 18:56:20,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 18:56:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-12-03 18:56:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-03 18:56:20,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:20,851 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:56:20,851 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:20,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 928135827, now seen corresponding path program 98 times [2018-12-03 18:56:20,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:20,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:20,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9711 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:24,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:24,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:24,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:24,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:24,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:24,788 INFO 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 18:56:24,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:24,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:25,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-03 18:56:25,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:25,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9711 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:25,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9711 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:36,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:36,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 18:56:36,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:36,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 18:56:36,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 18:56:36,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 18:56:36,039 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 101 states. [2018-12-03 18:56:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:36,617 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-12-03 18:56:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 18:56:36,618 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 209 [2018-12-03 18:56:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:36,620 INFO L225 Difference]: With dead ends: 223 [2018-12-03 18:56:36,620 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 18:56:36,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 18:56:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 18:56:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-12-03 18:56:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-03 18:56:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2018-12-03 18:56:36,643 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 209 [2018-12-03 18:56:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:36,644 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2018-12-03 18:56:36,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 18:56:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-12-03 18:56:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-03 18:56:36,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:36,645 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:56:36,645 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:36,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 110020375, now seen corresponding path program 99 times [2018-12-03 18:56:36,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:36,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:36,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:40,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:40,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:40,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:40,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:40,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:40,353 INFO 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 18:56:40,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:40,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:40,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:40,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:40,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:40,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:51,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:51,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 18:56:51,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:51,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 18:56:51,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 18:56:51,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 18:56:51,591 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 102 states. [2018-12-03 18:56:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:52,128 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-12-03 18:56:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 18:56:52,128 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 211 [2018-12-03 18:56:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:52,129 INFO L225 Difference]: With dead ends: 225 [2018-12-03 18:56:52,129 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 18:56:52,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 18:56:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 18:56:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-12-03 18:56:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-03 18:56:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2018-12-03 18:56:52,151 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 211 [2018-12-03 18:56:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:52,151 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2018-12-03 18:56:52,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 18:56:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2018-12-03 18:56:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-03 18:56:52,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:52,152 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:56:52,152 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:52,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash -119913829, now seen corresponding path program 100 times [2018-12-03 18:56:52,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:52,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:52,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10109 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:55,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:55,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:55,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:55,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:55,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:55,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:55,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:55,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:55,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10109 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:56:56,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10109 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:07,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:07,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 18:57:07,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:07,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 18:57:07,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 18:57:07,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 18:57:07,308 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 103 states. [2018-12-03 18:57:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:07,695 INFO L93 Difference]: Finished difference Result 227 states and 231 transitions. [2018-12-03 18:57:07,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 18:57:07,696 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 213 [2018-12-03 18:57:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:07,696 INFO L225 Difference]: With dead ends: 227 [2018-12-03 18:57:07,696 INFO L226 Difference]: Without dead ends: 216 [2018-12-03 18:57:07,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 18:57:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-03 18:57:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-12-03 18:57:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-03 18:57:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-12-03 18:57:07,722 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 213 [2018-12-03 18:57:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:07,723 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-12-03 18:57:07,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 18:57:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-12-03 18:57:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-03 18:57:07,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:07,724 INFO L402 BasicCegarLoop]: trace histogram [102, 101, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:57:07,724 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:07,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:07,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2043351777, now seen corresponding path program 101 times [2018-12-03 18:57:07,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:07,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:07,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:07,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:07,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10311 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:11,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:11,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:11,557 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:11,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:11,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:11,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:11,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:57:11,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:57:11,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2018-12-03 18:57:11,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:11,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10311 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:11,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10311 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:23,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:23,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 18:57:23,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:23,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 18:57:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 18:57:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 18:57:23,674 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 104 states. [2018-12-03 18:57:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:24,113 INFO L93 Difference]: Finished difference Result 229 states and 233 transitions. [2018-12-03 18:57:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 18:57:24,113 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 215 [2018-12-03 18:57:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:24,114 INFO L225 Difference]: With dead ends: 229 [2018-12-03 18:57:24,114 INFO L226 Difference]: Without dead ends: 218 [2018-12-03 18:57:24,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 18:57:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-03 18:57:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-12-03 18:57:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-03 18:57:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 220 transitions. [2018-12-03 18:57:24,136 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 220 transitions. Word has length 215 [2018-12-03 18:57:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:24,137 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 220 transitions. [2018-12-03 18:57:24,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 18:57:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 220 transitions. [2018-12-03 18:57:24,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-03 18:57:24,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:24,137 INFO L402 BasicCegarLoop]: trace histogram [103, 102, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:57:24,138 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:24,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:24,138 INFO L82 PathProgramCache]: Analyzing trace with hash 663684771, now seen corresponding path program 102 times [2018-12-03 18:57:24,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:24,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:24,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10515 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:28,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:28,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:28,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:28,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:28,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:28,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:28,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:57:28,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:57:28,346 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:57:28,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:28,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10515 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:28,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10515 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:40,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:40,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 18:57:40,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:40,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 18:57:40,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 18:57:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 18:57:40,042 INFO L87 Difference]: Start difference. First operand 218 states and 220 transitions. Second operand 105 states. [2018-12-03 18:57:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:40,355 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-12-03 18:57:40,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 18:57:40,355 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 217 [2018-12-03 18:57:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:40,357 INFO L225 Difference]: With dead ends: 231 [2018-12-03 18:57:40,357 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 18:57:40,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 18:57:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 18:57:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-03 18:57:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 18:57:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-12-03 18:57:40,379 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 217 [2018-12-03 18:57:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:40,379 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-12-03 18:57:40,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 18:57:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-12-03 18:57:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 18:57:40,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:40,380 INFO L402 BasicCegarLoop]: trace histogram [104, 103, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:57:40,380 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:40,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash -624373977, now seen corresponding path program 103 times [2018-12-03 18:57:40,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:40,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:40,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:40,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10721 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:44,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:44,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:44,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:44,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:44,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:44,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:44,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:44,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:57:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:44,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10721 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:44,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10721 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:57:56,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:56,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 18:57:56,823 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:56,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 18:57:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 18:57:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 18:57:56,826 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 106 states. [2018-12-03 18:57:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:57,382 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2018-12-03 18:57:57,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 18:57:57,383 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 219 [2018-12-03 18:57:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:57,384 INFO L225 Difference]: With dead ends: 233 [2018-12-03 18:57:57,384 INFO L226 Difference]: Without dead ends: 222 [2018-12-03 18:57:57,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 18:57:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-03 18:57:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-12-03 18:57:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-12-03 18:57:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 224 transitions. [2018-12-03 18:57:57,413 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 224 transitions. Word has length 219 [2018-12-03 18:57:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:57,413 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 224 transitions. [2018-12-03 18:57:57,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 18:57:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 224 transitions. [2018-12-03 18:57:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-03 18:57:57,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:57,414 INFO L402 BasicCegarLoop]: trace histogram [105, 104, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:57:57,414 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:57,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1498249557, now seen corresponding path program 104 times [2018-12-03 18:57:57,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:57,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:57,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:57,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10929 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:01,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:01,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:01,701 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:01,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:01,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:01,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:01,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:58:01,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:58:02,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 105 check-sat command(s) [2018-12-03 18:58:02,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:02,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10929 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:02,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10929 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:14,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:14,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 18:58:14,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:14,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 18:58:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 18:58:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 18:58:14,488 INFO L87 Difference]: Start difference. First operand 222 states and 224 transitions. Second operand 107 states. [2018-12-03 18:58:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:15,093 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2018-12-03 18:58:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 18:58:15,094 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 221 [2018-12-03 18:58:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:15,094 INFO L225 Difference]: With dead ends: 235 [2018-12-03 18:58:15,095 INFO L226 Difference]: Without dead ends: 224 [2018-12-03 18:58:15,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 18:58:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-12-03 18:58:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-12-03 18:58:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-03 18:58:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2018-12-03 18:58:15,117 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 221 [2018-12-03 18:58:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:15,117 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2018-12-03 18:58:15,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 18:58:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2018-12-03 18:58:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-03 18:58:15,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:15,118 INFO L402 BasicCegarLoop]: trace histogram [106, 105, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:58:15,118 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:15,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:15,118 INFO L82 PathProgramCache]: Analyzing trace with hash 520908079, now seen corresponding path program 105 times [2018-12-03 18:58:15,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:15,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:15,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:15,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:15,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11139 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:19,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:19,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:19,467 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:19,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:19,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:19,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:19,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:58:19,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:58:19,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:58:19,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:19,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11139 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:19,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11139 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:32,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:32,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 18:58:32,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:32,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 18:58:32,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 18:58:32,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 18:58:32,013 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 108 states. [2018-12-03 18:58:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:32,650 INFO L93 Difference]: Finished difference Result 237 states and 241 transitions. [2018-12-03 18:58:32,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 18:58:32,651 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 223 [2018-12-03 18:58:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:32,651 INFO L225 Difference]: With dead ends: 237 [2018-12-03 18:58:32,651 INFO L226 Difference]: Without dead ends: 226 [2018-12-03 18:58:32,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 18:58:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-03 18:58:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-12-03 18:58:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-03 18:58:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 228 transitions. [2018-12-03 18:58:32,692 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 228 transitions. Word has length 223 [2018-12-03 18:58:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:32,692 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 228 transitions. [2018-12-03 18:58:32,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 18:58:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 228 transitions. [2018-12-03 18:58:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-03 18:58:32,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:32,693 INFO L402 BasicCegarLoop]: trace histogram [107, 106, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:58:32,693 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:32,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:32,693 INFO L82 PathProgramCache]: Analyzing trace with hash -393821517, now seen corresponding path program 106 times [2018-12-03 18:58:32,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:32,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:32,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:32,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:32,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11351 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:37,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:37,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:37,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:37,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:37,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:37,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:37,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:37,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:58:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:37,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11351 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:37,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11351 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:50,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:50,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 18:58:50,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:50,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 18:58:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 18:58:50,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 18:58:50,097 INFO L87 Difference]: Start difference. First operand 226 states and 228 transitions. Second operand 109 states. [2018-12-03 18:58:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:50,440 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2018-12-03 18:58:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 18:58:50,446 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 225 [2018-12-03 18:58:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:50,447 INFO L225 Difference]: With dead ends: 239 [2018-12-03 18:58:50,447 INFO L226 Difference]: Without dead ends: 228 [2018-12-03 18:58:50,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 18:58:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-12-03 18:58:50,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-12-03 18:58:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-03 18:58:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 230 transitions. [2018-12-03 18:58:50,477 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 230 transitions. Word has length 225 [2018-12-03 18:58:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:50,477 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 230 transitions. [2018-12-03 18:58:50,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 18:58:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 230 transitions. [2018-12-03 18:58:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-03 18:58:50,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:50,478 INFO L402 BasicCegarLoop]: trace histogram [108, 107, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:58:50,479 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:50,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1019332407, now seen corresponding path program 107 times [2018-12-03 18:58:50,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:50,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:50,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11565 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:54,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:54,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:54,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:54,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:54,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:54,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:54,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:58:54,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:58:55,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2018-12-03 18:58:55,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:55,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11565 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:58:55,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11565 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:59:08,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:08,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 18:59:08,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:08,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 18:59:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 18:59:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 18:59:08,004 INFO L87 Difference]: Start difference. First operand 228 states and 230 transitions. Second operand 110 states. [2018-12-03 18:59:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:08,585 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2018-12-03 18:59:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 18:59:08,586 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 227 [2018-12-03 18:59:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:08,586 INFO L225 Difference]: With dead ends: 241 [2018-12-03 18:59:08,587 INFO L226 Difference]: Without dead ends: 230 [2018-12-03 18:59:08,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 18:59:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-03 18:59:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-12-03 18:59:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-12-03 18:59:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2018-12-03 18:59:08,609 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 227 [2018-12-03 18:59:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:08,609 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2018-12-03 18:59:08,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 18:59:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2018-12-03 18:59:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-03 18:59:08,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:08,610 INFO L402 BasicCegarLoop]: trace histogram [109, 108, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:59:08,610 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:08,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1850587835, now seen corresponding path program 108 times [2018-12-03 18:59:08,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:08,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:08,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:59:13,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:13,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:13,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:13,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:13,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:13,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:13,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:59:13,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:59:13,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:59:13,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:13,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:59:13,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:59:26,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:26,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 18:59:26,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:26,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 18:59:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 18:59:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 18:59:26,608 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand 111 states. [2018-12-03 18:59:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:27,105 INFO L93 Difference]: Finished difference Result 243 states and 247 transitions. [2018-12-03 18:59:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 18:59:27,105 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 229 [2018-12-03 18:59:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:27,106 INFO L225 Difference]: With dead ends: 243 [2018-12-03 18:59:27,106 INFO L226 Difference]: Without dead ends: 232 [2018-12-03 18:59:27,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 18:59:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-12-03 18:59:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-12-03 18:59:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-03 18:59:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2018-12-03 18:59:27,128 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 229 [2018-12-03 18:59:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:27,128 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2018-12-03 18:59:27,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 18:59:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2018-12-03 18:59:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-03 18:59:27,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:27,129 INFO L402 BasicCegarLoop]: trace histogram [110, 109, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:59:27,129 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:27,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1823137087, now seen corresponding path program 109 times [2018-12-03 18:59:27,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:27,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:27,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:27,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:27,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11999 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:59:31,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:31,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:31,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:31,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:31,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:31,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:31,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:31,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:59:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:32,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11999 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:59:32,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11999 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:59:45,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:45,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 18:59:45,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:45,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 18:59:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 18:59:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 18:59:45,357 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 112 states. [2018-12-03 18:59:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:46,056 INFO L93 Difference]: Finished difference Result 245 states and 249 transitions. [2018-12-03 18:59:46,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 18:59:46,057 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 231 [2018-12-03 18:59:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:46,058 INFO L225 Difference]: With dead ends: 245 [2018-12-03 18:59:46,058 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 18:59:46,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 18:59:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 18:59:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-12-03 18:59:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-03 18:59:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2018-12-03 18:59:46,079 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 231 [2018-12-03 18:59:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:46,079 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2018-12-03 18:59:46,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 18:59:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2018-12-03 18:59:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-03 18:59:46,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:46,080 INFO L402 BasicCegarLoop]: trace histogram [111, 110, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:59:46,080 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:46,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1212772035, now seen corresponding path program 110 times [2018-12-03 18:59:46,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:46,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:46,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat