WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l2
      0: l0 -> l1 : Result_4^0'=Result_4^post_1, cnt_59^0'=cnt_59^post_1, devExt_7^0'=devExt_7^post_1, i_12^0'=i_12^post_1, irp_11^0'=irp_11^post_1, loop_count_14^0'=loop_count_14^post_1, loop_max_13^0'=loop_max_13^post_1, lt_47^0'=lt_47^post_1, nPacketsOld_9^0'=nPacketsOld_9^post_1, nPackets_10^0'=nPackets_10^post_1, request_8^0'=request_8^post_1, [ loop_count_14^post_1==loop_count_14^post_1 && loop_max_13^post_1==loop_max_13^post_1 && i_12^post_1==i_12^post_1 && irp_11^post_1==irp_11^post_1 && nPackets_10^post_1==nPackets_10^post_1 && nPacketsOld_9^post_1==nPacketsOld_9^post_1 && request_8^post_1==request_8^post_1 && devExt_7^post_1==devExt_7^post_1 && lt_47^post_1==cnt_59^0 && Result_4^post_1==Result_4^post_1 && cnt_59^0==cnt_59^post_1 ], cost: 1
      1: l2 -> l0 : Result_4^0'=Result_4^post_2, cnt_59^0'=cnt_59^post_2, devExt_7^0'=devExt_7^post_2, i_12^0'=i_12^post_2, irp_11^0'=irp_11^post_2, loop_count_14^0'=loop_count_14^post_2, loop_max_13^0'=loop_max_13^post_2, lt_47^0'=lt_47^post_2, nPacketsOld_9^0'=nPacketsOld_9^post_2, nPackets_10^0'=nPackets_10^post_2, request_8^0'=request_8^post_2, [ Result_4^0==Result_4^post_2 && cnt_59^0==cnt_59^post_2 && devExt_7^0==devExt_7^post_2 && i_12^0==i_12^post_2 && irp_11^0==irp_11^post_2 && loop_count_14^0==loop_count_14^post_2 && loop_max_13^0==loop_max_13^post_2 && lt_47^0==lt_47^post_2 && nPacketsOld_9^0==nPacketsOld_9^post_2 && nPackets_10^0==nPackets_10^post_2 && request_8^0==request_8^post_2 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      1: l2 -> l0 : Result_4^0'=Result_4^post_2, cnt_59^0'=cnt_59^post_2, devExt_7^0'=devExt_7^post_2, i_12^0'=i_12^post_2, irp_11^0'=irp_11^post_2, loop_count_14^0'=loop_count_14^post_2, loop_max_13^0'=loop_max_13^post_2, lt_47^0'=lt_47^post_2, nPacketsOld_9^0'=nPacketsOld_9^post_2, nPackets_10^0'=nPackets_10^post_2, request_8^0'=request_8^post_2, [ Result_4^0==Result_4^post_2 && cnt_59^0==cnt_59^post_2 && devExt_7^0==devExt_7^post_2 && i_12^0==i_12^post_2 && irp_11^0==irp_11^post_2 && loop_count_14^0==loop_count_14^post_2 && loop_max_13^0==loop_max_13^post_2 && lt_47^0==lt_47^post_2 && nPacketsOld_9^0==nPacketsOld_9^post_2 && nPackets_10^0==nPackets_10^post_2 && request_8^0==request_8^post_2 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l2
     <empty>

Empty problem, aborting

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  [ Result_4^0==Result_4^post_2 && cnt_59^0==cnt_59^post_2 && devExt_7^0==devExt_7^post_2 && i_12^0==i_12^post_2 && irp_11^0==irp_11^post_2 && loop_count_14^0==loop_count_14^post_2 && loop_max_13^0==loop_max_13^post_2 && lt_47^0==lt_47^post_2 && nPacketsOld_9^0==nPacketsOld_9^post_2 && nPackets_10^0==nPackets_10^post_2 && request_8^0==request_8^post_2 ]

WORST_CASE(Omega(1),?)