MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B)  -> f7(C,1)  True                                         (1,1)
          1. f7(A,B)  -> f13(0,1) [1 + -1*B >= 0 && -1 + B >= 0 && A = 0]      (?,1)
          2. f7(A,B)  -> f7(C,B)  [1 + -1*B >= 0 && -1 + B >= 0 && A >= 1]     (?,1)
          3. f7(A,B)  -> f7(C,B)  [1 + -1*B >= 0 && -1 + B >= 0 && 0 >= 1 + A] (?,1)
          4. f13(A,B) -> f13(A,B) [1 + -1*B >= 0                               (?,1)
                                   && 1 + A + -1*B >= 0                             
                                   && 1 + -1*A + -1*B >= 0                          
                                   && -1 + B >= 0                                   
                                   && -1 + A + B >= 0                               
                                   && -1 + -1*A + B >= 0                            
                                   && -1*A >= 0                                     
                                   && A >= 0]                                       
        Signature:
          {(f0,2);(f13,2);(f7,2)}
        Flow Graph:
          [0->{1,2,3},1->{4},2->{1,2,3},3->{1,2,3},4->{4}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B)  -> f7(C,1)  True                                         (1,1)
          1. f7(A,B)  -> f13(0,1) [1 + -1*B >= 0 && -1 + B >= 0 && A = 0]      (1,1)
          2. f7(A,B)  -> f7(C,B)  [1 + -1*B >= 0 && -1 + B >= 0 && A >= 1]     (?,1)
          3. f7(A,B)  -> f7(C,B)  [1 + -1*B >= 0 && -1 + B >= 0 && 0 >= 1 + A] (?,1)
          4. f13(A,B) -> f13(A,B) [1 + -1*B >= 0                               (?,1)
                                   && 1 + A + -1*B >= 0                             
                                   && 1 + -1*A + -1*B >= 0                          
                                   && -1 + B >= 0                                   
                                   && -1 + A + B >= 0                               
                                   && -1 + -1*A + B >= 0                            
                                   && -1*A >= 0                                     
                                   && A >= 0]                                       
        Signature:
          {(f0,2);(f13,2);(f7,2)}
        Flow Graph:
          [0->{1,2,3},1->{4},2->{1,2,3},3->{1,2,3},4->{4}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A,B)  -> f7(C,1)        True                                         (1,1)
        1. f7(A,B)  -> f13(0,1)       [1 + -1*B >= 0 && -1 + B >= 0 && A = 0]      (?,1)
        2. f7(A,B)  -> f7(C,B)        [1 + -1*B >= 0 && -1 + B >= 0 && A >= 1]     (?,1)
        3. f7(A,B)  -> f7(C,B)        [1 + -1*B >= 0 && -1 + B >= 0 && 0 >= 1 + A] (?,1)
        4. f13(A,B) -> f13(A,B)       [1 + -1*B >= 0                               (?,1)
                                       && 1 + A + -1*B >= 0                             
                                       && 1 + -1*A + -1*B >= 0                          
                                       && -1 + B >= 0                                   
                                       && -1 + A + B >= 0                               
                                       && -1 + -1*A + B >= 0                            
                                       && -1*A >= 0                                     
                                       && A >= 0]                                       
        5. f13(A,B) -> exitus616(A,B) True                                         (?,1)
      Signature:
        {(exitus616,2);(f0,2);(f13,2);(f7,2)}
      Flow Graph:
        [0->{1,2,3},1->{4,5},2->{1,2,3},3->{1,2,3},4->{4,5},5->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5]
        |
        +- p:[2,3] c: []
        |
        `- p:[4] c: []
MAYBE