WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l26
      0: l0 -> l1 : bDomain^0'=bDomain^post_1, bExists^0'=bExists^post_1, bSorted^0'=bSorted^post_1, nDim^0'=nDim^post_1, ni^0'=ni^post_1, nj^0'=nj^post_1, tmp^0'=tmp^post_1, tmp___0^0'=tmp___0^post_1, tmp___1^0'=tmp___1^post_1, tmp___2^0'=tmp___2^post_1, tmp___3^0'=tmp___3^post_1, tmp___4^0'=tmp___4^post_1, [ bDomain^0==bDomain^post_1 && bExists^0==bExists^post_1 && bSorted^0==bSorted^post_1 && nDim^0==nDim^post_1 && ni^0==ni^post_1 && nj^0==nj^post_1 && tmp^0==tmp^post_1 && tmp___0^0==tmp___0^post_1 && tmp___1^0==tmp___1^post_1 && tmp___2^0==tmp___2^post_1 && tmp___3^0==tmp___3^post_1 && tmp___4^0==tmp___4^post_1 ], cost: 1
      1: l2 -> l0 : bDomain^0'=bDomain^post_2, bExists^0'=bExists^post_2, bSorted^0'=bSorted^post_2, nDim^0'=nDim^post_2, ni^0'=ni^post_2, nj^0'=nj^post_2, tmp^0'=tmp^post_2, tmp___0^0'=tmp___0^post_2, tmp___1^0'=tmp___1^post_2, tmp___2^0'=tmp___2^post_2, tmp___3^0'=tmp___3^post_2, tmp___4^0'=tmp___4^post_2, [ tmp___4^post_2==0 && bDomain^0==bDomain^post_2 && bExists^0==bExists^post_2 && bSorted^0==bSorted^post_2 && nDim^0==nDim^post_2 && ni^0==ni^post_2 && nj^0==nj^post_2 && tmp^0==tmp^post_2 && tmp___0^0==tmp___0^post_2 && tmp___1^0==tmp___1^post_2 && tmp___2^0==tmp___2^post_2 && tmp___3^0==tmp___3^post_2 ], cost: 1
      2: l3 -> l0 : bDomain^0'=bDomain^post_3, bExists^0'=bExists^post_3, bSorted^0'=bSorted^post_3, nDim^0'=nDim^post_3, ni^0'=ni^post_3, nj^0'=nj^post_3, tmp^0'=tmp^post_3, tmp___0^0'=tmp___0^post_3, tmp___1^0'=tmp___1^post_3, tmp___2^0'=tmp___2^post_3, tmp___3^0'=tmp___3^post_3, tmp___4^0'=tmp___4^post_3, [ bSorted^0<=0 && 0<=bSorted^0 && tmp___4^post_3==1 && bDomain^0==bDomain^post_3 && bExists^0==bExists^post_3 && bSorted^0==bSorted^post_3 && nDim^0==nDim^post_3 && ni^0==ni^post_3 && nj^0==nj^post_3 && tmp^0==tmp^post_3 && tmp___0^0==tmp___0^post_3 && tmp___1^0==tmp___1^post_3 && tmp___2^0==tmp___2^post_3 && tmp___3^0==tmp___3^post_3 ], cost: 1
      3: l3 -> l2 : bDomain^0'=bDomain^post_4, bExists^0'=bExists^post_4, bSorted^0'=bSorted^post_4, nDim^0'=nDim^post_4, ni^0'=ni^post_4, nj^0'=nj^post_4, tmp^0'=tmp^post_4, tmp___0^0'=tmp___0^post_4, tmp___1^0'=tmp___1^post_4, tmp___2^0'=tmp___2^post_4, tmp___3^0'=tmp___3^post_4, tmp___4^0'=tmp___4^post_4, [ 1<=bSorted^0 && bDomain^0==bDomain^post_4 && bExists^0==bExists^post_4 && bSorted^0==bSorted^post_4 && nDim^0==nDim^post_4 && ni^0==ni^post_4 && nj^0==nj^post_4 && tmp^0==tmp^post_4 && tmp___0^0==tmp___0^post_4 && tmp___1^0==tmp___1^post_4 && tmp___2^0==tmp___2^post_4 && tmp___3^0==tmp___3^post_4 && tmp___4^0==tmp___4^post_4 ], cost: 1
      4: l3 -> l2 : bDomain^0'=bDomain^post_5, bExists^0'=bExists^post_5, bSorted^0'=bSorted^post_5, nDim^0'=nDim^post_5, ni^0'=ni^post_5, nj^0'=nj^post_5, tmp^0'=tmp^post_5, tmp___0^0'=tmp___0^post_5, tmp___1^0'=tmp___1^post_5, tmp___2^0'=tmp___2^post_5, tmp___3^0'=tmp___3^post_5, tmp___4^0'=tmp___4^post_5, [ 1+bSorted^0<=0 && bDomain^0==bDomain^post_5 && bExists^0==bExists^post_5 && bSorted^0==bSorted^post_5 && nDim^0==nDim^post_5 && ni^0==ni^post_5 && nj^0==nj^post_5 && tmp^0==tmp^post_5 && tmp___0^0==tmp___0^post_5 && tmp___1^0==tmp___1^post_5 && tmp___2^0==tmp___2^post_5 && tmp___3^0==tmp___3^post_5 && tmp___4^0==tmp___4^post_5 ], cost: 1
      5: l4 -> l0 : bDomain^0'=bDomain^post_6, bExists^0'=bExists^post_6, bSorted^0'=bSorted^post_6, nDim^0'=nDim^post_6, ni^0'=ni^post_6, nj^0'=nj^post_6, tmp^0'=tmp^post_6, tmp___0^0'=tmp___0^post_6, tmp___1^0'=tmp___1^post_6, tmp___2^0'=tmp___2^post_6, tmp___3^0'=tmp___3^post_6, tmp___4^0'=tmp___4^post_6, [ bDomain^0<=0 && 0<=bDomain^0 && tmp___4^post_6==1 && bDomain^0==bDomain^post_6 && bExists^0==bExists^post_6 && bSorted^0==bSorted^post_6 && nDim^0==nDim^post_6 && ni^0==ni^post_6 && nj^0==nj^post_6 && tmp^0==tmp^post_6 && tmp___0^0==tmp___0^post_6 && tmp___1^0==tmp___1^post_6 && tmp___2^0==tmp___2^post_6 && tmp___3^0==tmp___3^post_6 ], cost: 1
      6: l4 -> l3 : bDomain^0'=bDomain^post_7, bExists^0'=bExists^post_7, bSorted^0'=bSorted^post_7, nDim^0'=nDim^post_7, ni^0'=ni^post_7, nj^0'=nj^post_7, tmp^0'=tmp^post_7, tmp___0^0'=tmp___0^post_7, tmp___1^0'=tmp___1^post_7, tmp___2^0'=tmp___2^post_7, tmp___3^0'=tmp___3^post_7, tmp___4^0'=tmp___4^post_7, [ 1<=bDomain^0 && bDomain^0==bDomain^post_7 && bExists^0==bExists^post_7 && bSorted^0==bSorted^post_7 && nDim^0==nDim^post_7 && ni^0==ni^post_7 && nj^0==nj^post_7 && tmp^0==tmp^post_7 && tmp___0^0==tmp___0^post_7 && tmp___1^0==tmp___1^post_7 && tmp___2^0==tmp___2^post_7 && tmp___3^0==tmp___3^post_7 && tmp___4^0==tmp___4^post_7 ], cost: 1
      7: l4 -> l3 : bDomain^0'=bDomain^post_8, bExists^0'=bExists^post_8, bSorted^0'=bSorted^post_8, nDim^0'=nDim^post_8, ni^0'=ni^post_8, nj^0'=nj^post_8, tmp^0'=tmp^post_8, tmp___0^0'=tmp___0^post_8, tmp___1^0'=tmp___1^post_8, tmp___2^0'=tmp___2^post_8, tmp___3^0'=tmp___3^post_8, tmp___4^0'=tmp___4^post_8, [ 1+bDomain^0<=0 && bDomain^0==bDomain^post_8 && bExists^0==bExists^post_8 && bSorted^0==bSorted^post_8 && nDim^0==nDim^post_8 && ni^0==ni^post_8 && nj^0==nj^post_8 && tmp^0==tmp^post_8 && tmp___0^0==tmp___0^post_8 && tmp___1^0==tmp___1^post_8 && tmp___2^0==tmp___2^post_8 && tmp___3^0==tmp___3^post_8 && tmp___4^0==tmp___4^post_8 ], cost: 1
      8: l5 -> l6 : bDomain^0'=bDomain^post_9, bExists^0'=bExists^post_9, bSorted^0'=bSorted^post_9, nDim^0'=nDim^post_9, ni^0'=ni^post_9, nj^0'=nj^post_9, tmp^0'=tmp^post_9, tmp___0^0'=tmp___0^post_9, tmp___1^0'=tmp___1^post_9, tmp___2^0'=tmp___2^post_9, tmp___3^0'=tmp___3^post_9, tmp___4^0'=tmp___4^post_9, [ bSorted^post_9==tmp___3^0 && ni^post_9==1+ni^0 && bDomain^0==bDomain^post_9 && bExists^0==bExists^post_9 && nDim^0==nDim^post_9 && nj^0==nj^post_9 && tmp^0==tmp^post_9 && tmp___0^0==tmp___0^post_9 && tmp___1^0==tmp___1^post_9 && tmp___2^0==tmp___2^post_9 && tmp___3^0==tmp___3^post_9 && tmp___4^0==tmp___4^post_9 ], cost: 1
     42: l6 -> l9 : bDomain^0'=bDomain^post_43, bExists^0'=bExists^post_43, bSorted^0'=bSorted^post_43, nDim^0'=nDim^post_43, ni^0'=ni^post_43, nj^0'=nj^post_43, tmp^0'=tmp^post_43, tmp___0^0'=tmp___0^post_43, tmp___1^0'=tmp___1^post_43, tmp___2^0'=tmp___2^post_43, tmp___3^0'=tmp___3^post_43, tmp___4^0'=tmp___4^post_43, [ bDomain^0==bDomain^post_43 && bExists^0==bExists^post_43 && bSorted^0==bSorted^post_43 && nDim^0==nDim^post_43 && ni^0==ni^post_43 && nj^0==nj^post_43 && tmp^0==tmp^post_43 && tmp___0^0==tmp___0^post_43 && tmp___1^0==tmp___1^post_43 && tmp___2^0==tmp___2^post_43 && tmp___3^0==tmp___3^post_43 && tmp___4^0==tmp___4^post_43 ], cost: 1
      9: l7 -> l5 : bDomain^0'=bDomain^post_10, bExists^0'=bExists^post_10, bSorted^0'=bSorted^post_10, nDim^0'=nDim^post_10, ni^0'=ni^post_10, nj^0'=nj^post_10, tmp^0'=tmp^post_10, tmp___0^0'=tmp___0^post_10, tmp___1^0'=tmp___1^post_10, tmp___2^0'=tmp___2^post_10, tmp___3^0'=tmp___3^post_10, tmp___4^0'=tmp___4^post_10, [ tmp___3^post_10==1 && bDomain^0==bDomain^post_10 && bExists^0==bExists^post_10 && bSorted^0==bSorted^post_10 && nDim^0==nDim^post_10 && ni^0==ni^post_10 && nj^0==nj^post_10 && tmp^0==tmp^post_10 && tmp___0^0==tmp___0^post_10 && tmp___1^0==tmp___1^post_10 && tmp___2^0==tmp___2^post_10 && tmp___4^0==tmp___4^post_10 ], cost: 1
     10: l7 -> l5 : bDomain^0'=bDomain^post_11, bExists^0'=bExists^post_11, bSorted^0'=bSorted^post_11, nDim^0'=nDim^post_11, ni^0'=ni^post_11, nj^0'=nj^post_11, tmp^0'=tmp^post_11, tmp___0^0'=tmp___0^post_11, tmp___1^0'=tmp___1^post_11, tmp___2^0'=tmp___2^post_11, tmp___3^0'=tmp___3^post_11, tmp___4^0'=tmp___4^post_11, [ tmp___3^post_11==0 && bDomain^0==bDomain^post_11 && bExists^0==bExists^post_11 && bSorted^0==bSorted^post_11 && nDim^0==nDim^post_11 && ni^0==ni^post_11 && nj^0==nj^post_11 && tmp^0==tmp^post_11 && tmp___0^0==tmp___0^post_11 && tmp___1^0==tmp___1^post_11 && tmp___2^0==tmp___2^post_11 && tmp___4^0==tmp___4^post_11 ], cost: 1
     11: l8 -> l5 : bDomain^0'=bDomain^post_12, bExists^0'=bExists^post_12, bSorted^0'=bSorted^post_12, nDim^0'=nDim^post_12, ni^0'=ni^post_12, nj^0'=nj^post_12, tmp^0'=tmp^post_12, tmp___0^0'=tmp___0^post_12, tmp___1^0'=tmp___1^post_12, tmp___2^0'=tmp___2^post_12, tmp___3^0'=tmp___3^post_12, tmp___4^0'=tmp___4^post_12, [ bSorted^0<=0 && 0<=bSorted^0 && tmp___3^post_12==0 && bDomain^0==bDomain^post_12 && bExists^0==bExists^post_12 && bSorted^0==bSorted^post_12 && nDim^0==nDim^post_12 && ni^0==ni^post_12 && nj^0==nj^post_12 && tmp^0==tmp^post_12 && tmp___0^0==tmp___0^post_12 && tmp___1^0==tmp___1^post_12 && tmp___2^0==tmp___2^post_12 && tmp___4^0==tmp___4^post_12 ], cost: 1
     12: l8 -> l7 : bDomain^0'=bDomain^post_13, bExists^0'=bExists^post_13, bSorted^0'=bSorted^post_13, nDim^0'=nDim^post_13, ni^0'=ni^post_13, nj^0'=nj^post_13, tmp^0'=tmp^post_13, tmp___0^0'=tmp___0^post_13, tmp___1^0'=tmp___1^post_13, tmp___2^0'=tmp___2^post_13, tmp___3^0'=tmp___3^post_13, tmp___4^0'=tmp___4^post_13, [ 1<=bSorted^0 && bDomain^0==bDomain^post_13 && bExists^0==bExists^post_13 && bSorted^0==bSorted^post_13 && nDim^0==nDim^post_13 && ni^0==ni^post_13 && nj^0==nj^post_13 && tmp^0==tmp^post_13 && tmp___0^0==tmp___0^post_13 && tmp___1^0==tmp___1^post_13 && tmp___2^0==tmp___2^post_13 && tmp___3^0==tmp___3^post_13 && tmp___4^0==tmp___4^post_13 ], cost: 1
     13: l8 -> l7 : bDomain^0'=bDomain^post_14, bExists^0'=bExists^post_14, bSorted^0'=bSorted^post_14, nDim^0'=nDim^post_14, ni^0'=ni^post_14, nj^0'=nj^post_14, tmp^0'=tmp^post_14, tmp___0^0'=tmp___0^post_14, tmp___1^0'=tmp___1^post_14, tmp___2^0'=tmp___2^post_14, tmp___3^0'=tmp___3^post_14, tmp___4^0'=tmp___4^post_14, [ 1+bSorted^0<=0 && bDomain^0==bDomain^post_14 && bExists^0==bExists^post_14 && bSorted^0==bSorted^post_14 && nDim^0==nDim^post_14 && ni^0==ni^post_14 && nj^0==nj^post_14 && tmp^0==tmp^post_14 && tmp___0^0==tmp___0^post_14 && tmp___1^0==tmp___1^post_14 && tmp___2^0==tmp___2^post_14 && tmp___3^0==tmp___3^post_14 && tmp___4^0==tmp___4^post_14 ], cost: 1
     14: l9 -> l4 : bDomain^0'=bDomain^post_15, bExists^0'=bExists^post_15, bSorted^0'=bSorted^post_15, nDim^0'=nDim^post_15, ni^0'=ni^post_15, nj^0'=nj^post_15, tmp^0'=tmp^post_15, tmp___0^0'=tmp___0^post_15, tmp___1^0'=tmp___1^post_15, tmp___2^0'=tmp___2^post_15, tmp___3^0'=tmp___3^post_15, tmp___4^0'=tmp___4^post_15, [ -1+nDim^0<=ni^0 && bDomain^0==bDomain^post_15 && bExists^0==bExists^post_15 && bSorted^0==bSorted^post_15 && nDim^0==nDim^post_15 && ni^0==ni^post_15 && nj^0==nj^post_15 && tmp^0==tmp^post_15 && tmp___0^0==tmp___0^post_15 && tmp___1^0==tmp___1^post_15 && tmp___2^0==tmp___2^post_15 && tmp___3^0==tmp___3^post_15 && tmp___4^0==tmp___4^post_15 ], cost: 1
     15: l9 -> l8 : bDomain^0'=bDomain^post_16, bExists^0'=bExists^post_16, bSorted^0'=bSorted^post_16, nDim^0'=nDim^post_16, ni^0'=ni^post_16, nj^0'=nj^post_16, tmp^0'=tmp^post_16, tmp___0^0'=tmp___0^post_16, tmp___1^0'=tmp___1^post_16, tmp___2^0'=tmp___2^post_16, tmp___3^0'=tmp___3^post_16, tmp___4^0'=tmp___4^post_16, [ 1+ni^0<=-1+nDim^0 && bDomain^0==bDomain^post_16 && bExists^0==bExists^post_16 && bSorted^0==bSorted^post_16 && nDim^0==nDim^post_16 && ni^0==ni^post_16 && nj^0==nj^post_16 && tmp^0==tmp^post_16 && tmp___0^0==tmp___0^post_16 && tmp___1^0==tmp___1^post_16 && tmp___2^0==tmp___2^post_16 && tmp___3^0==tmp___3^post_16 && tmp___4^0==tmp___4^post_16 ], cost: 1
     16: l10 -> l11 : bDomain^0'=bDomain^post_17, bExists^0'=bExists^post_17, bSorted^0'=bSorted^post_17, nDim^0'=nDim^post_17, ni^0'=ni^post_17, nj^0'=nj^post_17, tmp^0'=tmp^post_17, tmp___0^0'=tmp___0^post_17, tmp___1^0'=tmp___1^post_17, tmp___2^0'=tmp___2^post_17, tmp___3^0'=tmp___3^post_17, tmp___4^0'=tmp___4^post_17, [ bDomain^0==bDomain^post_17 && bExists^0==bExists^post_17 && bSorted^0==bSorted^post_17 && nDim^0==nDim^post_17 && ni^0==ni^post_17 && nj^0==nj^post_17 && tmp^0==tmp^post_17 && tmp___0^0==tmp___0^post_17 && tmp___1^0==tmp___1^post_17 && tmp___2^0==tmp___2^post_17 && tmp___3^0==tmp___3^post_17 && tmp___4^0==tmp___4^post_17 ], cost: 1
     40: l11 -> l13 : bDomain^0'=bDomain^post_41, bExists^0'=bExists^post_41, bSorted^0'=bSorted^post_41, nDim^0'=nDim^post_41, ni^0'=ni^post_41, nj^0'=nj^post_41, tmp^0'=tmp^post_41, tmp___0^0'=tmp___0^post_41, tmp___1^0'=tmp___1^post_41, tmp___2^0'=tmp___2^post_41, tmp___3^0'=tmp___3^post_41, tmp___4^0'=tmp___4^post_41, [ nDim^0<=ni^0 && ni^post_41==0 && bDomain^0==bDomain^post_41 && bExists^0==bExists^post_41 && bSorted^0==bSorted^post_41 && nDim^0==nDim^post_41 && nj^0==nj^post_41 && tmp^0==tmp^post_41 && tmp___0^0==tmp___0^post_41 && tmp___1^0==tmp___1^post_41 && tmp___2^0==tmp___2^post_41 && tmp___3^0==tmp___3^post_41 && tmp___4^0==tmp___4^post_41 ], cost: 1
     41: l11 -> l10 : bDomain^0'=bDomain^post_42, bExists^0'=bExists^post_42, bSorted^0'=bSorted^post_42, nDim^0'=nDim^post_42, ni^0'=ni^post_42, nj^0'=nj^post_42, tmp^0'=tmp^post_42, tmp___0^0'=tmp___0^post_42, tmp___1^0'=tmp___1^post_42, tmp___2^0'=tmp___2^post_42, tmp___3^0'=tmp___3^post_42, tmp___4^0'=tmp___4^post_42, [ 1+ni^0<=nDim^0 && ni^post_42==1+ni^0 && bDomain^0==bDomain^post_42 && bExists^0==bExists^post_42 && bSorted^0==bSorted^post_42 && nDim^0==nDim^post_42 && nj^0==nj^post_42 && tmp^0==tmp^post_42 && tmp___0^0==tmp___0^post_42 && tmp___1^0==tmp___1^post_42 && tmp___2^0==tmp___2^post_42 && tmp___3^0==tmp___3^post_42 && tmp___4^0==tmp___4^post_42 ], cost: 1
     17: l12 -> l13 : bDomain^0'=bDomain^post_18, bExists^0'=bExists^post_18, bSorted^0'=bSorted^post_18, nDim^0'=nDim^post_18, ni^0'=ni^post_18, nj^0'=nj^post_18, tmp^0'=tmp^post_18, tmp___0^0'=tmp___0^post_18, tmp___1^0'=tmp___1^post_18, tmp___2^0'=tmp___2^post_18, tmp___3^0'=tmp___3^post_18, tmp___4^0'=tmp___4^post_18, [ bDomain^post_18==tmp___2^0 && ni^post_18==1+ni^0 && bExists^0==bExists^post_18 && bSorted^0==bSorted^post_18 && nDim^0==nDim^post_18 && nj^0==nj^post_18 && tmp^0==tmp^post_18 && tmp___0^0==tmp___0^post_18 && tmp___1^0==tmp___1^post_18 && tmp___2^0==tmp___2^post_18 && tmp___3^0==tmp___3^post_18 && tmp___4^0==tmp___4^post_18 ], cost: 1
     26: l13 -> l19 : bDomain^0'=bDomain^post_27, bExists^0'=bExists^post_27, bSorted^0'=bSorted^post_27, nDim^0'=nDim^post_27, ni^0'=ni^post_27, nj^0'=nj^post_27, tmp^0'=tmp^post_27, tmp___0^0'=tmp___0^post_27, tmp___1^0'=tmp___1^post_27, tmp___2^0'=tmp___2^post_27, tmp___3^0'=tmp___3^post_27, tmp___4^0'=tmp___4^post_27, [ bDomain^0==bDomain^post_27 && bExists^0==bExists^post_27 && bSorted^0==bSorted^post_27 && nDim^0==nDim^post_27 && ni^0==ni^post_27 && nj^0==nj^post_27 && tmp^0==tmp^post_27 && tmp___0^0==tmp___0^post_27 && tmp___1^0==tmp___1^post_27 && tmp___2^0==tmp___2^post_27 && tmp___3^0==tmp___3^post_27 && tmp___4^0==tmp___4^post_27 ], cost: 1
     18: l14 -> l12 : bDomain^0'=bDomain^post_19, bExists^0'=bExists^post_19, bSorted^0'=bSorted^post_19, nDim^0'=nDim^post_19, ni^0'=ni^post_19, nj^0'=nj^post_19, tmp^0'=tmp^post_19, tmp___0^0'=tmp___0^post_19, tmp___1^0'=tmp___1^post_19, tmp___2^0'=tmp___2^post_19, tmp___3^0'=tmp___3^post_19, tmp___4^0'=tmp___4^post_19, [ tmp___2^post_19==1 && bDomain^0==bDomain^post_19 && bExists^0==bExists^post_19 && bSorted^0==bSorted^post_19 && nDim^0==nDim^post_19 && ni^0==ni^post_19 && nj^0==nj^post_19 && tmp^0==tmp^post_19 && tmp___0^0==tmp___0^post_19 && tmp___1^0==tmp___1^post_19 && tmp___3^0==tmp___3^post_19 && tmp___4^0==tmp___4^post_19 ], cost: 1
     19: l15 -> l12 : bDomain^0'=bDomain^post_20, bExists^0'=bExists^post_20, bSorted^0'=bSorted^post_20, nDim^0'=nDim^post_20, ni^0'=ni^post_20, nj^0'=nj^post_20, tmp^0'=tmp^post_20, tmp___0^0'=tmp___0^post_20, tmp___1^0'=tmp___1^post_20, tmp___2^0'=tmp___2^post_20, tmp___3^0'=tmp___3^post_20, tmp___4^0'=tmp___4^post_20, [ bExists^0<=0 && 0<=bExists^0 && tmp___2^post_20==0 && bDomain^0==bDomain^post_20 && bExists^0==bExists^post_20 && bSorted^0==bSorted^post_20 && nDim^0==nDim^post_20 && ni^0==ni^post_20 && nj^0==nj^post_20 && tmp^0==tmp^post_20 && tmp___0^0==tmp___0^post_20 && tmp___1^0==tmp___1^post_20 && tmp___3^0==tmp___3^post_20 && tmp___4^0==tmp___4^post_20 ], cost: 1
     20: l15 -> l14 : bDomain^0'=bDomain^post_21, bExists^0'=bExists^post_21, bSorted^0'=bSorted^post_21, nDim^0'=nDim^post_21, ni^0'=ni^post_21, nj^0'=nj^post_21, tmp^0'=tmp^post_21, tmp___0^0'=tmp___0^post_21, tmp___1^0'=tmp___1^post_21, tmp___2^0'=tmp___2^post_21, tmp___3^0'=tmp___3^post_21, tmp___4^0'=tmp___4^post_21, [ 1<=bExists^0 && bDomain^0==bDomain^post_21 && bExists^0==bExists^post_21 && bSorted^0==bSorted^post_21 && nDim^0==nDim^post_21 && ni^0==ni^post_21 && nj^0==nj^post_21 && tmp^0==tmp^post_21 && tmp___0^0==tmp___0^post_21 && tmp___1^0==tmp___1^post_21 && tmp___2^0==tmp___2^post_21 && tmp___3^0==tmp___3^post_21 && tmp___4^0==tmp___4^post_21 ], cost: 1
     21: l15 -> l14 : bDomain^0'=bDomain^post_22, bExists^0'=bExists^post_22, bSorted^0'=bSorted^post_22, nDim^0'=nDim^post_22, ni^0'=ni^post_22, nj^0'=nj^post_22, tmp^0'=tmp^post_22, tmp___0^0'=tmp___0^post_22, tmp___1^0'=tmp___1^post_22, tmp___2^0'=tmp___2^post_22, tmp___3^0'=tmp___3^post_22, tmp___4^0'=tmp___4^post_22, [ 1+bExists^0<=0 && bDomain^0==bDomain^post_22 && bExists^0==bExists^post_22 && bSorted^0==bSorted^post_22 && nDim^0==nDim^post_22 && ni^0==ni^post_22 && nj^0==nj^post_22 && tmp^0==tmp^post_22 && tmp___0^0==tmp___0^post_22 && tmp___1^0==tmp___1^post_22 && tmp___2^0==tmp___2^post_22 && tmp___3^0==tmp___3^post_22 && tmp___4^0==tmp___4^post_22 ], cost: 1
     22: l16 -> l12 : bDomain^0'=bDomain^post_23, bExists^0'=bExists^post_23, bSorted^0'=bSorted^post_23, nDim^0'=nDim^post_23, ni^0'=ni^post_23, nj^0'=nj^post_23, tmp^0'=tmp^post_23, tmp___0^0'=tmp___0^post_23, tmp___1^0'=tmp___1^post_23, tmp___2^0'=tmp___2^post_23, tmp___3^0'=tmp___3^post_23, tmp___4^0'=tmp___4^post_23, [ bDomain^0<=0 && 0<=bDomain^0 && tmp___2^post_23==0 && bDomain^0==bDomain^post_23 && bExists^0==bExists^post_23 && bSorted^0==bSorted^post_23 && nDim^0==nDim^post_23 && ni^0==ni^post_23 && nj^0==nj^post_23 && tmp^0==tmp^post_23 && tmp___0^0==tmp___0^post_23 && tmp___1^0==tmp___1^post_23 && tmp___3^0==tmp___3^post_23 && tmp___4^0==tmp___4^post_23 ], cost: 1
     23: l16 -> l15 : bDomain^0'=bDomain^post_24, bExists^0'=bExists^post_24, bSorted^0'=bSorted^post_24, nDim^0'=nDim^post_24, ni^0'=ni^post_24, nj^0'=nj^post_24, tmp^0'=tmp^post_24, tmp___0^0'=tmp___0^post_24, tmp___1^0'=tmp___1^post_24, tmp___2^0'=tmp___2^post_24, tmp___3^0'=tmp___3^post_24, tmp___4^0'=tmp___4^post_24, [ 1<=bDomain^0 && bDomain^0==bDomain^post_24 && bExists^0==bExists^post_24 && bSorted^0==bSorted^post_24 && nDim^0==nDim^post_24 && ni^0==ni^post_24 && nj^0==nj^post_24 && tmp^0==tmp^post_24 && tmp___0^0==tmp___0^post_24 && tmp___1^0==tmp___1^post_24 && tmp___2^0==tmp___2^post_24 && tmp___3^0==tmp___3^post_24 && tmp___4^0==tmp___4^post_24 ], cost: 1
     24: l16 -> l15 : bDomain^0'=bDomain^post_25, bExists^0'=bExists^post_25, bSorted^0'=bSorted^post_25, nDim^0'=nDim^post_25, ni^0'=ni^post_25, nj^0'=nj^post_25, tmp^0'=tmp^post_25, tmp___0^0'=tmp___0^post_25, tmp___1^0'=tmp___1^post_25, tmp___2^0'=tmp___2^post_25, tmp___3^0'=tmp___3^post_25, tmp___4^0'=tmp___4^post_25, [ 1+bDomain^0<=0 && bDomain^0==bDomain^post_25 && bExists^0==bExists^post_25 && bSorted^0==bSorted^post_25 && nDim^0==nDim^post_25 && ni^0==ni^post_25 && nj^0==nj^post_25 && tmp^0==tmp^post_25 && tmp___0^0==tmp___0^post_25 && tmp___1^0==tmp___1^post_25 && tmp___2^0==tmp___2^post_25 && tmp___3^0==tmp___3^post_25 && tmp___4^0==tmp___4^post_25 ], cost: 1
     25: l17 -> l18 : bDomain^0'=bDomain^post_26, bExists^0'=bExists^post_26, bSorted^0'=bSorted^post_26, nDim^0'=nDim^post_26, ni^0'=ni^post_26, nj^0'=nj^post_26, tmp^0'=tmp^post_26, tmp___0^0'=tmp___0^post_26, tmp___1^0'=tmp___1^post_26, tmp___2^0'=tmp___2^post_26, tmp___3^0'=tmp___3^post_26, tmp___4^0'=tmp___4^post_26, [ tmp___1^post_26==0 && bDomain^0==bDomain^post_26 && bExists^0==bExists^post_26 && bSorted^0==bSorted^post_26 && nDim^0==nDim^post_26 && ni^0==ni^post_26 && nj^0==nj^post_26 && tmp^0==tmp^post_26 && tmp___0^0==tmp___0^post_26 && tmp___2^0==tmp___2^post_26 && tmp___3^0==tmp___3^post_26 && tmp___4^0==tmp___4^post_26 ], cost: 1
     30: l18 -> l21 : bDomain^0'=bDomain^post_31, bExists^0'=bExists^post_31, bSorted^0'=bSorted^post_31, nDim^0'=nDim^post_31, ni^0'=ni^post_31, nj^0'=nj^post_31, tmp^0'=tmp^post_31, tmp___0^0'=tmp___0^post_31, tmp___1^0'=tmp___1^post_31, tmp___2^0'=tmp___2^post_31, tmp___3^0'=tmp___3^post_31, tmp___4^0'=tmp___4^post_31, [ bExists^post_31==tmp___1^0 && nj^post_31==1+nj^0 && bDomain^0==bDomain^post_31 && bSorted^0==bSorted^post_31 && nDim^0==nDim^post_31 && ni^0==ni^post_31 && tmp^0==tmp^post_31 && tmp___0^0==tmp___0^post_31 && tmp___1^0==tmp___1^post_31 && tmp___2^0==tmp___2^post_31 && tmp___3^0==tmp___3^post_31 && tmp___4^0==tmp___4^post_31 ], cost: 1
     38: l19 -> l6 : bDomain^0'=bDomain^post_39, bExists^0'=bExists^post_39, bSorted^0'=bSorted^post_39, nDim^0'=nDim^post_39, ni^0'=ni^post_39, nj^0'=nj^post_39, tmp^0'=tmp^post_39, tmp___0^0'=tmp___0^post_39, tmp___1^0'=tmp___1^post_39, tmp___2^0'=tmp___2^post_39, tmp___3^0'=tmp___3^post_39, tmp___4^0'=tmp___4^post_39, [ nDim^0<=ni^0 && ni^post_39==0 && bDomain^0==bDomain^post_39 && bExists^0==bExists^post_39 && bSorted^0==bSorted^post_39 && nDim^0==nDim^post_39 && nj^0==nj^post_39 && tmp^0==tmp^post_39 && tmp___0^0==tmp___0^post_39 && tmp___1^0==tmp___1^post_39 && tmp___2^0==tmp___2^post_39 && tmp___3^0==tmp___3^post_39 && tmp___4^0==tmp___4^post_39 ], cost: 1
     39: l19 -> l21 : bDomain^0'=bDomain^post_40, bExists^0'=bExists^post_40, bSorted^0'=bSorted^post_40, nDim^0'=nDim^post_40, ni^0'=ni^post_40, nj^0'=nj^post_40, tmp^0'=tmp^post_40, tmp___0^0'=tmp___0^post_40, tmp___1^0'=tmp___1^post_40, tmp___2^0'=tmp___2^post_40, tmp___3^0'=tmp___3^post_40, tmp___4^0'=tmp___4^post_40, [ 1+ni^0<=nDim^0 && bExists^post_40==0 && nj^post_40==0 && bDomain^0==bDomain^post_40 && bSorted^0==bSorted^post_40 && nDim^0==nDim^post_40 && ni^0==ni^post_40 && tmp^0==tmp^post_40 && tmp___0^0==tmp___0^post_40 && tmp___1^0==tmp___1^post_40 && tmp___2^0==tmp___2^post_40 && tmp___3^0==tmp___3^post_40 && tmp___4^0==tmp___4^post_40 ], cost: 1
     27: l20 -> l17 : bDomain^0'=bDomain^post_28, bExists^0'=bExists^post_28, bSorted^0'=bSorted^post_28, nDim^0'=nDim^post_28, ni^0'=ni^post_28, nj^0'=nj^post_28, tmp^0'=tmp^post_28, tmp___0^0'=tmp___0^post_28, tmp___1^0'=tmp___1^post_28, tmp___2^0'=tmp___2^post_28, tmp___3^0'=tmp___3^post_28, tmp___4^0'=tmp___4^post_28, [ bDomain^0==bDomain^post_28 && bExists^0==bExists^post_28 && bSorted^0==bSorted^post_28 && nDim^0==nDim^post_28 && ni^0==ni^post_28 && nj^0==nj^post_28 && tmp^0==tmp^post_28 && tmp___0^0==tmp___0^post_28 && tmp___1^0==tmp___1^post_28 && tmp___2^0==tmp___2^post_28 && tmp___3^0==tmp___3^post_28 && tmp___4^0==tmp___4^post_28 ], cost: 1
     28: l20 -> l18 : bDomain^0'=bDomain^post_29, bExists^0'=bExists^post_29, bSorted^0'=bSorted^post_29, nDim^0'=nDim^post_29, ni^0'=ni^post_29, nj^0'=nj^post_29, tmp^0'=tmp^post_29, tmp___0^0'=tmp___0^post_29, tmp___1^0'=tmp___1^post_29, tmp___2^0'=tmp___2^post_29, tmp___3^0'=tmp___3^post_29, tmp___4^0'=tmp___4^post_29, [ tmp___1^post_29==1 && bDomain^0==bDomain^post_29 && bExists^0==bExists^post_29 && bSorted^0==bSorted^post_29 && nDim^0==nDim^post_29 && ni^0==ni^post_29 && nj^0==nj^post_29 && tmp^0==tmp^post_29 && tmp___0^0==tmp___0^post_29 && tmp___2^0==tmp___2^post_29 && tmp___3^0==tmp___3^post_29 && tmp___4^0==tmp___4^post_29 ], cost: 1
     29: l20 -> l17 : bDomain^0'=bDomain^post_30, bExists^0'=bExists^post_30, bSorted^0'=bSorted^post_30, nDim^0'=nDim^post_30, ni^0'=ni^post_30, nj^0'=nj^post_30, tmp^0'=tmp^post_30, tmp___0^0'=tmp___0^post_30, tmp___1^0'=tmp___1^post_30, tmp___2^0'=tmp___2^post_30, tmp___3^0'=tmp___3^post_30, tmp___4^0'=tmp___4^post_30, [ bDomain^0==bDomain^post_30 && bExists^0==bExists^post_30 && bSorted^0==bSorted^post_30 && nDim^0==nDim^post_30 && ni^0==ni^post_30 && nj^0==nj^post_30 && tmp^0==tmp^post_30 && tmp___0^0==tmp___0^post_30 && tmp___1^0==tmp___1^post_30 && tmp___2^0==tmp___2^post_30 && tmp___3^0==tmp___3^post_30 && tmp___4^0==tmp___4^post_30 ], cost: 1
     37: l21 -> l24 : bDomain^0'=bDomain^post_38, bExists^0'=bExists^post_38, bSorted^0'=bSorted^post_38, nDim^0'=nDim^post_38, ni^0'=ni^post_38, nj^0'=nj^post_38, tmp^0'=tmp^post_38, tmp___0^0'=tmp___0^post_38, tmp___1^0'=tmp___1^post_38, tmp___2^0'=tmp___2^post_38, tmp___3^0'=tmp___3^post_38, tmp___4^0'=tmp___4^post_38, [ bDomain^0==bDomain^post_38 && bExists^0==bExists^post_38 && bSorted^0==bSorted^post_38 && nDim^0==nDim^post_38 && ni^0==ni^post_38 && nj^0==nj^post_38 && tmp^0==tmp^post_38 && tmp___0^0==tmp___0^post_38 && tmp___1^0==tmp___1^post_38 && tmp___2^0==tmp___2^post_38 && tmp___3^0==tmp___3^post_38 && tmp___4^0==tmp___4^post_38 ], cost: 1
     31: l22 -> l18 : bDomain^0'=bDomain^post_32, bExists^0'=bExists^post_32, bSorted^0'=bSorted^post_32, nDim^0'=nDim^post_32, ni^0'=ni^post_32, nj^0'=nj^post_32, tmp^0'=tmp^post_32, tmp___0^0'=tmp___0^post_32, tmp___1^0'=tmp___1^post_32, tmp___2^0'=tmp___2^post_32, tmp___3^0'=tmp___3^post_32, tmp___4^0'=tmp___4^post_32, [ tmp___1^post_32==1 && bDomain^0==bDomain^post_32 && bExists^0==bExists^post_32 && bSorted^0==bSorted^post_32 && nDim^0==nDim^post_32 && ni^0==ni^post_32 && nj^0==nj^post_32 && tmp^0==tmp^post_32 && tmp___0^0==tmp___0^post_32 && tmp___2^0==tmp___2^post_32 && tmp___3^0==tmp___3^post_32 && tmp___4^0==tmp___4^post_32 ], cost: 1
     32: l23 -> l20 : bDomain^0'=bDomain^post_33, bExists^0'=bExists^post_33, bSorted^0'=bSorted^post_33, nDim^0'=nDim^post_33, ni^0'=ni^post_33, nj^0'=nj^post_33, tmp^0'=tmp^post_33, tmp___0^0'=tmp___0^post_33, tmp___1^0'=tmp___1^post_33, tmp___2^0'=tmp___2^post_33, tmp___3^0'=tmp___3^post_33, tmp___4^0'=tmp___4^post_33, [ bExists^0<=0 && 0<=bExists^0 && bDomain^0==bDomain^post_33 && bExists^0==bExists^post_33 && bSorted^0==bSorted^post_33 && nDim^0==nDim^post_33 && ni^0==ni^post_33 && nj^0==nj^post_33 && tmp^0==tmp^post_33 && tmp___0^0==tmp___0^post_33 && tmp___1^0==tmp___1^post_33 && tmp___2^0==tmp___2^post_33 && tmp___3^0==tmp___3^post_33 && tmp___4^0==tmp___4^post_33 ], cost: 1
     33: l23 -> l22 : bDomain^0'=bDomain^post_34, bExists^0'=bExists^post_34, bSorted^0'=bSorted^post_34, nDim^0'=nDim^post_34, ni^0'=ni^post_34, nj^0'=nj^post_34, tmp^0'=tmp^post_34, tmp___0^0'=tmp___0^post_34, tmp___1^0'=tmp___1^post_34, tmp___2^0'=tmp___2^post_34, tmp___3^0'=tmp___3^post_34, tmp___4^0'=tmp___4^post_34, [ 1<=bExists^0 && bDomain^0==bDomain^post_34 && bExists^0==bExists^post_34 && bSorted^0==bSorted^post_34 && nDim^0==nDim^post_34 && ni^0==ni^post_34 && nj^0==nj^post_34 && tmp^0==tmp^post_34 && tmp___0^0==tmp___0^post_34 && tmp___1^0==tmp___1^post_34 && tmp___2^0==tmp___2^post_34 && tmp___3^0==tmp___3^post_34 && tmp___4^0==tmp___4^post_34 ], cost: 1
     34: l23 -> l22 : bDomain^0'=bDomain^post_35, bExists^0'=bExists^post_35, bSorted^0'=bSorted^post_35, nDim^0'=nDim^post_35, ni^0'=ni^post_35, nj^0'=nj^post_35, tmp^0'=tmp^post_35, tmp___0^0'=tmp___0^post_35, tmp___1^0'=tmp___1^post_35, tmp___2^0'=tmp___2^post_35, tmp___3^0'=tmp___3^post_35, tmp___4^0'=tmp___4^post_35, [ 1+bExists^0<=0 && bDomain^0==bDomain^post_35 && bExists^0==bExists^post_35 && bSorted^0==bSorted^post_35 && nDim^0==nDim^post_35 && ni^0==ni^post_35 && nj^0==nj^post_35 && tmp^0==tmp^post_35 && tmp___0^0==tmp___0^post_35 && tmp___1^0==tmp___1^post_35 && tmp___2^0==tmp___2^post_35 && tmp___3^0==tmp___3^post_35 && tmp___4^0==tmp___4^post_35 ], cost: 1
     35: l24 -> l16 : bDomain^0'=bDomain^post_36, bExists^0'=bExists^post_36, bSorted^0'=bSorted^post_36, nDim^0'=nDim^post_36, ni^0'=ni^post_36, nj^0'=nj^post_36, tmp^0'=tmp^post_36, tmp___0^0'=tmp___0^post_36, tmp___1^0'=tmp___1^post_36, tmp___2^0'=tmp___2^post_36, tmp___3^0'=tmp___3^post_36, tmp___4^0'=tmp___4^post_36, [ nDim^0<=nj^0 && bDomain^0==bDomain^post_36 && bExists^0==bExists^post_36 && bSorted^0==bSorted^post_36 && nDim^0==nDim^post_36 && ni^0==ni^post_36 && nj^0==nj^post_36 && tmp^0==tmp^post_36 && tmp___0^0==tmp___0^post_36 && tmp___1^0==tmp___1^post_36 && tmp___2^0==tmp___2^post_36 && tmp___3^0==tmp___3^post_36 && tmp___4^0==tmp___4^post_36 ], cost: 1
     36: l24 -> l23 : bDomain^0'=bDomain^post_37, bExists^0'=bExists^post_37, bSorted^0'=bSorted^post_37, nDim^0'=nDim^post_37, ni^0'=ni^post_37, nj^0'=nj^post_37, tmp^0'=tmp^post_37, tmp___0^0'=tmp___0^post_37, tmp___1^0'=tmp___1^post_37, tmp___2^0'=tmp___2^post_37, tmp___3^0'=tmp___3^post_37, tmp___4^0'=tmp___4^post_37, [ 1+nj^0<=nDim^0 && bDomain^0==bDomain^post_37 && bExists^0==bExists^post_37 && bSorted^0==bSorted^post_37 && nDim^0==nDim^post_37 && ni^0==ni^post_37 && nj^0==nj^post_37 && tmp^0==tmp^post_37 && tmp___0^0==tmp___0^post_37 && tmp___1^0==tmp___1^post_37 && tmp___2^0==tmp___2^post_37 && tmp___3^0==tmp___3^post_37 && tmp___4^0==tmp___4^post_37 ], cost: 1
     43: l25 -> l10 : bDomain^0'=bDomain^post_44, bExists^0'=bExists^post_44, bSorted^0'=bSorted^post_44, nDim^0'=nDim^post_44, ni^0'=ni^post_44, nj^0'=nj^post_44, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, tmp___1^0'=tmp___1^post_44, tmp___2^0'=tmp___2^post_44, tmp___3^0'=tmp___3^post_44, tmp___4^0'=tmp___4^post_44, [ bDomain^post_44==1 && bSorted^post_44==1 && nDim^post_44==10 && tmp^post_44==tmp^post_44 && tmp___0^post_44==tmp___0^post_44 && ni^post_44==0 && bExists^0==bExists^post_44 && nj^0==nj^post_44 && tmp___1^0==tmp___1^post_44 && tmp___2^0==tmp___2^post_44 && tmp___3^0==tmp___3^post_44 && tmp___4^0==tmp___4^post_44 ], cost: 1
     44: l26 -> l25 : bDomain^0'=bDomain^post_45, bExists^0'=bExists^post_45, bSorted^0'=bSorted^post_45, nDim^0'=nDim^post_45, ni^0'=ni^post_45, nj^0'=nj^post_45, tmp^0'=tmp^post_45, tmp___0^0'=tmp___0^post_45, tmp___1^0'=tmp___1^post_45, tmp___2^0'=tmp___2^post_45, tmp___3^0'=tmp___3^post_45, tmp___4^0'=tmp___4^post_45, [ bDomain^0==bDomain^post_45 && bExists^0==bExists^post_45 && bSorted^0==bSorted^post_45 && nDim^0==nDim^post_45 && ni^0==ni^post_45 && nj^0==nj^post_45 && tmp^0==tmp^post_45 && tmp___0^0==tmp___0^post_45 && tmp___1^0==tmp___1^post_45 && tmp___2^0==tmp___2^post_45 && tmp___3^0==tmp___3^post_45 && tmp___4^0==tmp___4^post_45 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     44: l26 -> l25 : bDomain^0'=bDomain^post_45, bExists^0'=bExists^post_45, bSorted^0'=bSorted^post_45, nDim^0'=nDim^post_45, ni^0'=ni^post_45, nj^0'=nj^post_45, tmp^0'=tmp^post_45, tmp___0^0'=tmp___0^post_45, tmp___1^0'=tmp___1^post_45, tmp___2^0'=tmp___2^post_45, tmp___3^0'=tmp___3^post_45, tmp___4^0'=tmp___4^post_45, [ bDomain^0==bDomain^post_45 && bExists^0==bExists^post_45 && bSorted^0==bSorted^post_45 && nDim^0==nDim^post_45 && ni^0==ni^post_45 && nj^0==nj^post_45 && tmp^0==tmp^post_45 && tmp___0^0==tmp___0^post_45 && tmp___1^0==tmp___1^post_45 && tmp___2^0==tmp___2^post_45 && tmp___3^0==tmp___3^post_45 && tmp___4^0==tmp___4^post_45 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l26
      8: l5 -> l6 : bDomain^0'=bDomain^post_9, bExists^0'=bExists^post_9, bSorted^0'=bSorted^post_9, nDim^0'=nDim^post_9, ni^0'=ni^post_9, nj^0'=nj^post_9, tmp^0'=tmp^post_9, tmp___0^0'=tmp___0^post_9, tmp___1^0'=tmp___1^post_9, tmp___2^0'=tmp___2^post_9, tmp___3^0'=tmp___3^post_9, tmp___4^0'=tmp___4^post_9, [ bSorted^post_9==tmp___3^0 && ni^post_9==1+ni^0 && bDomain^0==bDomain^post_9 && bExists^0==bExists^post_9 && nDim^0==nDim^post_9 && nj^0==nj^post_9 && tmp^0==tmp^post_9 && tmp___0^0==tmp___0^post_9 && tmp___1^0==tmp___1^post_9 && tmp___2^0==tmp___2^post_9 && tmp___3^0==tmp___3^post_9 && tmp___4^0==tmp___4^post_9 ], cost: 1
     42: l6 -> l9 : bDomain^0'=bDomain^post_43, bExists^0'=bExists^post_43, bSorted^0'=bSorted^post_43, nDim^0'=nDim^post_43, ni^0'=ni^post_43, nj^0'=nj^post_43, tmp^0'=tmp^post_43, tmp___0^0'=tmp___0^post_43, tmp___1^0'=tmp___1^post_43, tmp___2^0'=tmp___2^post_43, tmp___3^0'=tmp___3^post_43, tmp___4^0'=tmp___4^post_43, [ bDomain^0==bDomain^post_43 && bExists^0==bExists^post_43 && bSorted^0==bSorted^post_43 && nDim^0==nDim^post_43 && ni^0==ni^post_43 && nj^0==nj^post_43 && tmp^0==tmp^post_43 && tmp___0^0==tmp___0^post_43 && tmp___1^0==tmp___1^post_43 && tmp___2^0==tmp___2^post_43 && tmp___3^0==tmp___3^post_43 && tmp___4^0==tmp___4^post_43 ], cost: 1
      9: l7 -> l5 : bDomain^0'=bDomain^post_10, bExists^0'=bExists^post_10, bSorted^0'=bSorted^post_10, nDim^0'=nDim^post_10, ni^0'=ni^post_10, nj^0'=nj^post_10, tmp^0'=tmp^post_10, tmp___0^0'=tmp___0^post_10, tmp___1^0'=tmp___1^post_10, tmp___2^0'=tmp___2^post_10, tmp___3^0'=tmp___3^post_10, tmp___4^0'=tmp___4^post_10, [ tmp___3^post_10==1 && bDomain^0==bDomain^post_10 && bExists^0==bExists^post_10 && bSorted^0==bSorted^post_10 && nDim^0==nDim^post_10 && ni^0==ni^post_10 && nj^0==nj^post_10 && tmp^0==tmp^post_10 && tmp___0^0==tmp___0^post_10 && tmp___1^0==tmp___1^post_10 && tmp___2^0==tmp___2^post_10 && tmp___4^0==tmp___4^post_10 ], cost: 1
     10: l7 -> l5 : bDomain^0'=bDomain^post_11, bExists^0'=bExists^post_11, bSorted^0'=bSorted^post_11, nDim^0'=nDim^post_11, ni^0'=ni^post_11, nj^0'=nj^post_11, tmp^0'=tmp^post_11, tmp___0^0'=tmp___0^post_11, tmp___1^0'=tmp___1^post_11, tmp___2^0'=tmp___2^post_11, tmp___3^0'=tmp___3^post_11, tmp___4^0'=tmp___4^post_11, [ tmp___3^post_11==0 && bDomain^0==bDomain^post_11 && bExists^0==bExists^post_11 && bSorted^0==bSorted^post_11 && nDim^0==nDim^post_11 && ni^0==ni^post_11 && nj^0==nj^post_11 && tmp^0==tmp^post_11 && tmp___0^0==tmp___0^post_11 && tmp___1^0==tmp___1^post_11 && tmp___2^0==tmp___2^post_11 && tmp___4^0==tmp___4^post_11 ], cost: 1
     11: l8 -> l5 : bDomain^0'=bDomain^post_12, bExists^0'=bExists^post_12, bSorted^0'=bSorted^post_12, nDim^0'=nDim^post_12, ni^0'=ni^post_12, nj^0'=nj^post_12, tmp^0'=tmp^post_12, tmp___0^0'=tmp___0^post_12, tmp___1^0'=tmp___1^post_12, tmp___2^0'=tmp___2^post_12, tmp___3^0'=tmp___3^post_12, tmp___4^0'=tmp___4^post_12, [ bSorted^0<=0 && 0<=bSorted^0 && tmp___3^post_12==0 && bDomain^0==bDomain^post_12 && bExists^0==bExists^post_12 && bSorted^0==bSorted^post_12 && nDim^0==nDim^post_12 && ni^0==ni^post_12 && nj^0==nj^post_12 && tmp^0==tmp^post_12 && tmp___0^0==tmp___0^post_12 && tmp___1^0==tmp___1^post_12 && tmp___2^0==tmp___2^post_12 && tmp___4^0==tmp___4^post_12 ], cost: 1
     12: l8 -> l7 : bDomain^0'=bDomain^post_13, bExists^0'=bExists^post_13, bSorted^0'=bSorted^post_13, nDim^0'=nDim^post_13, ni^0'=ni^post_13, nj^0'=nj^post_13, tmp^0'=tmp^post_13, tmp___0^0'=tmp___0^post_13, tmp___1^0'=tmp___1^post_13, tmp___2^0'=tmp___2^post_13, tmp___3^0'=tmp___3^post_13, tmp___4^0'=tmp___4^post_13, [ 1<=bSorted^0 && bDomain^0==bDomain^post_13 && bExists^0==bExists^post_13 && bSorted^0==bSorted^post_13 && nDim^0==nDim^post_13 && ni^0==ni^post_13 && nj^0==nj^post_13 && tmp^0==tmp^post_13 && tmp___0^0==tmp___0^post_13 && tmp___1^0==tmp___1^post_13 && tmp___2^0==tmp___2^post_13 && tmp___3^0==tmp___3^post_13 && tmp___4^0==tmp___4^post_13 ], cost: 1
     13: l8 -> l7 : bDomain^0'=bDomain^post_14, bExists^0'=bExists^post_14, bSorted^0'=bSorted^post_14, nDim^0'=nDim^post_14, ni^0'=ni^post_14, nj^0'=nj^post_14, tmp^0'=tmp^post_14, tmp___0^0'=tmp___0^post_14, tmp___1^0'=tmp___1^post_14, tmp___2^0'=tmp___2^post_14, tmp___3^0'=tmp___3^post_14, tmp___4^0'=tmp___4^post_14, [ 1+bSorted^0<=0 && bDomain^0==bDomain^post_14 && bExists^0==bExists^post_14 && bSorted^0==bSorted^post_14 && nDim^0==nDim^post_14 && ni^0==ni^post_14 && nj^0==nj^post_14 && tmp^0==tmp^post_14 && tmp___0^0==tmp___0^post_14 && tmp___1^0==tmp___1^post_14 && tmp___2^0==tmp___2^post_14 && tmp___3^0==tmp___3^post_14 && tmp___4^0==tmp___4^post_14 ], cost: 1
     15: l9 -> l8 : bDomain^0'=bDomain^post_16, bExists^0'=bExists^post_16, bSorted^0'=bSorted^post_16, nDim^0'=nDim^post_16, ni^0'=ni^post_16, nj^0'=nj^post_16, tmp^0'=tmp^post_16, tmp___0^0'=tmp___0^post_16, tmp___1^0'=tmp___1^post_16, tmp___2^0'=tmp___2^post_16, tmp___3^0'=tmp___3^post_16, tmp___4^0'=tmp___4^post_16, [ 1+ni^0<=-1+nDim^0 && bDomain^0==bDomain^post_16 && bExists^0==bExists^post_16 && bSorted^0==bSorted^post_16 && nDim^0==nDim^post_16 && ni^0==ni^post_16 && nj^0==nj^post_16 && tmp^0==tmp^post_16 && tmp___0^0==tmp___0^post_16 && tmp___1^0==tmp___1^post_16 && tmp___2^0==tmp___2^post_16 && tmp___3^0==tmp___3^post_16 && tmp___4^0==tmp___4^post_16 ], cost: 1
     16: l10 -> l11 : bDomain^0'=bDomain^post_17, bExists^0'=bExists^post_17, bSorted^0'=bSorted^post_17, nDim^0'=nDim^post_17, ni^0'=ni^post_17, nj^0'=nj^post_17, tmp^0'=tmp^post_17, tmp___0^0'=tmp___0^post_17, tmp___1^0'=tmp___1^post_17, tmp___2^0'=tmp___2^post_17, tmp___3^0'=tmp___3^post_17, tmp___4^0'=tmp___4^post_17, [ bDomain^0==bDomain^post_17 && bExists^0==bExists^post_17 && bSorted^0==bSorted^post_17 && nDim^0==nDim^post_17 && ni^0==ni^post_17 && nj^0==nj^post_17 && tmp^0==tmp^post_17 && tmp___0^0==tmp___0^post_17 && tmp___1^0==tmp___1^post_17 && tmp___2^0==tmp___2^post_17 && tmp___3^0==tmp___3^post_17 && tmp___4^0==tmp___4^post_17 ], cost: 1
     40: l11 -> l13 : bDomain^0'=bDomain^post_41, bExists^0'=bExists^post_41, bSorted^0'=bSorted^post_41, nDim^0'=nDim^post_41, ni^0'=ni^post_41, nj^0'=nj^post_41, tmp^0'=tmp^post_41, tmp___0^0'=tmp___0^post_41, tmp___1^0'=tmp___1^post_41, tmp___2^0'=tmp___2^post_41, tmp___3^0'=tmp___3^post_41, tmp___4^0'=tmp___4^post_41, [ nDim^0<=ni^0 && ni^post_41==0 && bDomain^0==bDomain^post_41 && bExists^0==bExists^post_41 && bSorted^0==bSorted^post_41 && nDim^0==nDim^post_41 && nj^0==nj^post_41 && tmp^0==tmp^post_41 && tmp___0^0==tmp___0^post_41 && tmp___1^0==tmp___1^post_41 && tmp___2^0==tmp___2^post_41 && tmp___3^0==tmp___3^post_41 && tmp___4^0==tmp___4^post_41 ], cost: 1
     41: l11 -> l10 : bDomain^0'=bDomain^post_42, bExists^0'=bExists^post_42, bSorted^0'=bSorted^post_42, nDim^0'=nDim^post_42, ni^0'=ni^post_42, nj^0'=nj^post_42, tmp^0'=tmp^post_42, tmp___0^0'=tmp___0^post_42, tmp___1^0'=tmp___1^post_42, tmp___2^0'=tmp___2^post_42, tmp___3^0'=tmp___3^post_42, tmp___4^0'=tmp___4^post_42, [ 1+ni^0<=nDim^0 && ni^post_42==1+ni^0 && bDomain^0==bDomain^post_42 && bExists^0==bExists^post_42 && bSorted^0==bSorted^post_42 && nDim^0==nDim^post_42 && nj^0==nj^post_42 && tmp^0==tmp^post_42 && tmp___0^0==tmp___0^post_42 && tmp___1^0==tmp___1^post_42 && tmp___2^0==tmp___2^post_42 && tmp___3^0==tmp___3^post_42 && tmp___4^0==tmp___4^post_42 ], cost: 1
     17: l12 -> l13 : bDomain^0'=bDomain^post_18, bExists^0'=bExists^post_18, bSorted^0'=bSorted^post_18, nDim^0'=nDim^post_18, ni^0'=ni^post_18, nj^0'=nj^post_18, tmp^0'=tmp^post_18, tmp___0^0'=tmp___0^post_18, tmp___1^0'=tmp___1^post_18, tmp___2^0'=tmp___2^post_18, tmp___3^0'=tmp___3^post_18, tmp___4^0'=tmp___4^post_18, [ bDomain^post_18==tmp___2^0 && ni^post_18==1+ni^0 && bExists^0==bExists^post_18 && bSorted^0==bSorted^post_18 && nDim^0==nDim^post_18 && nj^0==nj^post_18 && tmp^0==tmp^post_18 && tmp___0^0==tmp___0^post_18 && tmp___1^0==tmp___1^post_18 && tmp___2^0==tmp___2^post_18 && tmp___3^0==tmp___3^post_18 && tmp___4^0==tmp___4^post_18 ], cost: 1
     26: l13 -> l19 : bDomain^0'=bDomain^post_27, bExists^0'=bExists^post_27, bSorted^0'=bSorted^post_27, nDim^0'=nDim^post_27, ni^0'=ni^post_27, nj^0'=nj^post_27, tmp^0'=tmp^post_27, tmp___0^0'=tmp___0^post_27, tmp___1^0'=tmp___1^post_27, tmp___2^0'=tmp___2^post_27, tmp___3^0'=tmp___3^post_27, tmp___4^0'=tmp___4^post_27, [ bDomain^0==bDomain^post_27 && bExists^0==bExists^post_27 && bSorted^0==bSorted^post_27 && nDim^0==nDim^post_27 && ni^0==ni^post_27 && nj^0==nj^post_27 && tmp^0==tmp^post_27 && tmp___0^0==tmp___0^post_27 && tmp___1^0==tmp___1^post_27 && tmp___2^0==tmp___2^post_27 && tmp___3^0==tmp___3^post_27 && tmp___4^0==tmp___4^post_27 ], cost: 1
     18: l14 -> l12 : bDomain^0'=bDomain^post_19, bExists^0'=bExists^post_19, bSorted^0'=bSorted^post_19, nDim^0'=nDim^post_19, ni^0'=ni^post_19, nj^0'=nj^post_19, tmp^0'=tmp^post_19, tmp___0^0'=tmp___0^post_19, tmp___1^0'=tmp___1^post_19, tmp___2^0'=tmp___2^post_19, tmp___3^0'=tmp___3^post_19, tmp___4^0'=tmp___4^post_19, [ tmp___2^post_19==1 && bDomain^0==bDomain^post_19 && bExists^0==bExists^post_19 && bSorted^0==bSorted^post_19 && nDim^0==nDim^post_19 && ni^0==ni^post_19 && nj^0==nj^post_19 && tmp^0==tmp^post_19 && tmp___0^0==tmp___0^post_19 && tmp___1^0==tmp___1^post_19 && tmp___3^0==tmp___3^post_19 && tmp___4^0==tmp___4^post_19 ], cost: 1
     19: l15 -> l12 : bDomain^0'=bDomain^post_20, bExists^0'=bExists^post_20, bSorted^0'=bSorted^post_20, nDim^0'=nDim^post_20, ni^0'=ni^post_20, nj^0'=nj^post_20, tmp^0'=tmp^post_20, tmp___0^0'=tmp___0^post_20, tmp___1^0'=tmp___1^post_20, tmp___2^0'=tmp___2^post_20, tmp___3^0'=tmp___3^post_20, tmp___4^0'=tmp___4^post_20, [ bExists^0<=0 && 0<=bExists^0 && tmp___2^post_20==0 && bDomain^0==bDomain^post_20 && bExists^0==bExists^post_20 && bSorted^0==bSorted^post_20 && nDim^0==nDim^post_20 && ni^0==ni^post_20 && nj^0==nj^post_20 && tmp^0==tmp^post_20 && tmp___0^0==tmp___0^post_20 && tmp___1^0==tmp___1^post_20 && tmp___3^0==tmp___3^post_20 && tmp___4^0==tmp___4^post_20 ], cost: 1
     20: l15 -> l14 : bDomain^0'=bDomain^post_21, bExists^0'=bExists^post_21, bSorted^0'=bSorted^post_21, nDim^0'=nDim^post_21, ni^0'=ni^post_21, nj^0'=nj^post_21, tmp^0'=tmp^post_21, tmp___0^0'=tmp___0^post_21, tmp___1^0'=tmp___1^post_21, tmp___2^0'=tmp___2^post_21, tmp___3^0'=tmp___3^post_21, tmp___4^0'=tmp___4^post_21, [ 1<=bExists^0 && bDomain^0==bDomain^post_21 && bExists^0==bExists^post_21 && bSorted^0==bSorted^post_21 && nDim^0==nDim^post_21 && ni^0==ni^post_21 && nj^0==nj^post_21 && tmp^0==tmp^post_21 && tmp___0^0==tmp___0^post_21 && tmp___1^0==tmp___1^post_21 && tmp___2^0==tmp___2^post_21 && tmp___3^0==tmp___3^post_21 && tmp___4^0==tmp___4^post_21 ], cost: 1
     21: l15 -> l14 : bDomain^0'=bDomain^post_22, bExists^0'=bExists^post_22, bSorted^0'=bSorted^post_22, nDim^0'=nDim^post_22, ni^0'=ni^post_22, nj^0'=nj^post_22, tmp^0'=tmp^post_22, tmp___0^0'=tmp___0^post_22, tmp___1^0'=tmp___1^post_22, tmp___2^0'=tmp___2^post_22, tmp___3^0'=tmp___3^post_22, tmp___4^0'=tmp___4^post_22, [ 1+bExists^0<=0 && bDomain^0==bDomain^post_22 && bExists^0==bExists^post_22 && bSorted^0==bSorted^post_22 && nDim^0==nDim^post_22 && ni^0==ni^post_22 && nj^0==nj^post_22 && tmp^0==tmp^post_22 && tmp___0^0==tmp___0^post_22 && tmp___1^0==tmp___1^post_22 && tmp___2^0==tmp___2^post_22 && tmp___3^0==tmp___3^post_22 && tmp___4^0==tmp___4^post_22 ], cost: 1
     22: l16 -> l12 : bDomain^0'=bDomain^post_23, bExists^0'=bExists^post_23, bSorted^0'=bSorted^post_23, nDim^0'=nDim^post_23, ni^0'=ni^post_23, nj^0'=nj^post_23, tmp^0'=tmp^post_23, tmp___0^0'=tmp___0^post_23, tmp___1^0'=tmp___1^post_23, tmp___2^0'=tmp___2^post_23, tmp___3^0'=tmp___3^post_23, tmp___4^0'=tmp___4^post_23, [ bDomain^0<=0 && 0<=bDomain^0 && tmp___2^post_23==0 && bDomain^0==bDomain^post_23 && bExists^0==bExists^post_23 && bSorted^0==bSorted^post_23 && nDim^0==nDim^post_23 && ni^0==ni^post_23 && nj^0==nj^post_23 && tmp^0==tmp^post_23 && tmp___0^0==tmp___0^post_23 && tmp___1^0==tmp___1^post_23 && tmp___3^0==tmp___3^post_23 && tmp___4^0==tmp___4^post_23 ], cost: 1
     23: l16 -> l15 : bDomain^0'=bDomain^post_24, bExists^0'=bExists^post_24, bSorted^0'=bSorted^post_24, nDim^0'=nDim^post_24, ni^0'=ni^post_24, nj^0'=nj^post_24, tmp^0'=tmp^post_24, tmp___0^0'=tmp___0^post_24, tmp___1^0'=tmp___1^post_24, tmp___2^0'=tmp___2^post_24, tmp___3^0'=tmp___3^post_24, tmp___4^0'=tmp___4^post_24, [ 1<=bDomain^0 && bDomain^0==bDomain^post_24 && bExists^0==bExists^post_24 && bSorted^0==bSorted^post_24 && nDim^0==nDim^post_24 && ni^0==ni^post_24 && nj^0==nj^post_24 && tmp^0==tmp^post_24 && tmp___0^0==tmp___0^post_24 && tmp___1^0==tmp___1^post_24 && tmp___2^0==tmp___2^post_24 && tmp___3^0==tmp___3^post_24 && tmp___4^0==tmp___4^post_24 ], cost: 1
     24: l16 -> l15 : bDomain^0'=bDomain^post_25, bExists^0'=bExists^post_25, bSorted^0'=bSorted^post_25, nDim^0'=nDim^post_25, ni^0'=ni^post_25, nj^0'=nj^post_25, tmp^0'=tmp^post_25, tmp___0^0'=tmp___0^post_25, tmp___1^0'=tmp___1^post_25, tmp___2^0'=tmp___2^post_25, tmp___3^0'=tmp___3^post_25, tmp___4^0'=tmp___4^post_25, [ 1+bDomain^0<=0 && bDomain^0==bDomain^post_25 && bExists^0==bExists^post_25 && bSorted^0==bSorted^post_25 && nDim^0==nDim^post_25 && ni^0==ni^post_25 && nj^0==nj^post_25 && tmp^0==tmp^post_25 && tmp___0^0==tmp___0^post_25 && tmp___1^0==tmp___1^post_25 && tmp___2^0==tmp___2^post_25 && tmp___3^0==tmp___3^post_25 && tmp___4^0==tmp___4^post_25 ], cost: 1
     25: l17 -> l18 : bDomain^0'=bDomain^post_26, bExists^0'=bExists^post_26, bSorted^0'=bSorted^post_26, nDim^0'=nDim^post_26, ni^0'=ni^post_26, nj^0'=nj^post_26, tmp^0'=tmp^post_26, tmp___0^0'=tmp___0^post_26, tmp___1^0'=tmp___1^post_26, tmp___2^0'=tmp___2^post_26, tmp___3^0'=tmp___3^post_26, tmp___4^0'=tmp___4^post_26, [ tmp___1^post_26==0 && bDomain^0==bDomain^post_26 && bExists^0==bExists^post_26 && bSorted^0==bSorted^post_26 && nDim^0==nDim^post_26 && ni^0==ni^post_26 && nj^0==nj^post_26 && tmp^0==tmp^post_26 && tmp___0^0==tmp___0^post_26 && tmp___2^0==tmp___2^post_26 && tmp___3^0==tmp___3^post_26 && tmp___4^0==tmp___4^post_26 ], cost: 1
     30: l18 -> l21 : bDomain^0'=bDomain^post_31, bExists^0'=bExists^post_31, bSorted^0'=bSorted^post_31, nDim^0'=nDim^post_31, ni^0'=ni^post_31, nj^0'=nj^post_31, tmp^0'=tmp^post_31, tmp___0^0'=tmp___0^post_31, tmp___1^0'=tmp___1^post_31, tmp___2^0'=tmp___2^post_31, tmp___3^0'=tmp___3^post_31, tmp___4^0'=tmp___4^post_31, [ bExists^post_31==tmp___1^0 && nj^post_31==1+nj^0 && bDomain^0==bDomain^post_31 && bSorted^0==bSorted^post_31 && nDim^0==nDim^post_31 && ni^0==ni^post_31 && tmp^0==tmp^post_31 && tmp___0^0==tmp___0^post_31 && tmp___1^0==tmp___1^post_31 && tmp___2^0==tmp___2^post_31 && tmp___3^0==tmp___3^post_31 && tmp___4^0==tmp___4^post_31 ], cost: 1
     38: l19 -> l6 : bDomain^0'=bDomain^post_39, bExists^0'=bExists^post_39, bSorted^0'=bSorted^post_39, nDim^0'=nDim^post_39, ni^0'=ni^post_39, nj^0'=nj^post_39, tmp^0'=tmp^post_39, tmp___0^0'=tmp___0^post_39, tmp___1^0'=tmp___1^post_39, tmp___2^0'=tmp___2^post_39, tmp___3^0'=tmp___3^post_39, tmp___4^0'=tmp___4^post_39, [ nDim^0<=ni^0 && ni^post_39==0 && bDomain^0==bDomain^post_39 && bExists^0==bExists^post_39 && bSorted^0==bSorted^post_39 && nDim^0==nDim^post_39 && nj^0==nj^post_39 && tmp^0==tmp^post_39 && tmp___0^0==tmp___0^post_39 && tmp___1^0==tmp___1^post_39 && tmp___2^0==tmp___2^post_39 && tmp___3^0==tmp___3^post_39 && tmp___4^0==tmp___4^post_39 ], cost: 1
     39: l19 -> l21 : bDomain^0'=bDomain^post_40, bExists^0'=bExists^post_40, bSorted^0'=bSorted^post_40, nDim^0'=nDim^post_40, ni^0'=ni^post_40, nj^0'=nj^post_40, tmp^0'=tmp^post_40, tmp___0^0'=tmp___0^post_40, tmp___1^0'=tmp___1^post_40, tmp___2^0'=tmp___2^post_40, tmp___3^0'=tmp___3^post_40, tmp___4^0'=tmp___4^post_40, [ 1+ni^0<=nDim^0 && bExists^post_40==0 && nj^post_40==0 && bDomain^0==bDomain^post_40 && bSorted^0==bSorted^post_40 && nDim^0==nDim^post_40 && ni^0==ni^post_40 && tmp^0==tmp^post_40 && tmp___0^0==tmp___0^post_40 && tmp___1^0==tmp___1^post_40 && tmp___2^0==tmp___2^post_40 && tmp___3^0==tmp___3^post_40 && tmp___4^0==tmp___4^post_40 ], cost: 1
     27: l20 -> l17 : bDomain^0'=bDomain^post_28, bExists^0'=bExists^post_28, bSorted^0'=bSorted^post_28, nDim^0'=nDim^post_28, ni^0'=ni^post_28, nj^0'=nj^post_28, tmp^0'=tmp^post_28, tmp___0^0'=tmp___0^post_28, tmp___1^0'=tmp___1^post_28, tmp___2^0'=tmp___2^post_28, tmp___3^0'=tmp___3^post_28, tmp___4^0'=tmp___4^post_28, [ bDomain^0==bDomain^post_28 && bExists^0==bExists^post_28 && bSorted^0==bSorted^post_28 && nDim^0==nDim^post_28 && ni^0==ni^post_28 && nj^0==nj^post_28 && tmp^0==tmp^post_28 && tmp___0^0==tmp___0^post_28 && tmp___1^0==tmp___1^post_28 && tmp___2^0==tmp___2^post_28 && tmp___3^0==tmp___3^post_28 && tmp___4^0==tmp___4^post_28 ], cost: 1
     28: l20 -> l18 : bDomain^0'=bDomain^post_29, bExists^0'=bExists^post_29, bSorted^0'=bSorted^post_29, nDim^0'=nDim^post_29, ni^0'=ni^post_29, nj^0'=nj^post_29, tmp^0'=tmp^post_29, tmp___0^0'=tmp___0^post_29, tmp___1^0'=tmp___1^post_29, tmp___2^0'=tmp___2^post_29, tmp___3^0'=tmp___3^post_29, tmp___4^0'=tmp___4^post_29, [ tmp___1^post_29==1 && bDomain^0==bDomain^post_29 && bExists^0==bExists^post_29 && bSorted^0==bSorted^post_29 && nDim^0==nDim^post_29 && ni^0==ni^post_29 && nj^0==nj^post_29 && tmp^0==tmp^post_29 && tmp___0^0==tmp___0^post_29 && tmp___2^0==tmp___2^post_29 && tmp___3^0==tmp___3^post_29 && tmp___4^0==tmp___4^post_29 ], cost: 1
     29: l20 -> l17 : bDomain^0'=bDomain^post_30, bExists^0'=bExists^post_30, bSorted^0'=bSorted^post_30, nDim^0'=nDim^post_30, ni^0'=ni^post_30, nj^0'=nj^post_30, tmp^0'=tmp^post_30, tmp___0^0'=tmp___0^post_30, tmp___1^0'=tmp___1^post_30, tmp___2^0'=tmp___2^post_30, tmp___3^0'=tmp___3^post_30, tmp___4^0'=tmp___4^post_30, [ bDomain^0==bDomain^post_30 && bExists^0==bExists^post_30 && bSorted^0==bSorted^post_30 && nDim^0==nDim^post_30 && ni^0==ni^post_30 && nj^0==nj^post_30 && tmp^0==tmp^post_30 && tmp___0^0==tmp___0^post_30 && tmp___1^0==tmp___1^post_30 && tmp___2^0==tmp___2^post_30 && tmp___3^0==tmp___3^post_30 && tmp___4^0==tmp___4^post_30 ], cost: 1
     37: l21 -> l24 : bDomain^0'=bDomain^post_38, bExists^0'=bExists^post_38, bSorted^0'=bSorted^post_38, nDim^0'=nDim^post_38, ni^0'=ni^post_38, nj^0'=nj^post_38, tmp^0'=tmp^post_38, tmp___0^0'=tmp___0^post_38, tmp___1^0'=tmp___1^post_38, tmp___2^0'=tmp___2^post_38, tmp___3^0'=tmp___3^post_38, tmp___4^0'=tmp___4^post_38, [ bDomain^0==bDomain^post_38 && bExists^0==bExists^post_38 && bSorted^0==bSorted^post_38 && nDim^0==nDim^post_38 && ni^0==ni^post_38 && nj^0==nj^post_38 && tmp^0==tmp^post_38 && tmp___0^0==tmp___0^post_38 && tmp___1^0==tmp___1^post_38 && tmp___2^0==tmp___2^post_38 && tmp___3^0==tmp___3^post_38 && tmp___4^0==tmp___4^post_38 ], cost: 1
     31: l22 -> l18 : bDomain^0'=bDomain^post_32, bExists^0'=bExists^post_32, bSorted^0'=bSorted^post_32, nDim^0'=nDim^post_32, ni^0'=ni^post_32, nj^0'=nj^post_32, tmp^0'=tmp^post_32, tmp___0^0'=tmp___0^post_32, tmp___1^0'=tmp___1^post_32, tmp___2^0'=tmp___2^post_32, tmp___3^0'=tmp___3^post_32, tmp___4^0'=tmp___4^post_32, [ tmp___1^post_32==1 && bDomain^0==bDomain^post_32 && bExists^0==bExists^post_32 && bSorted^0==bSorted^post_32 && nDim^0==nDim^post_32 && ni^0==ni^post_32 && nj^0==nj^post_32 && tmp^0==tmp^post_32 && tmp___0^0==tmp___0^post_32 && tmp___2^0==tmp___2^post_32 && tmp___3^0==tmp___3^post_32 && tmp___4^0==tmp___4^post_32 ], cost: 1
     32: l23 -> l20 : bDomain^0'=bDomain^post_33, bExists^0'=bExists^post_33, bSorted^0'=bSorted^post_33, nDim^0'=nDim^post_33, ni^0'=ni^post_33, nj^0'=nj^post_33, tmp^0'=tmp^post_33, tmp___0^0'=tmp___0^post_33, tmp___1^0'=tmp___1^post_33, tmp___2^0'=tmp___2^post_33, tmp___3^0'=tmp___3^post_33, tmp___4^0'=tmp___4^post_33, [ bExists^0<=0 && 0<=bExists^0 && bDomain^0==bDomain^post_33 && bExists^0==bExists^post_33 && bSorted^0==bSorted^post_33 && nDim^0==nDim^post_33 && ni^0==ni^post_33 && nj^0==nj^post_33 && tmp^0==tmp^post_33 && tmp___0^0==tmp___0^post_33 && tmp___1^0==tmp___1^post_33 && tmp___2^0==tmp___2^post_33 && tmp___3^0==tmp___3^post_33 && tmp___4^0==tmp___4^post_33 ], cost: 1
     33: l23 -> l22 : bDomain^0'=bDomain^post_34, bExists^0'=bExists^post_34, bSorted^0'=bSorted^post_34, nDim^0'=nDim^post_34, ni^0'=ni^post_34, nj^0'=nj^post_34, tmp^0'=tmp^post_34, tmp___0^0'=tmp___0^post_34, tmp___1^0'=tmp___1^post_34, tmp___2^0'=tmp___2^post_34, tmp___3^0'=tmp___3^post_34, tmp___4^0'=tmp___4^post_34, [ 1<=bExists^0 && bDomain^0==bDomain^post_34 && bExists^0==bExists^post_34 && bSorted^0==bSorted^post_34 && nDim^0==nDim^post_34 && ni^0==ni^post_34 && nj^0==nj^post_34 && tmp^0==tmp^post_34 && tmp___0^0==tmp___0^post_34 && tmp___1^0==tmp___1^post_34 && tmp___2^0==tmp___2^post_34 && tmp___3^0==tmp___3^post_34 && tmp___4^0==tmp___4^post_34 ], cost: 1
     34: l23 -> l22 : bDomain^0'=bDomain^post_35, bExists^0'=bExists^post_35, bSorted^0'=bSorted^post_35, nDim^0'=nDim^post_35, ni^0'=ni^post_35, nj^0'=nj^post_35, tmp^0'=tmp^post_35, tmp___0^0'=tmp___0^post_35, tmp___1^0'=tmp___1^post_35, tmp___2^0'=tmp___2^post_35, tmp___3^0'=tmp___3^post_35, tmp___4^0'=tmp___4^post_35, [ 1+bExists^0<=0 && bDomain^0==bDomain^post_35 && bExists^0==bExists^post_35 && bSorted^0==bSorted^post_35 && nDim^0==nDim^post_35 && ni^0==ni^post_35 && nj^0==nj^post_35 && tmp^0==tmp^post_35 && tmp___0^0==tmp___0^post_35 && tmp___1^0==tmp___1^post_35 && tmp___2^0==tmp___2^post_35 && tmp___3^0==tmp___3^post_35 && tmp___4^0==tmp___4^post_35 ], cost: 1
     35: l24 -> l16 : bDomain^0'=bDomain^post_36, bExists^0'=bExists^post_36, bSorted^0'=bSorted^post_36, nDim^0'=nDim^post_36, ni^0'=ni^post_36, nj^0'=nj^post_36, tmp^0'=tmp^post_36, tmp___0^0'=tmp___0^post_36, tmp___1^0'=tmp___1^post_36, tmp___2^0'=tmp___2^post_36, tmp___3^0'=tmp___3^post_36, tmp___4^0'=tmp___4^post_36, [ nDim^0<=nj^0 && bDomain^0==bDomain^post_36 && bExists^0==bExists^post_36 && bSorted^0==bSorted^post_36 && nDim^0==nDim^post_36 && ni^0==ni^post_36 && nj^0==nj^post_36 && tmp^0==tmp^post_36 && tmp___0^0==tmp___0^post_36 && tmp___1^0==tmp___1^post_36 && tmp___2^0==tmp___2^post_36 && tmp___3^0==tmp___3^post_36 && tmp___4^0==tmp___4^post_36 ], cost: 1
     36: l24 -> l23 : bDomain^0'=bDomain^post_37, bExists^0'=bExists^post_37, bSorted^0'=bSorted^post_37, nDim^0'=nDim^post_37, ni^0'=ni^post_37, nj^0'=nj^post_37, tmp^0'=tmp^post_37, tmp___0^0'=tmp___0^post_37, tmp___1^0'=tmp___1^post_37, tmp___2^0'=tmp___2^post_37, tmp___3^0'=tmp___3^post_37, tmp___4^0'=tmp___4^post_37, [ 1+nj^0<=nDim^0 && bDomain^0==bDomain^post_37 && bExists^0==bExists^post_37 && bSorted^0==bSorted^post_37 && nDim^0==nDim^post_37 && ni^0==ni^post_37 && nj^0==nj^post_37 && tmp^0==tmp^post_37 && tmp___0^0==tmp___0^post_37 && tmp___1^0==tmp___1^post_37 && tmp___2^0==tmp___2^post_37 && tmp___3^0==tmp___3^post_37 && tmp___4^0==tmp___4^post_37 ], cost: 1
     43: l25 -> l10 : bDomain^0'=bDomain^post_44, bExists^0'=bExists^post_44, bSorted^0'=bSorted^post_44, nDim^0'=nDim^post_44, ni^0'=ni^post_44, nj^0'=nj^post_44, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, tmp___1^0'=tmp___1^post_44, tmp___2^0'=tmp___2^post_44, tmp___3^0'=tmp___3^post_44, tmp___4^0'=tmp___4^post_44, [ bDomain^post_44==1 && bSorted^post_44==1 && nDim^post_44==10 && tmp^post_44==tmp^post_44 && tmp___0^post_44==tmp___0^post_44 && ni^post_44==0 && bExists^0==bExists^post_44 && nj^0==nj^post_44 && tmp___1^0==tmp___1^post_44 && tmp___2^0==tmp___2^post_44 && tmp___3^0==tmp___3^post_44 && tmp___4^0==tmp___4^post_44 ], cost: 1
     44: l26 -> l25 : bDomain^0'=bDomain^post_45, bExists^0'=bExists^post_45, bSorted^0'=bSorted^post_45, nDim^0'=nDim^post_45, ni^0'=ni^post_45, nj^0'=nj^post_45, tmp^0'=tmp^post_45, tmp___0^0'=tmp___0^post_45, tmp___1^0'=tmp___1^post_45, tmp___2^0'=tmp___2^post_45, tmp___3^0'=tmp___3^post_45, tmp___4^0'=tmp___4^post_45, [ bDomain^0==bDomain^post_45 && bExists^0==bExists^post_45 && bSorted^0==bSorted^post_45 && nDim^0==nDim^post_45 && ni^0==ni^post_45 && nj^0==nj^post_45 && tmp^0==tmp^post_45 && tmp___0^0==tmp___0^post_45 && tmp___1^0==tmp___1^post_45 && tmp___2^0==tmp___2^post_45 && tmp___3^0==tmp___3^post_45 && tmp___4^0==tmp___4^post_45 ], cost: 1

Simplified all rules, resulting in:
   Start location: l26
      8: l5 -> l6 : bSorted^0'=tmp___3^0, ni^0'=1+ni^0, [], cost: 1
     42: l6 -> l9 : [], cost: 1
      9: l7 -> l5 : tmp___3^0'=1, [], cost: 1
     10: l7 -> l5 : tmp___3^0'=0, [], cost: 1
     11: l8 -> l5 : tmp___3^0'=0, [ bSorted^0==0 ], cost: 1
     12: l8 -> l7 : [ 1<=bSorted^0 ], cost: 1
     13: l8 -> l7 : [ 1+bSorted^0<=0 ], cost: 1
     15: l9 -> l8 : [ 1+ni^0<=-1+nDim^0 ], cost: 1
     16: l10 -> l11 : [], cost: 1
     40: l11 -> l13 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 1
     41: l11 -> l10 : ni^0'=1+ni^0, [ 1+ni^0<=nDim^0 ], cost: 1
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     26: l13 -> l19 : [], cost: 1
     18: l14 -> l12 : tmp___2^0'=1, [], cost: 1
     19: l15 -> l12 : tmp___2^0'=0, [ bExists^0==0 ], cost: 1
     20: l15 -> l14 : [ 1<=bExists^0 ], cost: 1
     21: l15 -> l14 : [ 1+bExists^0<=0 ], cost: 1
     22: l16 -> l12 : tmp___2^0'=0, [ bDomain^0==0 ], cost: 1
     23: l16 -> l15 : [ 1<=bDomain^0 ], cost: 1
     24: l16 -> l15 : [ 1+bDomain^0<=0 ], cost: 1
     25: l17 -> l18 : tmp___1^0'=0, [], cost: 1
     30: l18 -> l21 : bExists^0'=tmp___1^0, nj^0'=1+nj^0, [], cost: 1
     38: l19 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 1
     39: l19 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 1
     28: l20 -> l18 : tmp___1^0'=1, [], cost: 1
     29: l20 -> l17 : [], cost: 1
     37: l21 -> l24 : [], cost: 1
     31: l22 -> l18 : tmp___1^0'=1, [], cost: 1
     32: l23 -> l20 : [ bExists^0==0 ], cost: 1
     33: l23 -> l22 : [ 1<=bExists^0 ], cost: 1
     34: l23 -> l22 : [ 1+bExists^0<=0 ], cost: 1
     35: l24 -> l16 : [ nDim^0<=nj^0 ], cost: 1
     36: l24 -> l23 : [ 1+nj^0<=nDim^0 ], cost: 1
     43: l25 -> l10 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 1
     44: l26 -> l25 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l26
      8: l5 -> l6 : bSorted^0'=tmp___3^0, ni^0'=1+ni^0, [], cost: 1
     46: l6 -> l8 : [ 1+ni^0<=-1+nDim^0 ], cost: 2
      9: l7 -> l5 : tmp___3^0'=1, [], cost: 1
     10: l7 -> l5 : tmp___3^0'=0, [], cost: 1
     11: l8 -> l5 : tmp___3^0'=0, [ bSorted^0==0 ], cost: 1
     12: l8 -> l7 : [ 1<=bSorted^0 ], cost: 1
     13: l8 -> l7 : [ 1+bSorted^0<=0 ], cost: 1
     16: l10 -> l11 : [], cost: 1
     40: l11 -> l13 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 1
     41: l11 -> l10 : ni^0'=1+ni^0, [ 1+ni^0<=nDim^0 ], cost: 1
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     26: l13 -> l19 : [], cost: 1
     18: l14 -> l12 : tmp___2^0'=1, [], cost: 1
     19: l15 -> l12 : tmp___2^0'=0, [ bExists^0==0 ], cost: 1
     20: l15 -> l14 : [ 1<=bExists^0 ], cost: 1
     21: l15 -> l14 : [ 1+bExists^0<=0 ], cost: 1
     22: l16 -> l12 : tmp___2^0'=0, [ bDomain^0==0 ], cost: 1
     23: l16 -> l15 : [ 1<=bDomain^0 ], cost: 1
     24: l16 -> l15 : [ 1+bDomain^0<=0 ], cost: 1
     30: l18 -> l21 : bExists^0'=tmp___1^0, nj^0'=1+nj^0, [], cost: 1
     38: l19 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 1
     39: l19 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 1
     28: l20 -> l18 : tmp___1^0'=1, [], cost: 1
     47: l20 -> l18 : tmp___1^0'=0, [], cost: 2
     37: l21 -> l24 : [], cost: 1
     31: l22 -> l18 : tmp___1^0'=1, [], cost: 1
     32: l23 -> l20 : [ bExists^0==0 ], cost: 1
     33: l23 -> l22 : [ 1<=bExists^0 ], cost: 1
     34: l23 -> l22 : [ 1+bExists^0<=0 ], cost: 1
     35: l24 -> l16 : [ nDim^0<=nj^0 ], cost: 1
     36: l24 -> l23 : [ 1+nj^0<=nDim^0 ], cost: 1
     45: l26 -> l10 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l26
      8: l5 -> l6 : bSorted^0'=tmp___3^0, ni^0'=1+ni^0, [], cost: 1
     52: l6 -> l5 : tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && bSorted^0==0 ], cost: 3
     53: l6 -> l7 : [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 3
     54: l6 -> l7 : [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 3
      9: l7 -> l5 : tmp___3^0'=1, [], cost: 1
     10: l7 -> l5 : tmp___3^0'=0, [], cost: 1
     48: l10 -> l13 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     49: l10 -> l10 : ni^0'=1+ni^0, [ 1+ni^0<=nDim^0 ], cost: 2
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     50: l13 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
     18: l14 -> l12 : tmp___2^0'=1, [], cost: 1
     22: l16 -> l12 : tmp___2^0'=0, [ bDomain^0==0 ], cost: 1
     57: l16 -> l12 : tmp___2^0'=0, [ 1<=bDomain^0 && bExists^0==0 ], cost: 2
     58: l16 -> l14 : [ 1<=bDomain^0 && 1<=bExists^0 ], cost: 2
     59: l16 -> l14 : [ 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 2
     60: l16 -> l12 : tmp___2^0'=0, [ 1+bDomain^0<=0 && bExists^0==0 ], cost: 2
     61: l16 -> l14 : [ 1+bDomain^0<=0 && 1<=bExists^0 ], cost: 2
     62: l16 -> l14 : [ 1+bDomain^0<=0 && 1+bExists^0<=0 ], cost: 2
     30: l18 -> l21 : bExists^0'=tmp___1^0, nj^0'=1+nj^0, [], cost: 1
     55: l21 -> l16 : [ nDim^0<=nj^0 ], cost: 2
     56: l21 -> l23 : [ 1+nj^0<=nDim^0 ], cost: 2
     63: l23 -> l18 : tmp___1^0'=1, [ bExists^0==0 ], cost: 2
     64: l23 -> l18 : tmp___1^0'=0, [ bExists^0==0 ], cost: 3
     65: l23 -> l18 : tmp___1^0'=1, [ 1<=bExists^0 ], cost: 2
     66: l23 -> l18 : tmp___1^0'=1, [ 1+bExists^0<=0 ], cost: 2
     45: l26 -> l10 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 2

Accelerating simple loops of location 10.
   Accelerating the following rules:
     49: l10 -> l10 : ni^0'=1+ni^0, [ 1+ni^0<=nDim^0 ], cost: 2

   Accelerated rule 49 with backward acceleration, yielding the new rule 67.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 49.

Accelerated all simple loops using metering functions (where possible):
   Start location: l26
      8: l5 -> l6 : bSorted^0'=tmp___3^0, ni^0'=1+ni^0, [], cost: 1
     52: l6 -> l5 : tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && bSorted^0==0 ], cost: 3
     53: l6 -> l7 : [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 3
     54: l6 -> l7 : [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 3
      9: l7 -> l5 : tmp___3^0'=1, [], cost: 1
     10: l7 -> l5 : tmp___3^0'=0, [], cost: 1
     48: l10 -> l13 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     67: l10 -> l10 : ni^0'=nDim^0, [ -ni^0+nDim^0>=0 ], cost: -2*ni^0+2*nDim^0
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     50: l13 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
     18: l14 -> l12 : tmp___2^0'=1, [], cost: 1
     22: l16 -> l12 : tmp___2^0'=0, [ bDomain^0==0 ], cost: 1
     57: l16 -> l12 : tmp___2^0'=0, [ 1<=bDomain^0 && bExists^0==0 ], cost: 2
     58: l16 -> l14 : [ 1<=bDomain^0 && 1<=bExists^0 ], cost: 2
     59: l16 -> l14 : [ 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 2
     60: l16 -> l12 : tmp___2^0'=0, [ 1+bDomain^0<=0 && bExists^0==0 ], cost: 2
     61: l16 -> l14 : [ 1+bDomain^0<=0 && 1<=bExists^0 ], cost: 2
     62: l16 -> l14 : [ 1+bDomain^0<=0 && 1+bExists^0<=0 ], cost: 2
     30: l18 -> l21 : bExists^0'=tmp___1^0, nj^0'=1+nj^0, [], cost: 1
     55: l21 -> l16 : [ nDim^0<=nj^0 ], cost: 2
     56: l21 -> l23 : [ 1+nj^0<=nDim^0 ], cost: 2
     63: l23 -> l18 : tmp___1^0'=1, [ bExists^0==0 ], cost: 2
     64: l23 -> l18 : tmp___1^0'=0, [ bExists^0==0 ], cost: 3
     65: l23 -> l18 : tmp___1^0'=1, [ 1<=bExists^0 ], cost: 2
     66: l23 -> l18 : tmp___1^0'=1, [ 1+bExists^0<=0 ], cost: 2
     45: l26 -> l10 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l26
      8: l5 -> l6 : bSorted^0'=tmp___3^0, ni^0'=1+ni^0, [], cost: 1
     52: l6 -> l5 : tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && bSorted^0==0 ], cost: 3
     53: l6 -> l7 : [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 3
     54: l6 -> l7 : [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 3
      9: l7 -> l5 : tmp___3^0'=1, [], cost: 1
     10: l7 -> l5 : tmp___3^0'=0, [], cost: 1
     48: l10 -> l13 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     50: l13 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
     18: l14 -> l12 : tmp___2^0'=1, [], cost: 1
     22: l16 -> l12 : tmp___2^0'=0, [ bDomain^0==0 ], cost: 1
     57: l16 -> l12 : tmp___2^0'=0, [ 1<=bDomain^0 && bExists^0==0 ], cost: 2
     58: l16 -> l14 : [ 1<=bDomain^0 && 1<=bExists^0 ], cost: 2
     59: l16 -> l14 : [ 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 2
     60: l16 -> l12 : tmp___2^0'=0, [ 1+bDomain^0<=0 && bExists^0==0 ], cost: 2
     61: l16 -> l14 : [ 1+bDomain^0<=0 && 1<=bExists^0 ], cost: 2
     62: l16 -> l14 : [ 1+bDomain^0<=0 && 1+bExists^0<=0 ], cost: 2
     30: l18 -> l21 : bExists^0'=tmp___1^0, nj^0'=1+nj^0, [], cost: 1
     55: l21 -> l16 : [ nDim^0<=nj^0 ], cost: 2
     56: l21 -> l23 : [ 1+nj^0<=nDim^0 ], cost: 2
     63: l23 -> l18 : tmp___1^0'=1, [ bExists^0==0 ], cost: 2
     64: l23 -> l18 : tmp___1^0'=0, [ bExists^0==0 ], cost: 3
     65: l23 -> l18 : tmp___1^0'=1, [ 1<=bExists^0 ], cost: 2
     66: l23 -> l18 : tmp___1^0'=1, [ 1+bExists^0<=0 ], cost: 2
     45: l26 -> l10 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 2
     68: l26 -> l10 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=10, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 22

Eliminated locations (on tree-shaped paths):
   Start location: l26
      8: l5 -> l6 : bSorted^0'=tmp___3^0, ni^0'=1+ni^0, [], cost: 1
     52: l6 -> l5 : tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && bSorted^0==0 ], cost: 3
     70: l6 -> l5 : tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 4
     71: l6 -> l5 : tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 4
     72: l6 -> l5 : tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 4
     73: l6 -> l5 : tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 4
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     50: l13 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
     18: l14 -> l12 : tmp___2^0'=1, [], cost: 1
     30: l18 -> l21 : bExists^0'=tmp___1^0, nj^0'=1+nj^0, [], cost: 1
     74: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && bDomain^0==0 ], cost: 3
     75: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1<=bDomain^0 && bExists^0==0 ], cost: 4
     76: l21 -> l14 : [ nDim^0<=nj^0 && 1<=bDomain^0 && 1<=bExists^0 ], cost: 4
     77: l21 -> l14 : [ nDim^0<=nj^0 && 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 4
     78: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1+bDomain^0<=0 && bExists^0==0 ], cost: 4
     79: l21 -> l14 : [ nDim^0<=nj^0 && 1+bDomain^0<=0 && 1<=bExists^0 ], cost: 4
     80: l21 -> l14 : [ nDim^0<=nj^0 && 1+bDomain^0<=0 && 1+bExists^0<=0 ], cost: 4
     81: l21 -> l18 : tmp___1^0'=1, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 4
     82: l21 -> l18 : tmp___1^0'=0, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 5
     83: l21 -> l18 : tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1<=bExists^0 ], cost: 4
     84: l21 -> l18 : tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1+bExists^0<=0 ], cost: 4
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Eliminated locations (on tree-shaped paths):
   Start location: l26
     85: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && bSorted^0==0 ], cost: 4
     86: l6 -> l6 : bSorted^0'=1, ni^0'=1+ni^0, tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 5
     87: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 5
     88: l6 -> l6 : bSorted^0'=1, ni^0'=1+ni^0, tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 5
     89: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 5
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     50: l13 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
     74: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && bDomain^0==0 ], cost: 3
     75: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1<=bDomain^0 && bExists^0==0 ], cost: 4
     78: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1+bDomain^0<=0 && bExists^0==0 ], cost: 4
     90: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1<=bExists^0 ], cost: 5
     91: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 5
     92: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1+bDomain^0<=0 && 1<=bExists^0 ], cost: 5
     93: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1+bDomain^0<=0 && 1+bExists^0<=0 ], cost: 5
     94: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 5
     95: l21 -> l21 : bExists^0'=0, nj^0'=1+nj^0, tmp___1^0'=0, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 6
     96: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1<=bExists^0 ], cost: 5
     97: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1+bExists^0<=0 ], cost: 5
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Applied pruning (of leafs and parallel rules):
   Start location: l26
     85: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && bSorted^0==0 ], cost: 4
     86: l6 -> l6 : bSorted^0'=1, ni^0'=1+ni^0, tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 5
     87: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 5
     88: l6 -> l6 : bSorted^0'=1, ni^0'=1+ni^0, tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 5
     89: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 5
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     50: l13 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
     74: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && bDomain^0==0 ], cost: 3
     75: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1<=bDomain^0 && bExists^0==0 ], cost: 4
     78: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1+bDomain^0<=0 && bExists^0==0 ], cost: 4
     90: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1<=bExists^0 ], cost: 5
     91: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 5
     94: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 5
     95: l21 -> l21 : bExists^0'=0, nj^0'=1+nj^0, tmp___1^0'=0, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 6
     96: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1<=bExists^0 ], cost: 5
     97: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1+bExists^0<=0 ], cost: 5
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Accelerating simple loops of location 6.
   Accelerating the following rules:
     85: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && bSorted^0==0 ], cost: 4
     86: l6 -> l6 : bSorted^0'=1, ni^0'=1+ni^0, tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 5
     87: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 5
     88: l6 -> l6 : bSorted^0'=1, ni^0'=1+ni^0, tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 5
     89: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 5

   Accelerated rule 85 with backward acceleration, yielding the new rule 98.
   Accelerated rule 86 with backward acceleration, yielding the new rule 99.
   Failed to prove monotonicity of the guard of rule 87.
   Failed to prove monotonicity of the guard of rule 88.
   Failed to prove monotonicity of the guard of rule 89.
[accelerate] Nesting with 5 inner and 5 outer candidates
   Removing the simple loops: 85 86.

Accelerating simple loops of location 21.
   Accelerating the following rules:
     94: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 5
     95: l21 -> l21 : bExists^0'=0, nj^0'=1+nj^0, tmp___1^0'=0, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 6
     96: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1<=bExists^0 ], cost: 5
     97: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1+bExists^0<=0 ], cost: 5

   Failed to prove monotonicity of the guard of rule 94.
   Accelerated rule 95 with backward acceleration, yielding the new rule 100.
   Accelerated rule 96 with backward acceleration, yielding the new rule 101.
   Failed to prove monotonicity of the guard of rule 97.
[accelerate] Nesting with 4 inner and 4 outer candidates
   Removing the simple loops: 95 96.

Accelerated all simple loops using metering functions (where possible):
   Start location: l26
     87: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1<=bSorted^0 ], cost: 5
     88: l6 -> l6 : bSorted^0'=1, ni^0'=1+ni^0, tmp___3^0'=1, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 5
     89: l6 -> l6 : bSorted^0'=0, ni^0'=1+ni^0, tmp___3^0'=0, [ 1+ni^0<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 5
     98: l6 -> l6 : bSorted^0'=0, ni^0'=-1+nDim^0, tmp___3^0'=0, [ bSorted^0==0 && -1-ni^0+nDim^0>=1 ], cost: -4-4*ni^0+4*nDim^0
     99: l6 -> l6 : bSorted^0'=1, ni^0'=-1+nDim^0, tmp___3^0'=1, [ 1<=bSorted^0 && -1-ni^0+nDim^0>=1 ], cost: -5-5*ni^0+5*nDim^0
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     50: l13 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
     74: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && bDomain^0==0 ], cost: 3
     75: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1<=bDomain^0 && bExists^0==0 ], cost: 4
     78: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1+bDomain^0<=0 && bExists^0==0 ], cost: 4
     90: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1<=bExists^0 ], cost: 5
     91: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 5
     94: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && bExists^0==0 ], cost: 5
     97: l21 -> l21 : bExists^0'=1, nj^0'=1+nj^0, tmp___1^0'=1, [ 1+nj^0<=nDim^0 && 1+bExists^0<=0 ], cost: 5
    100: l21 -> l21 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, [ bExists^0==0 && -nj^0+nDim^0>=1 ], cost: -6*nj^0+6*nDim^0
    101: l21 -> l21 : bExists^0'=1, nj^0'=nDim^0, tmp___1^0'=1, [ 1<=bExists^0 && -nj^0+nDim^0>=1 ], cost: -5*nj^0+5*nDim^0
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Chained accelerated rules (with incoming rules):
   Start location: l26
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     50: l13 -> l6 : ni^0'=0, [ nDim^0<=ni^0 ], cost: 2
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
    102: l13 -> l6 : bSorted^0'=0, ni^0'=1, tmp___3^0'=0, [ nDim^0<=ni^0 && 1<=-1+nDim^0 && 1<=bSorted^0 ], cost: 7
    103: l13 -> l6 : bSorted^0'=1, ni^0'=1, tmp___3^0'=1, [ nDim^0<=ni^0 && 1<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 7
    104: l13 -> l6 : bSorted^0'=0, ni^0'=1, tmp___3^0'=0, [ nDim^0<=ni^0 && 1<=-1+nDim^0 && 1+bSorted^0<=0 ], cost: 7
    105: l13 -> l6 : bSorted^0'=0, ni^0'=-1+nDim^0, tmp___3^0'=0, [ nDim^0<=ni^0 && bSorted^0==0 && -1+nDim^0>=1 ], cost: -2+4*nDim^0
    106: l13 -> l6 : bSorted^0'=1, ni^0'=-1+nDim^0, tmp___3^0'=1, [ nDim^0<=ni^0 && 1<=bSorted^0 && -1+nDim^0>=1 ], cost: -3+5*nDim^0
    107: l13 -> l21 : bExists^0'=1, nj^0'=1, tmp___1^0'=1, [ 1+ni^0<=nDim^0 && 1<=nDim^0 ], cost: 7
    108: l13 -> l21 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 ], cost: 2+6*nDim^0
     74: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && bDomain^0==0 ], cost: 3
     75: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1<=bDomain^0 && bExists^0==0 ], cost: 4
     78: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1+bDomain^0<=0 && bExists^0==0 ], cost: 4
     90: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1<=bExists^0 ], cost: 5
     91: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 5
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l26
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
     51: l13 -> l21 : bExists^0'=0, nj^0'=0, [ 1+ni^0<=nDim^0 ], cost: 2
    105: l13 -> l6 : bSorted^0'=0, ni^0'=-1+nDim^0, tmp___3^0'=0, [ nDim^0<=ni^0 && bSorted^0==0 && -1+nDim^0>=1 ], cost: -2+4*nDim^0
    106: l13 -> l6 : bSorted^0'=1, ni^0'=-1+nDim^0, tmp___3^0'=1, [ nDim^0<=ni^0 && 1<=bSorted^0 && -1+nDim^0>=1 ], cost: -3+5*nDim^0
    107: l13 -> l21 : bExists^0'=1, nj^0'=1, tmp___1^0'=1, [ 1+ni^0<=nDim^0 && 1<=nDim^0 ], cost: 7
    108: l13 -> l21 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 ], cost: 2+6*nDim^0
     74: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && bDomain^0==0 ], cost: 3
     75: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1<=bDomain^0 && bExists^0==0 ], cost: 4
     78: l21 -> l12 : tmp___2^0'=0, [ nDim^0<=nj^0 && 1+bDomain^0<=0 && bExists^0==0 ], cost: 4
     90: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1<=bExists^0 ], cost: 5
     91: l21 -> l12 : tmp___2^0'=1, [ nDim^0<=nj^0 && 1<=bDomain^0 && 1+bExists^0<=0 ], cost: 5
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Eliminated locations (on tree-shaped paths):
   Start location: l26
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
    105: l13 -> l6 : bSorted^0'=0, ni^0'=-1+nDim^0, tmp___3^0'=0, [ nDim^0<=ni^0 && bSorted^0==0 && -1+nDim^0>=1 ], cost: -2+4*nDim^0
    106: l13 -> l6 : bSorted^0'=1, ni^0'=-1+nDim^0, tmp___3^0'=1, [ nDim^0<=ni^0 && 1<=bSorted^0 && -1+nDim^0>=1 ], cost: -3+5*nDim^0
    109: l13 -> l12 : bExists^0'=0, nj^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0<=0 && bDomain^0==0 ], cost: 5
    110: l13 -> l12 : bExists^0'=0, nj^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0<=0 && 1<=bDomain^0 ], cost: 6
    111: l13 -> l12 : bExists^0'=0, nj^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0<=0 && 1+bDomain^0<=0 ], cost: 6
    112: l13 -> l12 : bExists^0'=1, nj^0'=1, tmp___1^0'=1, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && 1<=nDim^0 && nDim^0<=1 && bDomain^0==0 ], cost: 10
    113: l13 -> l12 : bExists^0'=1, nj^0'=1, tmp___1^0'=1, tmp___2^0'=1, [ 1+ni^0<=nDim^0 && 1<=nDim^0 && nDim^0<=1 && 1<=bDomain^0 ], cost: 12
    114: l13 -> l12 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && bDomain^0==0 ], cost: 5+6*nDim^0
    115: l13 -> l12 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1<=bDomain^0 ], cost: 6+6*nDim^0
    116: l13 -> l12 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1+bDomain^0<=0 ], cost: 6+6*nDim^0
    117: l13 -> [30] : [ 1+ni^0<=nDim^0 && nDim^0>=1 ], cost: 2+6*nDim^0
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Applied pruning (of leafs and parallel rules):
   Start location: l26
     17: l12 -> l13 : bDomain^0'=tmp___2^0, ni^0'=1+ni^0, [], cost: 1
    105: l13 -> l6 : bSorted^0'=0, ni^0'=-1+nDim^0, tmp___3^0'=0, [ nDim^0<=ni^0 && bSorted^0==0 && -1+nDim^0>=1 ], cost: -2+4*nDim^0
    106: l13 -> l6 : bSorted^0'=1, ni^0'=-1+nDim^0, tmp___3^0'=1, [ nDim^0<=ni^0 && 1<=bSorted^0 && -1+nDim^0>=1 ], cost: -3+5*nDim^0
    110: l13 -> l12 : bExists^0'=0, nj^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0<=0 && 1<=bDomain^0 ], cost: 6
    112: l13 -> l12 : bExists^0'=1, nj^0'=1, tmp___1^0'=1, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && 1<=nDim^0 && nDim^0<=1 && bDomain^0==0 ], cost: 10
    114: l13 -> l12 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && bDomain^0==0 ], cost: 5+6*nDim^0
    115: l13 -> l12 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1<=bDomain^0 ], cost: 6+6*nDim^0
    116: l13 -> l12 : bExists^0'=0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1+bDomain^0<=0 ], cost: 6+6*nDim^0
    117: l13 -> [30] : [ 1+ni^0<=nDim^0 && nDim^0>=1 ], cost: 2+6*nDim^0
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Eliminated locations (on tree-shaped paths):
   Start location: l26
    105: l13 -> l6 : bSorted^0'=0, ni^0'=-1+nDim^0, tmp___3^0'=0, [ nDim^0<=ni^0 && bSorted^0==0 && -1+nDim^0>=1 ], cost: -2+4*nDim^0
    106: l13 -> l6 : bSorted^0'=1, ni^0'=-1+nDim^0, tmp___3^0'=1, [ nDim^0<=ni^0 && 1<=bSorted^0 && -1+nDim^0>=1 ], cost: -3+5*nDim^0
    117: l13 -> [30] : [ 1+ni^0<=nDim^0 && nDim^0>=1 ], cost: 2+6*nDim^0
    118: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0<=0 && 1<=bDomain^0 ], cost: 7
    119: l13 -> l13 : bDomain^0'=0, bExists^0'=1, ni^0'=1+ni^0, nj^0'=1, tmp___1^0'=1, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && 1<=nDim^0 && nDim^0<=1 && bDomain^0==0 ], cost: 11
    120: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && bDomain^0==0 ], cost: 6+6*nDim^0
    121: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1<=bDomain^0 ], cost: 7+6*nDim^0
    122: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1+bDomain^0<=0 ], cost: 7+6*nDim^0
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Accelerating simple loops of location 13.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
    118: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0<=0 && 1<=bDomain^0 ], cost: 7
    119: l13 -> l13 : bDomain^0'=0, bExists^0'=1, ni^0'=1+ni^0, nj^0'=1, tmp___1^0'=1, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && 1-nDim^0==0 && bDomain^0==0 ], cost: 11
    120: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && bDomain^0==0 ], cost: 6+6*nDim^0
    121: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1<=bDomain^0 ], cost: 7+6*nDim^0
    122: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1+bDomain^0<=0 ], cost: 7+6*nDim^0

   Failed to prove monotonicity of the guard of rule 118.
   Accelerated rule 119 with backward acceleration, yielding the new rule 123.
   Accelerated rule 120 with backward acceleration, yielding the new rule 124.
   Failed to prove monotonicity of the guard of rule 121.
   Failed to prove monotonicity of the guard of rule 122.
[accelerate] Nesting with 5 inner and 5 outer candidates
   Removing the simple loops: 119 120.

Accelerated all simple loops using metering functions (where possible):
   Start location: l26
    105: l13 -> l6 : bSorted^0'=0, ni^0'=-1+nDim^0, tmp___3^0'=0, [ nDim^0<=ni^0 && bSorted^0==0 && -1+nDim^0>=1 ], cost: -2+4*nDim^0
    106: l13 -> l6 : bSorted^0'=1, ni^0'=-1+nDim^0, tmp___3^0'=1, [ nDim^0<=ni^0 && 1<=bSorted^0 && -1+nDim^0>=1 ], cost: -3+5*nDim^0
    117: l13 -> [30] : [ 1+ni^0<=nDim^0 && nDim^0>=1 ], cost: 2+6*nDim^0
    118: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0<=0 && 1<=bDomain^0 ], cost: 7
    121: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1<=bDomain^0 ], cost: 7+6*nDim^0
    122: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=1+ni^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ 1+ni^0<=nDim^0 && nDim^0>=1 && 1+bDomain^0<=0 ], cost: 7+6*nDim^0
    123: l13 -> l13 : bDomain^0'=0, bExists^0'=1, ni^0'=nDim^0, nj^0'=1, tmp___1^0'=1, tmp___2^0'=0, [ 1-nDim^0==0 && bDomain^0==0 && -ni^0+nDim^0>=1 ], cost: -11*ni^0+11*nDim^0
    124: l13 -> l13 : bDomain^0'=0, bExists^0'=0, ni^0'=nDim^0, nj^0'=nDim^0, tmp___1^0'=0, tmp___2^0'=0, [ nDim^0>=1 && bDomain^0==0 && -ni^0+nDim^0>=1 ], cost: -6*ni^0-6*(ni^0-nDim^0)*nDim^0+6*nDim^0
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24

Chained accelerated rules (with incoming rules):
   Start location: l26
    105: l13 -> l6 : bSorted^0'=0, ni^0'=-1+nDim^0, tmp___3^0'=0, [ nDim^0<=ni^0 && bSorted^0==0 && -1+nDim^0>=1 ], cost: -2+4*nDim^0
    106: l13 -> l6 : bSorted^0'=1, ni^0'=-1+nDim^0, tmp___3^0'=1, [ nDim^0<=ni^0 && 1<=bSorted^0 && -1+nDim^0>=1 ], cost: -3+5*nDim^0
    117: l13 -> [30] : [ 1+ni^0<=nDim^0 && nDim^0>=1 ], cost: 2+6*nDim^0
     69: l26 -> l13 : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 24
    125: l26 -> l13 : bDomain^0'=0, bExists^0'=0, bSorted^0'=1, nDim^0'=10, ni^0'=1, nj^0'=10, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, tmp___1^0'=0, tmp___2^0'=0, [], cost: 91

Eliminated locations (on tree-shaped paths):
   Start location: l26
    126: l26 -> [30] : bDomain^0'=1, bSorted^0'=1, nDim^0'=10, ni^0'=0, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, [], cost: 86
    127: l26 -> [30] : bDomain^0'=0, bExists^0'=0, bSorted^0'=1, nDim^0'=10, ni^0'=1, nj^0'=10, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, tmp___1^0'=0, tmp___2^0'=0, [], cost: 153

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l26
    127: l26 -> [30] : bDomain^0'=0, bExists^0'=0, bSorted^0'=1, nDim^0'=10, ni^0'=1, nj^0'=10, tmp^0'=tmp^post_44, tmp___0^0'=tmp___0^post_44, tmp___1^0'=0, tmp___2^0'=0, [], cost: 153

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:  [ bDomain^0==bDomain^post_45 && bExists^0==bExists^post_45 && bSorted^0==bSorted^post_45 && nDim^0==nDim^post_45 && ni^0==ni^post_45 && nj^0==nj^post_45 && tmp^0==tmp^post_45 && tmp___0^0==tmp___0^post_45 && tmp___1^0==tmp___1^post_45 && tmp___2^0==tmp___2^post_45 && tmp___3^0==tmp___3^post_45 && tmp___4^0==tmp___4^post_45 ]

WORST_CASE(Omega(1),?)