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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [f31/23,f42/23]
1. non_recursive  : [exit_location/1]
2. recursive  : [f67/17,f77/17,f81/17,f83/17]
3. recursive  : [f104/23]
4. recursive  : [f144/57,f172/57]
5. recursive  : [f211/21]
6. recursive  : [f237/1]
7. non_recursive  : [f237_loop_cont/2]
8. non_recursive  : [f211_loop_cont/66]
9. non_recursive  : [f144_loop_cont/66]
10. non_recursive  : [f104_loop_cont/66]
11. non_recursive  : [f67_loop_cont/66]
12. non_recursive  : [f31_loop_cont/66]
13. non_recursive  : [f0/65]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f31/23
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f67/17
3. SCC is partially evaluated into f104/23
4. SCC is partially evaluated into f144/57
5. SCC is partially evaluated into f211/21
6. SCC is partially evaluated into f237/1
7. SCC is completely evaluated into other SCCs
8. SCC is partially evaluated into f211_loop_cont/66
9. SCC is partially evaluated into f144_loop_cont/66
10. SCC is partially evaluated into f104_loop_cont/66
11. SCC is partially evaluated into f67_loop_cont/66
12. SCC is partially evaluated into f31_loop_cont/66
13. SCC is partially evaluated into f0/65

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

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


### Cost equations --> "Loop" of f31/23 
* CEs [55] --> Loop 52 
* CEs [56] --> Loop 53 
* CEs [57] --> Loop 54 
* CEs [58] --> Loop 55 
* CEs [59] --> Loop 56 
* CEs [53] --> Loop 57 
* CEs [54] --> Loop 58 

### Ranking functions of CR f31(B,C,D,E,F,H,S,V,D2,E2,F2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 
* RF of phase [52,53,54,55,56]: [B]

#### Partial ranking functions of CR f31(B,C,D,E,F,H,S,V,D2,E2,F2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 
* Partial RF of phase [52,53,54,55,56]:
  - RF of loop [52:1,53:1,54:1,55:1,56:1]:
    B


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


### Cost equations --> "Loop" of f67/17 
* 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 [77] --> Loop 74 
* CEs [60] --> Loop 75 
* CEs [61] --> Loop 76 

### Ranking functions of CR f67(A,G,H,I,J,S,V,C2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2) 
* RF of phase [59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74]: [H]

#### Partial ranking functions of CR f67(A,G,H,I,J,S,V,C2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2) 
* Partial RF of phase [59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74]:
  - RF of loop [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,74:1]:
    H


### Specialization of cost equations f104/23 
* CE 32 is refined into CE [78] 
* CE 34 is refined into CE [79] 
* CE 33 is refined into CE [80] 


### Cost equations --> "Loop" of f104/23 
* CEs [80] --> Loop 77 
* CEs [78] --> Loop 78 
* CEs [79] --> Loop 79 

### Ranking functions of CR f104(S,U,V,U1,V1,W1,X1,Y1,Z1,A2,B2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 

#### Partial ranking functions of CR f104(S,U,V,U1,V1,W1,X1,Y1,Z1,A2,B2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3) 


### Specialization of cost equations f144/57 
* CE 39 is refined into CE [81] 
* CE 42 is refined into CE [82] 
* CE 40 is refined into CE [83] 
* CE 41 is refined into CE [84] 
* CE 37 is refined into CE [85] 
* CE 38 is refined into CE [86] 


### Cost equations --> "Loop" of f144/57 
* CEs [83] --> Loop 80 
* CEs [84] --> Loop 81 
* CEs [85] --> Loop 82 
* CEs [86] --> Loop 83 
* CEs [81] --> Loop 84 
* CEs [82] --> Loop 85 

### Ranking functions of CR f144(K,S,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,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3) 
* RF of phase [80,81,82,83]: [U]

#### Partial ranking functions of CR f144(K,S,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,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3) 
* Partial RF of phase [80,81,82,83]:
  - RF of loop [80:1,81:1,82:1,83:1]:
    U


### Specialization of cost equations f211/21 
* CE 47 is refined into CE [87] 
* CE 48 is refined into CE [88] 
* CE 46 is refined into CE [89] 
* CE 45 is refined into CE [90] 


### Cost equations --> "Loop" of f211/21 
* CEs [89] --> Loop 86 
* CEs [90] --> Loop 87 
* CEs [87] --> Loop 88 
* CEs [88] --> Loop 89 

### Ranking functions of CR f211(K,L,M,N,O,P,Q,R,S,T,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3) 

#### Partial ranking functions of CR f211(K,L,M,N,O,P,Q,R,S,T,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3) 
* Partial RF of phase [86,87]:
  - RF of loop [86:1]:
    K


### Specialization of cost equations f237/1 
* CE 52 is refined into CE [91] 
* CE 51 is refined into CE [92] 


### Cost equations --> "Loop" of f237/1 
* CEs [92] --> Loop 90 
* CEs [91] --> Loop 91 

### Ranking functions of CR f237(R2) 

#### Partial ranking functions of CR f237(R2) 


### Specialization of cost equations f211_loop_cont/66 
* CE 50 is refined into CE [93,94] 
* CE 49 is refined into CE [95] 


### Cost equations --> "Loop" of f211_loop_cont/66 
* CEs [93] --> Loop 92 
* CEs [95] --> Loop 93 
* CEs [94] --> Loop 94 

### Ranking functions of CR f211_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,I2,J2,K2,L2,M2,N2) 

#### Partial ranking functions of CR f211_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,I2,J2,K2,L2,M2,N2) 


### Specialization of cost equations f144_loop_cont/66 
* CE 44 is refined into CE [96,97,98,99,100,101,102,103,104] 
* CE 43 is refined into CE [105] 


### Cost equations --> "Loop" of f144_loop_cont/66 
* CEs [97,98] --> Loop 95 
* CEs [100] --> Loop 96 
* CEs [96] --> Loop 97 
* CEs [105] --> Loop 98 
* CEs [99,102,103,104] --> Loop 99 
* CEs [101] --> Loop 100 

### Ranking functions of CR f144_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,I2,J2,K2,L2,M2,N2) 

#### Partial ranking functions of CR f144_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,I2,J2,K2,L2,M2,N2) 


### Specialization of cost equations f104_loop_cont/66 
* CE 36 is refined into CE [106,107,108,109,110,111,112,113,114,115,116,117] 
* CE 35 is refined into CE [118] 


### Cost equations --> "Loop" of f104_loop_cont/66 
* CEs [107,108,109,110] --> Loop 101 
* CEs [113,114,115] --> Loop 102 
* CEs [106] --> Loop 103 
* CEs [118] --> Loop 104 
* CEs [111,112] --> Loop 105 
* CEs [116,117] --> Loop 106 

### Ranking functions of CR f104_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,I2,J2,K2,L2,M2,N2) 

#### Partial ranking functions of CR f104_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,I2,J2,K2,L2,M2,N2) 


### Specialization of cost equations f67_loop_cont/66 
* CE 31 is refined into CE [119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135] 
* CE 30 is refined into CE [136] 


### Cost equations --> "Loop" of f67_loop_cont/66 
* CEs [119,120,121,122,125,126,127] --> Loop 107 
* CEs [136] --> Loop 108 
* CEs [123,124,128,129,130,131,132,133,134,135] --> Loop 109 

### Ranking functions of CR f67_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,I2,J2,K2,L2,M2,N2) 

#### Partial ranking functions of CR f67_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,I2,J2,K2,L2,M2,N2) 


### Specialization of cost equations f31_loop_cont/66 
* CE 11 is refined into CE [137,138,139,140,141,142] 
* CE 10 is refined into CE [143] 


### Cost equations --> "Loop" of f31_loop_cont/66 
* CEs [138,139] --> Loop 110 
* CEs [141] --> Loop 111 
* CEs [137] --> Loop 112 
* CEs [143] --> Loop 113 
* CEs [140] --> Loop 114 
* CEs [142] --> Loop 115 

### Ranking functions of CR f31_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,I2,J2,K2,L2,M2,N2) 

#### Partial ranking functions of CR f31_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,I2,J2,K2,L2,M2,N2) 


### Specialization of cost equations f0/65 
* CE 1 is refined into CE [144,145,146,147,148,149,150,151,152,153,154,155] 
* CE 2 is refined into CE [156,157,158,159,160,161,162,163,164,165,166,167] 


### Cost equations --> "Loop" of f0/65 
* CEs [149,150,154,155,161,162,166,167] --> Loop 116 
* CEs [144,145,146,147,148,151,152,153,156,157,158,159,160,163,164,165] --> Loop 117 

### 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,G2,H2,I2,J2,K2,L2,R2) 

#### 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,G2,H2,I2,J2,K2,L2,R2) 


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

#### Cost of chains of f31(B,C,D,E,F,H,S,V,D2,E2,F2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3):
* Chain [[52,53,54,55,56],58]: 5*it(52)+0
  Such that:aux(3) =< B
it(52) =< aux(3)

  with precondition: [S=0,V=0,R2=2,B>=1] 

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

  with precondition: [S=0,V=0,R2=7,S2=0,Y2=0,Z2=0,T2=U2,X2=C3,B>=1] 

* Chain [58]: 0
  with precondition: [S=0,V=0,R2=2] 

* Chain [57]: 0
  with precondition: [S=0,V=0,R2=7,Y2=0,Z2=0,T2=C,U2=D,V2=E,W2=F,A3=D2,B=S2,C3=X2,0>=B] 


#### Cost of chains of f67(A,G,H,I,J,S,V,C2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2):
* Chain [[59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74],76]: 16*it(59)+0
  Such that:aux(7) =< H
it(59) =< aux(7)

  with precondition: [R2=2,H>=1] 

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

  with precondition: [R2=6,U2=0,X2=0,Y2=0,H>=1] 

* Chain [76]: 0
  with precondition: [R2=2] 

* Chain [75]: 0
  with precondition: [R2=6,X2=0,Y2=0,S2=A,T2=G,V2=I,W2=J,H=U2,0>=H] 


#### Cost of chains of f104(S,U,V,U1,V1,W1,X1,Y1,Z1,A2,B2,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3):
* Chain [[77]]...: 1*it(77)+0
  with precondition: [] 

* Chain [[77],79]: 1*it(77)+0
  with precondition: [R2=2] 

* Chain [[77],78]: 1*it(77)+0
  with precondition: [R2=5,S2=0,U2=0,V2=W2,T2=Y2,Z2=C3,0>=V2] 

* Chain [79]: 0
  with precondition: [R2=2] 

* Chain [78]: 0
  with precondition: [R2=5,S2=0,U2=0,Z2=Y1,A3=Z1,B3=A2,C3=B2,Y2=T2,V2=W2,0>=V2] 


#### Cost of chains of f144(K,S,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,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3,C3,D3,E3,F3,G3,H3,I3,J3,K3,L3,M3,N3,O3,P3,Q3,R3,S3,T3):
* Chain [[80,81,82,83],85]: 4*it(80)+0
  Such that:aux(12) =< U
it(80) =< aux(12)

  with precondition: [Z=0,R2=2,U>=1] 

* Chain [[80,81,82,83],84]: 4*it(80)+0
  Such that:aux(13) =< U
it(80) =< aux(13)

  with precondition: [Z=0,R2=4,T2=0,U2=0,V2=0,Z2=0,S2=X2,B1=B3,C1=C3,D1=D3,F1=F3,G1=G3,H1=H3,I1=I3,K3=L3,U>=1] 

* Chain [85]: 0
  with precondition: [Z=0,R2=2] 

* Chain [84]: 0
  with precondition: [Z=0,R2=4,T2=0,V2=0,Z2=0,Y2=Y,A3=A1,B3=B1,C3=C1,D3=D1,E3=E1,F3=F1,G3=G1,H3=H1,I3=I1,J3=J1,K3=K1,L3=L1,M3=M1,N3=N1,O3=O1,P3=P1,Q3=Q1,R3=R1,S3=S1,T3=T1,X2=S2,U=U2,0>=U] 


#### Cost of chains of f211(K,L,M,N,O,P,Q,R,S,T,R2,S2,T2,U2,V2,W2,X2,Y2,Z2,A3,B3):
* Chain [[86,87]]...: 1*it(86)+1*it(87)+0
  Such that:it(86) =< K

  with precondition: [K>=1] 

* Chain [[86,87],89]: 1*it(86)+1*it(87)+0
  Such that:it(86) =< K

  with precondition: [R2=2,K>=1] 

* Chain [[86,87],88]: 1*it(86)+1*it(87)+0
  Such that:it(86) =< K

  with precondition: [R2=3,S2=0,T2=0,W2=0,X2=0,Y2=2,A3=0,U2=Z2,K>=1,V2>=1] 

* Chain [89]: 0
  with precondition: [R2=2] 

* Chain [88]: 0
  with precondition: [R2=3,A3=0,T2=L,U2=M,V2=N,W2=O,X2=P,Y2=Q,Z2=R,K=S2,0>=K] 


#### Cost of chains of f237(R2):
* Chain [[90]]...: 1*it(90)+0
  with precondition: [R2=2] 

* Chain [[90],91]: 1*it(90)+0
  with precondition: [R2=2] 

* Chain [91]: 0
  with precondition: [R2=2] 


#### Cost of chains of f211_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,I2,J2,K2,L2,M2,N2):
* Chain [94]...: 1*s(3)+0
  with precondition: [A=3,I2=0] 

* Chain [93]: 0
  with precondition: [A=2,I2=0] 

* Chain [92]: 1*s(4)+0
  with precondition: [A=3,I2=0] 


#### Cost of chains of f144_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,I2,J2,K2,L2,M2,N2):
* Chain [100]...: 1*s(5)+0
  with precondition: [A=4,I2=0,0>=L] 

* Chain [99]...: 4*s(6)+7*s(7)+0
  Such that:aux(15) =< L
s(6) =< aux(15)

  with precondition: [A=4,I2=0,L>=1] 

* Chain [98]: 0
  with precondition: [A=2,I2=0] 

* Chain [97]: 0
  with precondition: [A=4,I2=0] 

* Chain [96]: 1*s(17)+0
  with precondition: [A=4,I2=0,0>=L] 

* Chain [95]: 2*s(18)+3*s(19)+0
  Such that:aux(16) =< L
s(18) =< aux(16)

  with precondition: [A=4,I2=0,L>=1] 


#### Cost of chains of f104_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,I2,J2,K2,L2,M2,N2):
* Chain [106]...: 1*aux(17)+0
  with precondition: [A=5,A1=0,I2=0,0>=V] 

* Chain [105]...: 8*s(28)+12*s(29)+0
  Such that:aux(18) =< V
s(28) =< aux(18)

  with precondition: [A=5,A1=0,I2=0,V>=1] 

* Chain [104]: 0
  with precondition: [A=2,A1=0,I2=0] 

* Chain [103]: 0
  with precondition: [A=5,A1=0,I2=0] 

* Chain [102]: 1*aux(19)+0
  with precondition: [A=5,A1=0,I2=0,0>=V] 

* Chain [101]: 16*s(40)+6*s(45)+0
  Such that:aux(20) =< V
s(40) =< aux(20)

  with precondition: [A=5,A1=0,I2=0,V>=1] 


#### Cost of chains of f67_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,I2,J2,K2,L2,M2,N2):
* Chain [109]...: 1*aux(21)+0
  with precondition: [A=6,A1=0,I2=0] 

* Chain [108]: 0
  with precondition: [A=2,A1=0,I2=0] 

* Chain [107]: 1*aux(22)+0
  with precondition: [A=6,A1=0,I2=0] 


#### Cost of chains of f31_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,I2,J2,K2,L2,M2,N2):
* Chain [115]...: 1*s(87)+0
  with precondition: [A=7,A1=0,I2=0,0>=I] 

* Chain [114]...: 16*s(89)+1*s(90)+0
  Such that:s(88) =< I
s(89) =< s(88)

  with precondition: [A=7,A1=0,I2=0,I>=1] 

* Chain [113]: 0
  with precondition: [A=2,A1=0,I2=0] 

* Chain [112]: 0
  with precondition: [A=7,A1=0,I2=0] 

* Chain [111]: 1*s(91)+0
  with precondition: [A=7,A1=0,I2=0,0>=I] 

* Chain [110]: 32*s(93)+1*s(96)+0
  Such that:aux(23) =< I
s(93) =< aux(23)

  with precondition: [A=7,A1=0,I2=0,I>=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,G2,H2,I2,J2,K2,L2,R2):
* Chain [117]: 1*aux(24)+0
  with precondition: [] 

* Chain [116]...: 1*aux(25)+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,G2,H2,I2,J2,K2,L2,R2): 
-------------------------------------
* Chain [117] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [116]... 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,G2,H2,I2,J2,K2,L2,R2): inf 
Asymptotic class: infinity 
* Total analysis performed in 6294 ms.