YES
* Step 1: TrivialSCCs YES
    + Considered Problem:
        Rules:
          0. evalfstart(A,B,C)    -> evalfentryin(A,B,C)   True                                                                                      (1,1)
          1. evalfentryin(A,B,C)  -> evalfbb3in(0,0,C)     True                                                                                      (?,1)
          2. evalfbb3in(A,B,C)    -> evalfbbin(A,B,C)      [B >= 0 && A + B >= 0 && A >= 0 && 99 >= B]                                               (?,1)
          3. evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)  [B >= 0 && A + B >= 0 && A >= 0 && B >= 100]                                              (?,1)
          4. evalfbbin(A,B,C)     -> evalfbb1in(A,B,C)     [99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1 + A]    (?,1)
          5. evalfbbin(A,B,C)     -> evalfbb2in(A,B,C)     [99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && A >= C]        (?,1)
          6. evalfbb1in(A,B,C)    -> evalfbb3in(1 + A,B,C) [-1 + C >= 0                                                                              (?,1)
                                                            && -1 + B + C >= 0                                                                            
                                                            && 98 + -1*B + C >= 0                                                                         
                                                            && -1 + A + C >= 0                                                                            
                                                            && -1 + -1*A + C >= 0                                                                         
                                                            && 99 + -1*B >= 0                                                                             
                                                            && 99 + A + -1*B >= 0                                                                         
                                                            && B >= 0                                                                                     
                                                            && A + B >= 0                                                                                 
                                                            && A >= 0]                                                                                    
          7. evalfbb2in(A,B,C)    -> evalfbb3in(A,1 + B,C) [A + -1*C >= 0 && 99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0] (?,1)
          8. evalfreturnin(A,B,C) -> evalfstop(A,B,C)      [-100 + B >= 0 && -100 + A + B >= 0 && A >= 0]                                            (?,1)
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbbin,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths YES
    + Considered Problem:
        Rules:
          0. evalfstart(A,B,C)    -> evalfentryin(A,B,C)   True                                                                                      (1,1)
          1. evalfentryin(A,B,C)  -> evalfbb3in(0,0,C)     True                                                                                      (1,1)
          2. evalfbb3in(A,B,C)    -> evalfbbin(A,B,C)      [B >= 0 && A + B >= 0 && A >= 0 && 99 >= B]                                               (?,1)
          3. evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)  [B >= 0 && A + B >= 0 && A >= 0 && B >= 100]                                              (1,1)
          4. evalfbbin(A,B,C)     -> evalfbb1in(A,B,C)     [99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1 + A]    (?,1)
          5. evalfbbin(A,B,C)     -> evalfbb2in(A,B,C)     [99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && A >= C]        (?,1)
          6. evalfbb1in(A,B,C)    -> evalfbb3in(1 + A,B,C) [-1 + C >= 0                                                                              (?,1)
                                                            && -1 + B + C >= 0                                                                            
                                                            && 98 + -1*B + C >= 0                                                                         
                                                            && -1 + A + C >= 0                                                                            
                                                            && -1 + -1*A + C >= 0                                                                         
                                                            && 99 + -1*B >= 0                                                                             
                                                            && 99 + A + -1*B >= 0                                                                         
                                                            && B >= 0                                                                                     
                                                            && A + B >= 0                                                                                 
                                                            && A >= 0]                                                                                    
          7. evalfbb2in(A,B,C)    -> evalfbb3in(A,1 + B,C) [A + -1*C >= 0 && 99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0] (?,1)
          8. evalfreturnin(A,B,C) -> evalfstop(A,B,C)      [-100 + B >= 0 && -100 + A + B >= 0 && A >= 0]                                            (1,1)
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbbin,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,3),(6,3)]
* Step 3: Looptree YES
    + Considered Problem:
        Rules:
          0. evalfstart(A,B,C)    -> evalfentryin(A,B,C)   True                                                                                      (1,1)
          1. evalfentryin(A,B,C)  -> evalfbb3in(0,0,C)     True                                                                                      (1,1)
          2. evalfbb3in(A,B,C)    -> evalfbbin(A,B,C)      [B >= 0 && A + B >= 0 && A >= 0 && 99 >= B]                                               (?,1)
          3. evalfbb3in(A,B,C)    -> evalfreturnin(A,B,C)  [B >= 0 && A + B >= 0 && A >= 0 && B >= 100]                                              (1,1)
          4. evalfbbin(A,B,C)     -> evalfbb1in(A,B,C)     [99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && C >= 1 + A]    (?,1)
          5. evalfbbin(A,B,C)     -> evalfbb2in(A,B,C)     [99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && A >= C]        (?,1)
          6. evalfbb1in(A,B,C)    -> evalfbb3in(1 + A,B,C) [-1 + C >= 0                                                                              (?,1)
                                                            && -1 + B + C >= 0                                                                            
                                                            && 98 + -1*B + C >= 0                                                                         
                                                            && -1 + A + C >= 0                                                                            
                                                            && -1 + -1*A + C >= 0                                                                         
                                                            && 99 + -1*B >= 0                                                                             
                                                            && 99 + A + -1*B >= 0                                                                         
                                                            && B >= 0                                                                                     
                                                            && A + B >= 0                                                                                 
                                                            && A >= 0]                                                                                    
          7. evalfbb2in(A,B,C)    -> evalfbb3in(A,1 + B,C) [A + -1*C >= 0 && 99 + -1*B >= 0 && 99 + A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0] (?,1)
          8. evalfreturnin(A,B,C) -> evalfstop(A,B,C)      [-100 + B >= 0 && -100 + A + B >= 0 && A >= 0]                                            (1,1)
        Signature:
          {(evalfbb1in,3)
          ;(evalfbb2in,3)
          ;(evalfbb3in,3)
          ;(evalfbbin,3)
          ;(evalfentryin,3)
          ;(evalfreturnin,3)
          ;(evalfstart,3)
          ;(evalfstop,3)}
        Flow Graph:
          [0->{1},1->{2},2->{4,5},3->{8},4->{6},5->{7},6->{2},7->{2,3},8->{}]
        
    + Applied Processor:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8]
          |
          `- p:[2,6,4,7,5] c: [7]
             |
             `- p:[2,6,4] c: [6]

YES