YES(?,O(1))
* Step 1: TrivialSCCs WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f3(1,B)             True                     (1,1)
          1. f3(A,B) -> f3(1 + A,10 + -1*A) [-1 + A >= 0 && 10 >= A] (?,1)
          2. f3(A,B) -> f10(A,B)            [-1 + A >= 0 && A >= 11] (?,1)
        Signature:
          {(f0,2);(f10,2);(f3,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f3(1,B)             True                     (1,1)
          1. f3(A,B) -> f3(1 + A,10 + -1*A) [-1 + A >= 0 && 10 >= A] (?,1)
          2. f3(A,B) -> f10(A,B)            [-1 + A >= 0 && A >= 11] (1,1)
        Signature:
          {(f0,2);(f10,2);(f3,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 3: AddSinks WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f3(1,B)             True                     (1,1)
          1. f3(A,B) -> f3(1 + A,10 + -1*A) [-1 + A >= 0 && 10 >= A] (?,1)
          2. f3(A,B) -> f10(A,B)            [-1 + A >= 0 && A >= 11] (1,1)
        Signature:
          {(f0,2);(f10,2);(f3,2)}
        Flow Graph:
          [0->{1},1->{1,2},2->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f3(1,B)             True                     (1,1)
          1. f3(A,B) -> f3(1 + A,10 + -1*A) [-1 + A >= 0 && 10 >= A] (?,1)
          2. f3(A,B) -> f10(A,B)            [-1 + A >= 0 && A >= 11] (?,1)
          3. f3(A,B) -> exitus616(A,B)      True                     (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f10,2);(f3,2)}
        Flow Graph:
          [0->{1,2,3},1->{1,2,3},2->{},3->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 5: LooptreeTransformer WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f3(1,B)             True                     (1,1)
          1. f3(A,B) -> f3(1 + A,10 + -1*A) [-1 + A >= 0 && 10 >= A] (?,1)
          2. f3(A,B) -> f10(A,B)            [-1 + A >= 0 && A >= 11] (?,1)
          3. f3(A,B) -> exitus616(A,B)      True                     (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f10,2);(f3,2)}
        Flow Graph:
          [0->{1,3},1->{1,2,3},2->{},3->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1]
* Step 6: SizeAbstraction WORST_CASE(?,O(1))
    + Considered Problem:
        (Rules:
          0. f0(A,B) -> f3(1,B)             True                     (1,1)
          1. f3(A,B) -> f3(1 + A,10 + -1*A) [-1 + A >= 0 && 10 >= A] (?,1)
          2. f3(A,B) -> f10(A,B)            [-1 + A >= 0 && A >= 11] (?,1)
          3. f3(A,B) -> exitus616(A,B)      True                     (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f10,2);(f3,2)}
        Flow Graph:
          [0->{1,3},1->{1,2,3},2->{},3->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 7: FlowAbstraction WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           f0  ~>  f3          [A <= K, B <= B]
           f3  ~>  f3          [A <= 11*K, B <= 9*K]
           f3  ~>  f10         [A <= A, B <= B]
           f3  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= 11*K + A]
               f3  ~>  f3   [A <= 11*K, B <= 9*K]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 8: LareProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           f0  ~>  f3          [K ~=> A]
           f3  ~>  f3          [K ~=> A,K ~=> B]
           f3  ~>  f10         []
           f3  ~>  exitus616   []
          + Loop: [A ~+> 0.0,K ~*> 0.0]
               f3  ~>  f3   [K ~=> A,K ~=> B]
    + Applied Processor:
        LareProcessor
    + Details:
         f0  ~>  exitus616   [K ~=> A,K ~=> B,tick ~+> tick,K ~+> 0.0,K ~+> tick,K ~*> 0.0,K ~*> tick]
         f0  ~>  f10         [K ~=> A,K ~=> B,tick ~+> tick,K ~+> 0.0,K ~+> tick,K ~*> 0.0,K ~*> tick]
        + <f3  ~>  f3>  [K ~=> A,K ~=> B,A ~+> 0.0,A ~+> tick,tick ~+> tick,K ~*> 0.0,K ~*> tick]

YES(?,O(1))