NO

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: l6
      0: l0 -> l1 : Result_4^0'=Result_4^post_1, __cil_tmp2_6^0'=__cil_tmp2_6^post_1, __cil_tmp6_12^0'=__cil_tmp6_12^post_1, maxRetries_9^0'=maxRetries_9^post_1, retryCount_10^0'=retryCount_10^post_1, selected_11^0'=selected_11^post_1, x_5^0'=x_5^post_1, [ __cil_tmp2_6^post_1==x_5^0 && Result_4^1_1==__cil_tmp2_6^post_1 && selected_11^post_1==Result_4^1_1 && Result_4^post_1==Result_4^post_1 && __cil_tmp6_12^0==__cil_tmp6_12^post_1 && maxRetries_9^0==maxRetries_9^post_1 && retryCount_10^0==retryCount_10^post_1 && x_5^0==x_5^post_1 ], cost: 1
      4: l1 -> l3 : Result_4^0'=Result_4^post_5, __cil_tmp2_6^0'=__cil_tmp2_6^post_5, __cil_tmp6_12^0'=__cil_tmp6_12^post_5, maxRetries_9^0'=maxRetries_9^post_5, retryCount_10^0'=retryCount_10^post_5, selected_11^0'=selected_11^post_5, x_5^0'=x_5^post_5, [ retryCount_10^post_5==1+retryCount_10^0 && Result_4^0==Result_4^post_5 && __cil_tmp2_6^0==__cil_tmp2_6^post_5 && __cil_tmp6_12^0==__cil_tmp6_12^post_5 && maxRetries_9^0==maxRetries_9^post_5 && selected_11^0==selected_11^post_5 && x_5^0==x_5^post_5 ], cost: 1
      1: l2 -> l1 : Result_4^0'=Result_4^post_2, __cil_tmp2_6^0'=__cil_tmp2_6^post_2, __cil_tmp6_12^0'=__cil_tmp6_12^post_2, maxRetries_9^0'=maxRetries_9^post_2, retryCount_10^0'=retryCount_10^post_2, selected_11^0'=selected_11^post_2, x_5^0'=x_5^post_2, [ __cil_tmp2_6^post_2==x_5^0 && Result_4^1_2==__cil_tmp2_6^post_2 && selected_11^post_2==Result_4^1_2 && Result_4^post_2==Result_4^post_2 && __cil_tmp6_12^0==__cil_tmp6_12^post_2 && maxRetries_9^0==maxRetries_9^post_2 && retryCount_10^0==retryCount_10^post_2 && x_5^0==x_5^post_2 ], cost: 1
      2: l3 -> l4 : Result_4^0'=Result_4^post_3, __cil_tmp2_6^0'=__cil_tmp2_6^post_3, __cil_tmp6_12^0'=__cil_tmp6_12^post_3, maxRetries_9^0'=maxRetries_9^post_3, retryCount_10^0'=retryCount_10^post_3, selected_11^0'=selected_11^post_3, x_5^0'=x_5^post_3, [ __cil_tmp6_12^post_3==selected_11^0 && Result_4^post_3==__cil_tmp6_12^post_3 && __cil_tmp2_6^0==__cil_tmp2_6^post_3 && maxRetries_9^0==maxRetries_9^post_3 && retryCount_10^0==retryCount_10^post_3 && selected_11^0==selected_11^post_3 && x_5^0==x_5^post_3 ], cost: 1
      3: l3 -> l1 : Result_4^0'=Result_4^post_4, __cil_tmp2_6^0'=__cil_tmp2_6^post_4, __cil_tmp6_12^0'=__cil_tmp6_12^post_4, maxRetries_9^0'=maxRetries_9^post_4, retryCount_10^0'=retryCount_10^post_4, selected_11^0'=selected_11^post_4, x_5^0'=x_5^post_4, [ __cil_tmp2_6^post_4==x_5^0 && Result_4^1_3==__cil_tmp2_6^post_4 && selected_11^post_4==Result_4^1_3 && Result_4^post_4==Result_4^post_4 && __cil_tmp6_12^0==__cil_tmp6_12^post_4 && maxRetries_9^0==maxRetries_9^post_4 && retryCount_10^0==retryCount_10^post_4 && x_5^0==x_5^post_4 ], cost: 1
      5: l5 -> l3 : Result_4^0'=Result_4^post_6, __cil_tmp2_6^0'=__cil_tmp2_6^post_6, __cil_tmp6_12^0'=__cil_tmp6_12^post_6, maxRetries_9^0'=maxRetries_9^post_6, retryCount_10^0'=retryCount_10^post_6, selected_11^0'=selected_11^post_6, x_5^0'=x_5^post_6, [ maxRetries_9^post_6==4 && retryCount_10^post_6==0 && selected_11^post_6==0 && Result_4^0==Result_4^post_6 && __cil_tmp2_6^0==__cil_tmp2_6^post_6 && __cil_tmp6_12^0==__cil_tmp6_12^post_6 && x_5^0==x_5^post_6 ], cost: 1
      6: l6 -> l5 : Result_4^0'=Result_4^post_7, __cil_tmp2_6^0'=__cil_tmp2_6^post_7, __cil_tmp6_12^0'=__cil_tmp6_12^post_7, maxRetries_9^0'=maxRetries_9^post_7, retryCount_10^0'=retryCount_10^post_7, selected_11^0'=selected_11^post_7, x_5^0'=x_5^post_7, [ Result_4^0==Result_4^post_7 && __cil_tmp2_6^0==__cil_tmp2_6^post_7 && __cil_tmp6_12^0==__cil_tmp6_12^post_7 && maxRetries_9^0==maxRetries_9^post_7 && retryCount_10^0==retryCount_10^post_7 && selected_11^0==selected_11^post_7 && x_5^0==x_5^post_7 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      6: l6 -> l5 : Result_4^0'=Result_4^post_7, __cil_tmp2_6^0'=__cil_tmp2_6^post_7, __cil_tmp6_12^0'=__cil_tmp6_12^post_7, maxRetries_9^0'=maxRetries_9^post_7, retryCount_10^0'=retryCount_10^post_7, selected_11^0'=selected_11^post_7, x_5^0'=x_5^post_7, [ Result_4^0==Result_4^post_7 && __cil_tmp2_6^0==__cil_tmp2_6^post_7 && __cil_tmp6_12^0==__cil_tmp6_12^post_7 && maxRetries_9^0==maxRetries_9^post_7 && retryCount_10^0==retryCount_10^post_7 && selected_11^0==selected_11^post_7 && x_5^0==x_5^post_7 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l6
      4: l1 -> l3 : Result_4^0'=Result_4^post_5, __cil_tmp2_6^0'=__cil_tmp2_6^post_5, __cil_tmp6_12^0'=__cil_tmp6_12^post_5, maxRetries_9^0'=maxRetries_9^post_5, retryCount_10^0'=retryCount_10^post_5, selected_11^0'=selected_11^post_5, x_5^0'=x_5^post_5, [ retryCount_10^post_5==1+retryCount_10^0 && Result_4^0==Result_4^post_5 && __cil_tmp2_6^0==__cil_tmp2_6^post_5 && __cil_tmp6_12^0==__cil_tmp6_12^post_5 && maxRetries_9^0==maxRetries_9^post_5 && selected_11^0==selected_11^post_5 && x_5^0==x_5^post_5 ], cost: 1
      3: l3 -> l1 : Result_4^0'=Result_4^post_4, __cil_tmp2_6^0'=__cil_tmp2_6^post_4, __cil_tmp6_12^0'=__cil_tmp6_12^post_4, maxRetries_9^0'=maxRetries_9^post_4, retryCount_10^0'=retryCount_10^post_4, selected_11^0'=selected_11^post_4, x_5^0'=x_5^post_4, [ __cil_tmp2_6^post_4==x_5^0 && Result_4^1_3==__cil_tmp2_6^post_4 && selected_11^post_4==Result_4^1_3 && Result_4^post_4==Result_4^post_4 && __cil_tmp6_12^0==__cil_tmp6_12^post_4 && maxRetries_9^0==maxRetries_9^post_4 && retryCount_10^0==retryCount_10^post_4 && x_5^0==x_5^post_4 ], cost: 1
      5: l5 -> l3 : Result_4^0'=Result_4^post_6, __cil_tmp2_6^0'=__cil_tmp2_6^post_6, __cil_tmp6_12^0'=__cil_tmp6_12^post_6, maxRetries_9^0'=maxRetries_9^post_6, retryCount_10^0'=retryCount_10^post_6, selected_11^0'=selected_11^post_6, x_5^0'=x_5^post_6, [ maxRetries_9^post_6==4 && retryCount_10^post_6==0 && selected_11^post_6==0 && Result_4^0==Result_4^post_6 && __cil_tmp2_6^0==__cil_tmp2_6^post_6 && __cil_tmp6_12^0==__cil_tmp6_12^post_6 && x_5^0==x_5^post_6 ], cost: 1
      6: l6 -> l5 : Result_4^0'=Result_4^post_7, __cil_tmp2_6^0'=__cil_tmp2_6^post_7, __cil_tmp6_12^0'=__cil_tmp6_12^post_7, maxRetries_9^0'=maxRetries_9^post_7, retryCount_10^0'=retryCount_10^post_7, selected_11^0'=selected_11^post_7, x_5^0'=x_5^post_7, [ Result_4^0==Result_4^post_7 && __cil_tmp2_6^0==__cil_tmp2_6^post_7 && __cil_tmp6_12^0==__cil_tmp6_12^post_7 && maxRetries_9^0==maxRetries_9^post_7 && retryCount_10^0==retryCount_10^post_7 && selected_11^0==selected_11^post_7 && x_5^0==x_5^post_7 ], cost: 1

Simplified all rules, resulting in:
   Start location: l6
      4: l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, [], cost: 1
      3: l3 -> l1 : Result_4^0'=Result_4^post_4, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, [], cost: 1
      5: l5 -> l3 : maxRetries_9^0'=4, retryCount_10^0'=0, selected_11^0'=0, [], cost: 1
      6: l6 -> l5 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l6
      8: l3 -> l3 : Result_4^0'=Result_4^post_4, __cil_tmp2_6^0'=x_5^0, retryCount_10^0'=1+retryCount_10^0, selected_11^0'=x_5^0, [], cost: 2
      7: l6 -> l3 : maxRetries_9^0'=4, retryCount_10^0'=0, selected_11^0'=0, [], cost: 2

Accelerating simple loops of location 3.
   Accelerating the following rules:
      8: l3 -> l3 : Result_4^0'=Result_4^post_4, __cil_tmp2_6^0'=x_5^0, retryCount_10^0'=1+retryCount_10^0, selected_11^0'=x_5^0, [], cost: 2

   Accelerated rule 8 with non-termination, yielding the new rule 9.
[accelerate] Nesting with 0 inner and 0 outer candidates
   Removing the simple loops: 8.

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
      9: l3 -> [7] : [], cost: NONTERM
      7: l6 -> l3 : maxRetries_9^0'=4, retryCount_10^0'=0, selected_11^0'=0, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l6
      7: l6 -> l3 : maxRetries_9^0'=4, retryCount_10^0'=0, selected_11^0'=0, [], cost: 2
     10: l6 -> [7] : [], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l6
     10: l6 -> [7] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l6
     10: l6 -> [7] : [], cost: NONTERM

Computing asymptotic complexity for rule 10
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  []

NO