/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


MAYBE

Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [f34/21,f44/21]
1. non_recursive  : [exit_location/1]
2. recursive  : [f65/21,f75/21,f79/21,f81/21]
3. recursive  : [f100/17]
4. recursive  : [f130/29]
5. recursive  : [f190/17]
6. recursive  : [f209/1]
7. non_recursive  : [f209_loop_cont/2]
8. non_recursive  : [f190_loop_cont/60]
9. non_recursive  : [f130_loop_cont/60]
10. non_recursive  : [f100_loop_cont/60]
11. non_recursive  : [f65_loop_cont/60]
12. non_recursive  : [f34_loop_cont/60]
13. non_recursive  : [f0/59]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f34/21
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f65/21
3. SCC is partially evaluated into f100/17
4. SCC is partially evaluated into f130/29
5. SCC is partially evaluated into f190/17
6. SCC is partially evaluated into f209/1
7. SCC is completely evaluated into other SCCs
8. SCC is partially evaluated into f190_loop_cont/60
9. SCC is partially evaluated into f130_loop_cont/60
10. SCC is partially evaluated into f100_loop_cont/60
11. SCC is partially evaluated into f65_loop_cont/60
12. SCC is partially evaluated into f34_loop_cont/60
13. SCC is partially evaluated into f0/59

Control-Flow Refinement of Cost Relations
=====================================

### Specialization of cost equations f34/21 
* CE 8 is refined into CE [52] 
* CE 9 is refined into CE [53] 
* CE 3 is refined into CE [54] 
* CE 5 is refined into CE [55] 
* CE 4 is refined into CE [56] 
* CE 6 is refined into CE [57] 
* CE 7 is refined into CE [58] 


### Cost equations --> "Loop" of f34/21 
* CEs [54] --> Loop 51 
* CEs [55] --> Loop 52 
* CEs [56] --> Loop 53 
* CEs [57] --> Loop 54 
* CEs [58] --> Loop 55 
* CEs [52] --> Loop 56 
* CEs [53] --> Loop 57 

### Ranking functions of CR f34(B,C,D,E,G,O,R,U1,V1,W1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2) 
* RF of phase [51,52,53,54,55]: [B]

#### Partial ranking functions of CR f34(B,C,D,E,G,O,R,U1,V1,W1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2) 
* Partial RF of phase [51,52,53,54,55]:
  - RF of loop [51:1,52:1,53:1,54:1,55:1]:
    B


### Specialization of cost equations f65/21 
* CE 28 is refined into CE [59] 
* CE 29 is refined into CE [60] 
* CE 24 is refined into CE [61] 
* CE 26 is refined into CE [62] 
* CE 25 is refined into CE [63] 
* CE 27 is refined into CE [64] 
* CE 16 is refined into CE [65] 
* CE 18 is refined into CE [66] 
* CE 17 is refined into CE [67] 
* CE 19 is refined into CE [68] 
* CE 20 is refined into CE [69] 
* CE 22 is refined into CE [70] 
* CE 21 is refined into CE [71] 
* CE 23 is refined into CE [72] 
* CE 12 is refined into CE [73] 
* CE 14 is refined into CE [74] 
* CE 13 is refined into CE [75] 
* CE 15 is refined into CE [76] 


### Cost equations --> "Loop" of f65/21 
* CEs [61] --> Loop 58 
* CEs [62] --> Loop 59 
* CEs [63] --> Loop 60 
* CEs [64] --> Loop 61 
* CEs [65] --> Loop 62 
* CEs [66] --> Loop 63 
* CEs [67] --> Loop 64 
* CEs [68] --> Loop 65 
* CEs [69] --> Loop 66 
* CEs [70] --> Loop 67 
* CEs [71] --> Loop 68 
* CEs [72] --> Loop 69 
* CEs [73] --> Loop 70 
* CEs [74] --> Loop 71 
* CEs [75] --> Loop 72 
* CEs [76] --> Loop 73 
* CEs [59] --> Loop 74 
* CEs [60] --> Loop 75 

### Ranking functions of CR f65(A,F,G,H,I,O,R,M1,S1,T1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2) 
* RF of phase [58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73]: [G]

#### Partial ranking functions of CR f65(A,F,G,H,I,O,R,M1,S1,T1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2) 
* Partial RF of phase [58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73]:
  - RF of loop [58:1,59:1,60:1,61:1,62:1,63:1,64:1,65:1,66:1,67:1,68:1,69:1,70:1,71:1,72:1,73:1]:
    G


### Specialization of cost equations f100/17 
* CE 32 is refined into CE [77] 
* CE 34 is refined into CE [78] 
* CE 33 is refined into CE [79] 


### Cost equations --> "Loop" of f100/17 
* CEs [79] --> Loop 76 
* CEs [77] --> Loop 77 
* CEs [78] --> Loop 78 

### Ranking functions of CR f100(O,R,M1,N1,O1,P1,Q1,R1,K2,L2,M2,N2,O2,P2,Q2,R2,S2) 
* RF of phase [76]: [M1]

#### Partial ranking functions of CR f100(O,R,M1,N1,O1,P1,Q1,R1,K2,L2,M2,N2,O2,P2,Q2,R2,S2) 
* Partial RF of phase [76]:
  - RF of loop [76:1]:
    M1


### Specialization of cost equations f130/29 
* CE 37 is refined into CE [80] 
* CE 40 is refined into CE [81] 
* CE 38 is refined into CE [82] 
* CE 39 is refined into CE [83] 


### Cost equations --> "Loop" of f130/29 
* CEs [82] --> Loop 79 
* CEs [83] --> Loop 80 
* CEs [80] --> Loop 81 
* CEs [81] --> Loop 82 

### Ranking functions of CR f130(J,O,R,S,T,U,V,X,B1,H1,I1,J1,K1,L1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 

#### Partial ranking functions of CR f130(J,O,R,S,T,U,V,X,B1,H1,I1,J1,K1,L1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2) 


### Specialization of cost equations f190/17 
* CE 46 is discarded (unfeasible) 
* CE 45 is refined into CE [84] 
* CE 47 is refined into CE [85] 
* CE 44 is discarded (unfeasible) 
* CE 43 is refined into CE [86] 


### Cost equations --> "Loop" of f190/17 
* CEs [86] --> Loop 83 
* CEs [84] --> Loop 84 
* CEs [85] --> Loop 85 

### Ranking functions of CR f190(J,K,L,M,N,O,P,Q,K2,L2,M2,N2,O2,P2,Q2,R2,S2) 
* RF of phase [83]: [J]

#### Partial ranking functions of CR f190(J,K,L,M,N,O,P,Q,K2,L2,M2,N2,O2,P2,Q2,R2,S2) 
* Partial RF of phase [83]:
  - RF of loop [83:1]:
    J


### Specialization of cost equations f209/1 
* CE 51 is refined into CE [87] 
* CE 50 is refined into CE [88] 


### Cost equations --> "Loop" of f209/1 
* CEs [88] --> Loop 86 
* CEs [87] --> Loop 87 

### Ranking functions of CR f209(K2) 

#### Partial ranking functions of CR f209(K2) 


### Specialization of cost equations f190_loop_cont/60 
* CE 49 is refined into CE [89,90] 
* CE 48 is refined into CE [91] 


### Cost equations --> "Loop" of f190_loop_cont/60 
* CEs [89] --> Loop 88 
* CEs [91] --> Loop 89 
* CEs [90] --> Loop 90 

### Ranking functions of CR f190_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 

#### Partial ranking functions of CR f190_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 


### Specialization of cost equations f130_loop_cont/60 
* CE 42 is refined into CE [92,93,94,95,96,97] 
* CE 41 is refined into CE [98] 


### Cost equations --> "Loop" of f130_loop_cont/60 
* CEs [92,94] --> Loop 91 
* CEs [96] --> Loop 92 
* CEs [93] --> Loop 93 
* CEs [98] --> Loop 94 
* CEs [95] --> Loop 95 
* CEs [97] --> Loop 96 

### Ranking functions of CR f130_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 

#### Partial ranking functions of CR f130_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 


### Specialization of cost equations f100_loop_cont/60 
* CE 36 is refined into CE [99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115] 
* CE 35 is refined into CE [116] 


### Cost equations --> "Loop" of f100_loop_cont/60 
* CEs [99,100,101,102,105,106,107] --> Loop 97 
* CEs [116] --> Loop 98 
* CEs [103,104,108,109,110,111,112,113,114,115] --> Loop 99 

### Ranking functions of CR f100_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 

#### Partial ranking functions of CR f100_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 


### Specialization of cost equations f65_loop_cont/60 
* CE 31 is refined into CE [117,118,119,120,121,122] 
* CE 30 is refined into CE [123] 


### Cost equations --> "Loop" of f65_loop_cont/60 
* CEs [118,119] --> Loop 100 
* CEs [121] --> Loop 101 
* CEs [117] --> Loop 102 
* CEs [123] --> Loop 103 
* CEs [120] --> Loop 104 
* CEs [122] --> Loop 105 

### Ranking functions of CR f65_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 

#### Partial ranking functions of CR f65_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 


### Specialization of cost equations f34_loop_cont/60 
* CE 11 is refined into CE [124,125,126,127,128,129,130,131,132,133,134,135] 
* CE 10 is refined into CE [136] 


### Cost equations --> "Loop" of f34_loop_cont/60 
* CEs [125,126,127,128] --> Loop 106 
* CEs [131,132,133] --> Loop 107 
* CEs [124] --> Loop 108 
* CEs [136] --> Loop 109 
* CEs [129,130] --> Loop 110 
* CEs [134,135] --> Loop 111 

### Ranking functions of CR f34_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 

#### Partial ranking functions of CR f34_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 


### Specialization of cost equations f0/59 
* CE 1 is refined into CE [137,138,139,140,141,142,143,144,145,146,147,148] 
* CE 2 is refined into CE [149,150,151,152,153,154,155,156,157,158,159,160] 


### Cost equations --> "Loop" of f0/59 
* CEs [142,143,147,148,154,155,159,160] --> Loop 112 
* CEs [137,138,139,140,141,144,145,146,149,150,151,152,153,156,157,158] --> Loop 113 

### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,K2) 

#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,K2) 


Computing Bounds
=====================================

#### Cost of chains of f34(B,C,D,E,G,O,R,U1,V1,W1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2):
* Chain [[51,52,53,54,55],57]: 5*it(51)+0
  Such that:aux(3) =< B
it(51) =< aux(3)

  with precondition: [O=0,R=0,K2=2,B>=1] 

* Chain [[51,52,53,54,55],56]: 5*it(51)+0
  Such that:aux(4) =< B
it(51) =< aux(4)

  with precondition: [O=0,R=0,K2=7,L2=0,Q2=0,R2=0,P2=U2,B>=1] 

* Chain [57]: 0
  with precondition: [O=0,R=0,K2=2] 

* Chain [56]: 0
  with precondition: [O=0,R=0,K2=7,Q2=0,R2=0,M2=C,N2=D,O2=E,S2=U1,B=L2,U2=P2,0>=B] 


#### Cost of chains of f65(A,F,G,H,I,O,R,M1,S1,T1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2):
* Chain [[58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73],75]: 16*it(58)+0
  Such that:aux(7) =< G
it(58) =< aux(7)

  with precondition: [K2=2,G>=1] 

* Chain [[58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73],74]: 16*it(58)+0
  Such that:aux(8) =< G
it(58) =< aux(8)

  with precondition: [K2=6,N2=0,Q2=0,R2=0,S2=U2,G>=1] 

* Chain [75]: 0
  with precondition: [K2=2] 

* Chain [74]: 0
  with precondition: [K2=6,Q2=0,R2=0,L2=A,M2=F,O2=H,P2=I,G=N2,U2=S2,0>=G] 


#### Cost of chains of f100(O,R,M1,N1,O1,P1,Q1,R1,K2,L2,M2,N2,O2,P2,Q2,R2,S2):
* Chain [[76],78]: 1*it(76)+0
  Such that:it(76) =< M1

  with precondition: [K2=2,M1>=1] 

* Chain [[76],77]: 1*it(76)+0
  Such that:it(76) =< M1

  with precondition: [K2=5,L2=0,M2=0,N2=0,P2=S2,M1>=1] 

* Chain [78]: 0
  with precondition: [K2=2] 

* Chain [77]: 0
  with precondition: [K2=5,L2=0,M2=0,P2=O1,Q2=P1,R2=Q1,S2=R1,M1=N2,0>=M1] 


#### Cost of chains of f130(J,O,R,S,T,U,V,X,B1,H1,I1,J1,K1,L1,K2,L2,M2,N2,O2,P2,Q2,R2,S2,T2,U2,V2,W2,X2,Y2):
* Chain [[79,80]]...: 2*it(79)+0
  with precondition: [] 

* Chain [[79,80],82]: 2*it(79)+0
  with precondition: [K2=2] 

* Chain [[79,80],81]: 2*it(79)+0
  with precondition: [K2=4,M2=0,N2=0,O2=P2,L2=R2,0>=O2] 

* Chain [82]: 0
  with precondition: [K2=2] 

* Chain [81]: 0
  with precondition: [K2=4,M2=0,N2=0,S2=X,T2=B1,U2=H1,V2=I1,W2=J1,X2=K1,Y2=L1,R2=L2,O2=P2,0>=O2] 


#### Cost of chains of f190(J,K,L,M,N,O,P,Q,K2,L2,M2,N2,O2,P2,Q2,R2,S2):
* Chain [[83],85]: 1*it(83)+0
  Such that:it(83) =< J

  with precondition: [N=0,Q=0,K2=2,1>=K,J>=1,K>=0] 

* Chain [[83],84]: 1*it(83)+0
  Such that:it(83) =< J

  with precondition: [N=0,Q=0,K2=3,L2=0,M2=1,N2=2,O2=1,P2=0,Q2=0,S2=1,1>=K,J>=1,K>=0] 

* Chain [85]: 0
  with precondition: [N=0,Q=0,K2=2,1>=K,K>=0] 

* Chain [84]: 0
  with precondition: [N=0,Q=0,K2=3,P2=0,Q2=0,S2=1,N2=L,O2=M,J=L2,K=M2,0>=J,1>=K,K>=0] 


#### Cost of chains of f209(K2):
* Chain [[86]]...: 1*it(86)+0
  with precondition: [K2=2] 

* Chain [[86],87]: 1*it(86)+0
  with precondition: [K2=2] 

* Chain [87]: 0
  with precondition: [K2=2] 


#### Cost of chains of f190_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2):
* Chain [90]...: 1*s(3)+0
  with precondition: [A=3,Y1=0,Z1=0,C2=0] 

* Chain [89]: 0
  with precondition: [A=2,Y1=0,Z1=0,C2=0] 

* Chain [88]: 1*s(4)+0
  with precondition: [A=3,Y1=0,Z1=0,C2=0] 


#### Cost of chains of f130_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2):
* Chain [96]...: 1*s(5)+0
  with precondition: [A=4,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,0>=K] 

* Chain [95]...: 1*s(6)+1*s(7)+0
  Such that:s(6) =< K

  with precondition: [A=4,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,K>=1] 

* Chain [94]: 0
  with precondition: [A=2,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 

* Chain [93]: 0
  with precondition: [A=4,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 

* Chain [92]: 1*s(8)+0
  with precondition: [A=4,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,0>=K] 

* Chain [91]: 2*s(9)+1*s(11)+0
  Such that:aux(11) =< K
s(9) =< aux(11)

  with precondition: [A=4,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,K>=1] 


#### Cost of chains of f100_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2):
* Chain [99]...: 1*aux(12)+0
  with precondition: [A=5,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 

* Chain [98]: 0
  with precondition: [A=2,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 

* Chain [97]: 1*aux(13)+0
  with precondition: [A=5,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 


#### Cost of chains of f65_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2):
* Chain [105]...: 1*s(45)+0
  with precondition: [A=6,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,0>=N1] 

* Chain [104]...: 1*s(46)+1*s(47)+0
  Such that:s(46) =< N1

  with precondition: [A=6,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,N1>=1] 

* Chain [103]: 0
  with precondition: [A=2,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 

* Chain [102]: 0
  with precondition: [A=6,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 

* Chain [101]: 1*s(48)+0
  with precondition: [A=6,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,0>=N1] 

* Chain [100]: 2*s(49)+1*s(51)+0
  Such that:aux(14) =< N1
s(49) =< aux(14)

  with precondition: [A=6,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,N1>=1] 


#### Cost of chains of f34_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2):
* Chain [111]...: 1*aux(15)+0
  with precondition: [A=7,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,0>=H] 

* Chain [110]...: 32*s(56)+3*s(57)+0
  Such that:aux(16) =< H
s(56) =< aux(16)

  with precondition: [A=7,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,H>=1] 

* Chain [109]: 0
  with precondition: [A=2,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 

* Chain [108]: 0
  with precondition: [A=7,L=0,O=0,R=0,Y1=0,Z1=0,C2=0] 

* Chain [107]: 1*aux(17)+0
  with precondition: [A=7,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,0>=H] 

* Chain [106]: 64*s(67)+4*s(72)+0
  Such that:aux(18) =< H
s(67) =< aux(18)

  with precondition: [A=7,L=0,O=0,R=0,Y1=0,Z1=0,C2=0,H>=1] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,K2):
* Chain [113]: 1*aux(19)+0
  with precondition: [] 

* Chain [112]...: 1*aux(20)+0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,K2): 
-------------------------------------
* Chain [113] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [112]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1,S1,T1,U1,V1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,K2): inf 
Asymptotic class: infinity 
* Total analysis performed in 5022 ms.