WORST_CASE(?,O(1))
* Step 1: LocalSizeboundsProc WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f1(3000,B)     True                        (1,1)
          1. f1(A,B) -> f1(A,1000 + B) [889 + B >= 0 && 1999 >= A] (?,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{1},1->{1}]
        
    + Applied Processor:
        LocalSizeboundsProc
    + Details:
        LocalSizebounds generated; rvgraph
          (<0,0,A>, 3000, .= 3000) (<0,0,B>,        B,    .= 0) 
          (<1,0,A>,    A,    .= 0) (<1,0,B>, 1000 + B, .+ 1000) 
* Step 2: SizeboundsProc WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f1(3000,B)     True                        (1,1)
          1. f1(A,B) -> f1(A,1000 + B) [889 + B >= 0 && 1999 >= A] (?,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{1},1->{1}]
        Sizebounds:
          (<0,0,A>, ?) (<0,0,B>, ?) 
          (<1,0,A>, ?) (<1,0,B>, ?) 
    + Applied Processor:
        SizeboundsProc
    + Details:
        Sizebounds computed:
          (<0,0,A>, 3000) (<0,0,B>, B) 
          (<1,0,A>, 3000) (<1,0,B>, ?) 
* Step 3: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f1(3000,B)     True                        (1,1)
          1. f1(A,B) -> f1(A,1000 + B) [889 + B >= 0 && 1999 >= A] (?,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{1},1->{1}]
        Sizebounds:
          (<0,0,A>, 3000) (<0,0,B>, B) 
          (<1,0,A>, 3000) (<1,0,B>, ?) 
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,1)]
* Step 4: UnreachableRules WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f1(3000,B)     True                        (1,1)
          1. f1(A,B) -> f1(A,1000 + B) [889 + B >= 0 && 1999 >= A] (?,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{},1->{1}]
        Sizebounds:
          (<0,0,A>, 3000) (<0,0,B>, B) 
          (<1,0,A>, 3000) (<1,0,B>, ?) 
    + Applied Processor:
        UnreachableRules
    + Details:
        The following transitions are not reachable from the starting states and are removed: [1]
* Step 5: LeafRules WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f1(3000,B) True (1,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{}]
        Sizebounds:
          (<0,0,A>, 3000) (<0,0,B>, B) 
    + Applied Processor:
        LeafRules
    + Details:
        The problem is already solved.

WORST_CASE(?,O(1))