YES(?,POLY)
* Step 1: AddSinks WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. merge(A,B) -> merge(-1 + A,B) [A >= 1 && B >= 1] (?,1)
          1. merge(A,B) -> merge(A,-1 + B) [A >= 1 && B >= 1] (?,1)
          2. start(A,B) -> merge(A,B)      True               (1,1)
        Signature:
          {(merge,2);(start,2)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 2: LooptreeTransformer WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. merge(A,B) -> merge(-1 + A,B) [A >= 1 && B >= 1] (?,1)
          1. merge(A,B) -> merge(A,-1 + B) [A >= 1 && B >= 1] (?,1)
          2. start(A,B) -> merge(A,B)      True               (1,1)
          3. merge(A,B) -> exitus616(A,B)  True               (?,1)
        Signature:
          {(exitus616,2);(merge,2);(start,2)}
        Flow Graph:
          [0->{0,1,3},1->{0,1,3},2->{0,1,3},3->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[0,1] c: [1]
             |
             `- p:[0] c: [0]
* Step 3: SizeAbstraction WORST_CASE(?,POLY)
    + Considered Problem:
        (Rules:
          0. merge(A,B) -> merge(-1 + A,B) [A >= 1 && B >= 1] (?,1)
          1. merge(A,B) -> merge(A,-1 + B) [A >= 1 && B >= 1] (?,1)
          2. start(A,B) -> merge(A,B)      True               (1,1)
          3. merge(A,B) -> exitus616(A,B)  True               (?,1)
        Signature:
          {(exitus616,2);(merge,2);(start,2)}
        Flow Graph:
          [0->{0,1,3},1->{0,1,3},2->{0,1,3},3->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[0,1] c: [1]
             |
             `- p:[0] c: [0])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 4: FlowAbstraction WORST_CASE(?,POLY)
    + Considered Problem:
        Program:
          Domain: [A,B,0.0,0.0.0]
           merge  ~>  merge       [A <= A, B <= B]
           merge  ~>  merge       [A <= A, B <= B]
           start  ~>  merge       [A <= A, B <= B]
           merge  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= B]
               merge  ~>  merge   [A <= A, B <= B]
               merge  ~>  merge   [A <= A, B <= B]
            + Loop: [0.0.0 <= A]
                 merge  ~>  merge   [A <= A, B <= B]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 5: LareProcessor WORST_CASE(?,POLY)
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0,0.0.0]
           merge  ~>  merge       []
           merge  ~>  merge       []
           start  ~>  merge       []
           merge  ~>  exitus616   []
          + Loop: [B ~=> 0.0]
               merge  ~>  merge   []
               merge  ~>  merge   []
            + Loop: [A ~=> 0.0.0]
                 merge  ~>  merge   []
    + Applied Processor:
        LareProcessor
    + Details:
         start  ~>  exitus616   [A ~=> 0.0.0,B ~=> 0.0,A ~+> tick,B ~+> tick,tick ~+> tick,A ~*> tick,B ~*> tick]
        + <merge  ~>  merge>  [A ~=> 0.0.0,B ~=> 0.0,A ~+> tick,B ~+> tick,tick ~+> tick,A ~*> tick,B ~*> tick]
          + <merge  ~>  merge>  [A ~=> 0.0.0,A ~+> tick,tick ~+> tick]

YES(?,POLY)