MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C) -> f3(A,D,C)     [499 + -1*C >= 0 && -1 + A + -1*C >= 0 && 999 + -1*A + -1*C >= 0 && 500 + -1*A >= 0 && A >= 500] (?,1)
          1. f1(A,B,C) -> f1(1 + A,B,C) [499 + -1*C >= 0 && -1 + A + -1*C >= 0 && 999 + -1*A + -1*C >= 0 && 500 + -1*A >= 0 && 499 >= A] (?,1)
          2. f2(A,B,C) -> f3(E,D,E)     [E >= 500]                                                                                       (1,1)
          3. f2(A,B,C) -> f1(1 + D,B,D) [499 >= D]                                                                                       (1,1)
        Signature:
          {(f1,3);(f2,3);(f3,3)}
        Flow Graph:
          [0->{},1->{0,1},2->{},3->{0,1}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f1(A,B,C) -> f3(A,D,C)     [499 + -1*C >= 0 && -1 + A + -1*C >= 0 && 999 + -1*A + -1*C >= 0 && 500 + -1*A >= 0 && A >= 500] (1,1)
        1. f1(A,B,C) -> f1(1 + A,B,C) [499 + -1*C >= 0 && -1 + A + -1*C >= 0 && 999 + -1*A + -1*C >= 0 && 500 + -1*A >= 0 && 499 >= A] (?,1)
        2. f2(A,B,C) -> f3(E,D,E)     [E >= 500]                                                                                       (1,1)
        3. f2(A,B,C) -> f1(1 + D,B,D) [499 >= D]                                                                                       (1,1)
      Signature:
        {(f1,3);(f2,3);(f3,3)}
      Flow Graph:
        [0->{},1->{0,1},2->{},3->{0,1}]
      
  + Applied Processor:
      Failing "Open problems left."
  + Details:
      Open problems left.
MAYBE