YES(?,O(n^1))
* Step 1: FromIts WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. start(A,B) -> sumto(A,B)     True         (1,1)
          1. sumto(A,B) -> sumto(1 + A,B) [B >= A]     (?,1)
          2. sumto(A,B) -> end(A,B)       [A >= 1 + B] (?,1)
        Signature:
          {(end,2);(start,2);(sumto,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          start(A,B) -> sumto(A,B)      True
          sumto(A,B) -> sumto(1 + A,B)  [B >= A]
          sumto(A,B) -> end(A,B)        [A >= 1 + B]
        Signature:
          {(end,2);(start,2);(sumto,2)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Decompose WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          start(A,B) -> sumto(A,B)      True
          sumto(A,B) -> sumto(1 + A,B)  [B >= A]
          sumto(A,B) -> end(A,B)        [A >= 1 + B]
          end(A,B)   -> exitus616(A,B)  True
        Signature:
          {(end,2);(exitus616,2);(start,2);(sumto,2)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{3}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1]
* Step 4: AbstractSize WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          start(A,B) -> sumto(A,B)      True
          sumto(A,B) -> sumto(1 + A,B)  [B >= A]
          sumto(A,B) -> end(A,B)        [A >= 1 + B]
          end(A,B)   -> exitus616(A,B)  True
        Signature:
          {(end,2);(exitus616,2);(start,2);(sumto,2)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{3}]
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 5: AbstractFlow WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           start  ~>  sumto       [A <= A, B <= B]
           sumto  ~>  sumto       [A <= K + A, B <= B]
           sumto  ~>  end         [A <= A, B <= B]
           end    ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= A + B]
               sumto  ~>  sumto   [A <= K + A, B <= B]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 6: Lare WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           start  ~>  sumto       []
           sumto  ~>  sumto       [A ~+> A,K ~+> A]
           sumto  ~>  end         []
           end    ~>  exitus616   []
          + Loop: [A ~+> 0.0,B ~+> 0.0]
               sumto  ~>  sumto   [A ~+> A,K ~+> A]
    + Applied Processor:
        Lare
    + Details:
         start  ~>  exitus616   [A ~+> A
                                ,A ~+> 0.0
                                ,A ~+> tick
                                ,B ~+> 0.0
                                ,B ~+> tick
                                ,tick ~+> tick
                                ,K ~+> A
                                ,A ~*> A
                                ,B ~*> A
                                ,K ~*> A]
        + <sumto  ~>  sumto>  [A ~+> A
                              ,A ~+> 0.0
                              ,A ~+> tick
                              ,B ~+> 0.0
                              ,B ~+> tick
                              ,tick ~+> tick
                              ,K ~+> A
                              ,A ~*> A
                              ,B ~*> A
                              ,K ~*> A]

YES(?,O(n^1))