MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C) -> f5(0,0,C)             True                                              (1,1)
          1. f5(A,B,C) -> f5(1 + A,2 + B,D + E) [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1)
          2. f5(A,B,C) -> f16(A,B,C)            [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1)
        Signature:
          {(f0,3);(f16,3);(f5,3)}
        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: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C) -> f5(0,0,C)             True                                              (1,1)
          1. f5(A,B,C) -> f5(1 + A,2 + B,D + E) [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1)
          2. f5(A,B,C) -> f16(A,B,C)            [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (1,1)
        Signature:
          {(f0,3);(f16,3);(f5,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A,B,C) -> f5(0,0,C)             True                                              (1,1)
        1. f5(A,B,C) -> f5(1 + A,2 + B,D + E) [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1)
        2. f5(A,B,C) -> f16(A,B,C)            [B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1)
        3. f5(A,B,C) -> exitus616(A,B,C)      True                                              (?,1)
      Signature:
        {(exitus616,3);(f0,3);(f16,3);(f5,3)}
      Flow Graph:
        [0->{1,2,3},1->{1,2,3},2->{},3->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3]
        |
        `- p:[1] c: []
MAYBE