YES(?,PRIMREC)
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f(A,B,C) -> g(1,1,C)              True          (1,1)
          1. g(A,B,C) -> g(A + B,A + B,-1 + C) [-1 + C >= 0] (?,1)
          2. g(A,B,C) -> h(A,B,C)              [0 >= C]      (?,1)
          3. h(A,B,C) -> h(A,-1 + B,C)         [-1 + B >= 0] (?,1)
        Signature:
          {(f,3);(g,3);(h,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{3},3->{3}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f(A,B,C) -> g(1,1,C)              True          (1,1)
          1. g(A,B,C) -> g(A + B,A + B,-1 + C) [-1 + C >= 0] (?,1)
          2. g(A,B,C) -> h(A,B,C)              [0 >= C]      (1,1)
          3. h(A,B,C) -> h(A,-1 + B,C)         [-1 + B >= 0] (?,1)
        Signature:
          {(f,3);(g,3);(h,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{3},3->{3}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: LooptreeTransformer MAYBE
    + Considered Problem:
        Rules:
          0. f(A,B,C) -> g(1,1,C)              True          (1,1)
          1. g(A,B,C) -> g(A + B,A + B,-1 + C) [-1 + C >= 0] (?,1)
          2. g(A,B,C) -> h(A,B,C)              [0 >= C]      (?,1)
          3. h(A,B,C) -> h(A,-1 + B,C)         [-1 + B >= 0] (?,1)
          4. h(A,B,C) -> exitus616(A,B,C)      True          (?,1)
        Signature:
          {(exitus616,3);(f,3);(g,3);(h,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{3,4},3->{3,4},4->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4]
          |
          +- p:[1] c: [1]
          |
          `- p:[3] c: [3]
* Step 4: SizeAbstraction MAYBE
    + Considered Problem:
        (Rules:
          0. f(A,B,C) -> g(1,1,C)              True          (1,1)
          1. g(A,B,C) -> g(A + B,A + B,-1 + C) [-1 + C >= 0] (?,1)
          2. g(A,B,C) -> h(A,B,C)              [0 >= C]      (?,1)
          3. h(A,B,C) -> h(A,-1 + B,C)         [-1 + B >= 0] (?,1)
          4. h(A,B,C) -> exitus616(A,B,C)      True          (?,1)
        Signature:
          {(exitus616,3);(f,3);(g,3);(h,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{3,4},3->{3,4},4->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3,4]
          |
          +- p:[1] c: [1]
          |
          `- p:[3] c: [3])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 5: FlowAbstraction MAYBE
    + Considered Problem:
        Program:
          Domain: [A,B,C,0.0,0.1]
           f  ~>  g           [A <= K, B <= K, C <= C]
           g  ~>  g           [A <= A + B, B <= A + B, C <= C]
           g  ~>  h           [A <= A, B <= B, C <= C]
           h  ~>  h           [A <= A, B <= B, C <= C]
           h  ~>  exitus616   [A <= A, B <= B, C <= C]
          + Loop: [0.0 <= C]
               g  ~>  g   [A <= A + B, B <= A + B, C <= C]
          + Loop: [0.1 <= B]
               h  ~>  h   [A <= A, B <= B, C <= C]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 6: LareProcessor MAYBE
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,C,0.0,0.1]
           f  ~>  g           [K ~=> A,K ~=> B]
           g  ~>  g           [A ~+> A,A ~+> B,B ~+> A,B ~+> B]
           g  ~>  h           []
           h  ~>  h           []
           h  ~>  exitus616   []
          + Loop: [C ~=> 0.0]
               g  ~>  g   [A ~+> A,A ~+> B,B ~+> A,B ~+> B]
          + Loop: [B ~=> 0.1]
               h  ~>  h   []
    + Applied Processor:
        LareProcessor
    + Details:
         f  ~>  exitus616   [C ~=> 0.0
                            ,K ~=> A
                            ,K ~=> B
                            ,K ~=> 0.1
                            ,C ~+> tick
                            ,tick ~+> tick
                            ,K ~+> A
                            ,K ~+> B
                            ,K ~+> 0.1
                            ,K ~+> tick
                            ,C ~*> A
                            ,C ~*> B
                            ,C ~*> 0.1
                            ,C ~*> tick
                            ,K ~*> A
                            ,K ~*> B
                            ,K ~*> 0.1
                            ,K ~*> tick
                            ,C ~^> A
                            ,C ~^> B
                            ,C ~^> 0.1
                            ,C ~^> tick]
        + <g  ~>  g>  [C ~=> 0.0
                      ,A ~+> A
                      ,A ~+> B
                      ,B ~+> A
                      ,B ~+> B
                      ,C ~+> tick
                      ,tick ~+> tick
                      ,A ~*> A
                      ,A ~*> B
                      ,B ~*> A
                      ,B ~*> B
                      ,C ~*> A
                      ,C ~*> B
                      ,C ~^> A
                      ,C ~^> B]
        + <h  ~>  h>  [B ~=> 0.1,B ~+> tick,tick ~+> tick]

YES(?,PRIMREC)