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

#### Computed strongly connected components 
0. recursive  : [f422/15]
1. non_recursive  : [exit_location/1]
2. recursive  : [f441/7]
3. recursive  : [f437/9,f441_loop_cont/10]
4. recursive  : [f461/17]
5. recursive  : [f455/23,f461_loop_cont/24]
6. recursive  : [f485/13]
7. recursive  : [f501/22]
8. recursive  : [f526/14]
9. recursive  : [f546/5]
10. recursive  : [f543/13,f546_loop_cont/14]
11. recursive  : [f540/13,f543_loop_cont/14]
12. non_recursive  : [f584/43]
13. non_recursive  : [f540_loop_cont/44]
14. non_recursive  : [f526_loop_cont/44]
15. non_recursive  : [f501_loop_cont/44]
16. non_recursive  : [f485_loop_cont/44]
17. non_recursive  : [f455_loop_cont/44]
18. non_recursive  : [f437_loop_cont/44]
19. non_recursive  : [f422_loop_cont/44]
20. non_recursive  : [f0/43]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f422/15
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f441/7
3. SCC is partially evaluated into f437/9
4. SCC is partially evaluated into f461/17
5. SCC is partially evaluated into f455/23
6. SCC is partially evaluated into f485/13
7. SCC is partially evaluated into f501/22
8. SCC is partially evaluated into f526/14
9. SCC is partially evaluated into f546/5
10. SCC is partially evaluated into f543/13
11. SCC is partially evaluated into f540/13
12. SCC is completely evaluated into other SCCs
13. SCC is partially evaluated into f540_loop_cont/44
14. SCC is partially evaluated into f526_loop_cont/44
15. SCC is partially evaluated into f501_loop_cont/44
16. SCC is partially evaluated into f485_loop_cont/44
17. SCC is partially evaluated into f455_loop_cont/44
18. SCC is partially evaluated into f437_loop_cont/44
19. SCC is partially evaluated into f422_loop_cont/44
20. SCC is partially evaluated into f0/43

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

### Specialization of cost equations f422/15 
* CE 3 is refined into CE [53] 
* CE 4 is refined into CE [54] 
* CE 2 is refined into CE [55] 


### Cost equations --> "Loop" of f422/15 
* CEs [55] --> Loop 53 
* CEs [53] --> Loop 54 
* CEs [54] --> Loop 55 

### Ranking functions of CR f422(A,C,D,E,F,O1,P1,W1,X1,Y1,Z1,A2,B2,C2,D2) 
* RF of phase [53]: [-E+150]

#### Partial ranking functions of CR f422(A,C,D,E,F,O1,P1,W1,X1,Y1,Z1,A2,B2,C2,D2) 
* Partial RF of phase [53]:
  - RF of loop [53:1]:
    -E+150


### Specialization of cost equations f441/7 
* CE 14 is refined into CE [56] 
* CE 15 is refined into CE [57] 
* CE 13 is refined into CE [58] 


### Cost equations --> "Loop" of f441/7 
* CEs [58] --> Loop 56 
* CEs [56] --> Loop 57 
* CEs [57] --> Loop 58 

### Ranking functions of CR f441(F,G,H,W1,X1,Y1,Z1) 
* RF of phase [56]: [-H+50]

#### Partial ranking functions of CR f441(F,G,H,W1,X1,Y1,Z1) 
* Partial RF of phase [56]:
  - RF of loop [56:1]:
    -H+50


### Specialization of cost equations f437/9 
* CE 9 is refined into CE [59] 
* CE 7 is refined into CE [60,61] 
* CE 10 is refined into CE [62] 
* CE 8 is refined into CE [63] 


### Cost equations --> "Loop" of f437/9 
* CEs [63] --> Loop 59 
* CEs [59] --> Loop 60 
* CEs [60,61] --> Loop 61 
* CEs [62] --> Loop 62 

### Ranking functions of CR f437(F,G,H,I,W1,X1,Y1,Z1,A2) 
* RF of phase [59]: [-F+50]

#### Partial ranking functions of CR f437(F,G,H,I,W1,X1,Y1,Z1,A2) 
* Partial RF of phase [59]:
  - RF of loop [59:1]:
    -F+50


### Specialization of cost equations f461/17 
* CE 23 is refined into CE [64] 
* CE 24 is refined into CE [65] 
* CE 22 is refined into CE [66] 


### Cost equations --> "Loop" of f461/17 
* CEs [66] --> Loop 63 
* CEs [64] --> Loop 64 
* CEs [65] --> Loop 65 

### Ranking functions of CR f461(I,J,K,L,M,N,O,P,W1,X1,Y1,Z1,A2,B2,C2,D2,E2) 
* RF of phase [63]: [-M/2+16]

#### Partial ranking functions of CR f461(I,J,K,L,M,N,O,P,W1,X1,Y1,Z1,A2,B2,C2,D2,E2) 
* Partial RF of phase [63]:
  - RF of loop [63:1]:
    -M/2+16


### Specialization of cost equations f455/23 
* CE 18 is refined into CE [67] 
* CE 16 is refined into CE [68,69] 
* CE 19 is refined into CE [70] 
* CE 17 is refined into CE [71] 


### Cost equations --> "Loop" of f455/23 
* CEs [71] --> Loop 66 
* CEs [67] --> Loop 67 
* CEs [68,69] --> Loop 68 
* CEs [70] --> Loop 69 

### Ranking functions of CR f455(I,J,K,L,M,N,O,P,Q,R,N1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 
* RF of phase [66]: [-I/2+50]

#### Partial ranking functions of CR f455(I,J,K,L,M,N,O,P,Q,R,N1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2) 
* Partial RF of phase [66]:
  - RF of loop [66:1]:
    -I/2+50


### Specialization of cost equations f485/13 
* CE 26 is refined into CE [72] 
* CE 27 is refined into CE [73] 
* CE 25 is refined into CE [74] 


### Cost equations --> "Loop" of f485/13 
* CEs [74] --> Loop 70 
* CEs [72] --> Loop 71 
* CEs [73] --> Loop 72 

### Ranking functions of CR f485(B,Q,R,S,T,M1,W1,X1,Y1,Z1,A2,B2,C2) 
* RF of phase [70]: [Q+1]

#### Partial ranking functions of CR f485(B,Q,R,S,T,M1,W1,X1,Y1,Z1,A2,B2,C2) 
* Partial RF of phase [70]:
  - RF of loop [70:1]:
    Q+1


### Specialization of cost equations f501/22 
* CE 31 is refined into CE [75] 
* CE 32 is refined into CE [76] 
* CE 30 is refined into CE [77] 


### Cost equations --> "Loop" of f501/22 
* CEs [77] --> Loop 73 
* CEs [75] --> Loop 74 
* CEs [76] --> Loop 75 

### Ranking functions of CR f501(S,T,U,V,W,E1,G1,H1,I1,J1,K1,L1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2) 
* RF of phase [73]: [-S+50]

#### Partial ranking functions of CR f501(S,T,U,V,W,E1,G1,H1,I1,J1,K1,L1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2) 
* Partial RF of phase [73]:
  - RF of loop [73:1]:
    -S+50


### Specialization of cost equations f526/14 
* CE 36 is refined into CE [78] 
* CE 37 is refined into CE [79] 
* CE 35 is refined into CE [80] 


### Cost equations --> "Loop" of f526/14 
* CEs [80] --> Loop 76 
* CEs [78] --> Loop 77 
* CEs [79] --> Loop 78 

### Ranking functions of CR f526(V,W,X,A1,B1,C1,D1,F1,W1,X1,Y1,Z1,A2,B2) 
* RF of phase [76]: [V-W+1]

#### Partial ranking functions of CR f526(V,W,X,A1,B1,C1,D1,F1,W1,X1,Y1,Z1,A2,B2) 
* Partial RF of phase [76]:
  - RF of loop [76:1]:
    V-W+1


### Specialization of cost equations f546/5 
* CE 52 is refined into CE [81] 
* CE 51 is refined into CE [82] 
* CE 50 is refined into CE [83] 


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

### Ranking functions of CR f546(Y,Z,W1,X1,Y1) 
* RF of phase [79]: [-Z+4]

#### Partial ranking functions of CR f546(Y,Z,W1,X1,Y1) 
* Partial RF of phase [79]:
  - RF of loop [79:1]:
    -Z+4


### Specialization of cost equations f543/13 
* CE 48 is refined into CE [84] 
* CE 46 is refined into CE [85,86] 
* CE 49 is refined into CE [87] 
* CE 47 is refined into CE [88] 


### Cost equations --> "Loop" of f543/13 
* CEs [88] --> Loop 82 
* CEs [84] --> Loop 83 
* CEs [85,86] --> Loop 84 
* CEs [87] --> Loop 85 

### Ranking functions of CR f543(X,Y,Z,A1,B1,C1,W1,X1,Y1,Z1,A2,B2,C2) 
* RF of phase [82]: [-Y+8]

#### Partial ranking functions of CR f543(X,Y,Z,A1,B1,C1,W1,X1,Y1,Z1,A2,B2,C2) 
* Partial RF of phase [82]:
  - RF of loop [82:1]:
    -Y+8


### Specialization of cost equations f540/13 
* CE 42 is refined into CE [89] 
* CE 40 is refined into CE [90,91,92] 
* CE 43 is refined into CE [93] 
* CE 41 is refined into CE [94] 


### Cost equations --> "Loop" of f540/13 
* CEs [94] --> Loop 86 
* CEs [89] --> Loop 87 
* CEs [90,91,92] --> Loop 88 
* CEs [93] --> Loop 89 

### Ranking functions of CR f540(X,Y,Z,A1,B1,C1,W1,X1,Y1,Z1,A2,B2,C2) 
* RF of phase [86]: [-X/7+9/7]

#### Partial ranking functions of CR f540(X,Y,Z,A1,B1,C1,W1,X1,Y1,Z1,A2,B2,C2) 
* Partial RF of phase [86]:
  - RF of loop [86:1]:
    -X/7+9/7


### Specialization of cost equations f540_loop_cont/44 
* CE 44 is refined into CE [95] 
* CE 45 is refined into CE [96] 


### Cost equations --> "Loop" of f540_loop_cont/44 
* CEs [95] --> Loop 90 
* CEs [96] --> Loop 91 

### Ranking functions of CR f540_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) 

#### Partial ranking functions of CR f540_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) 


### Specialization of cost equations f526_loop_cont/44 
* CE 39 is refined into CE [97,98,99,100,101] 
* CE 38 is refined into CE [102] 


### Cost equations --> "Loop" of f526_loop_cont/44 
* CEs [101] --> Loop 92 
* CEs [99] --> Loop 93 
* CEs [98,100] --> Loop 94 
* CEs [97] --> Loop 95 
* CEs [102] --> Loop 96 

### Ranking functions of CR f526_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) 

#### Partial ranking functions of CR f526_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) 


### Specialization of cost equations f501_loop_cont/44 
* CE 34 is refined into CE [103,104,105,106,107,108,109,110] 
* CE 33 is refined into CE [111] 


### Cost equations --> "Loop" of f501_loop_cont/44 
* CEs [104,105,106,107] --> Loop 97 
* CEs [108,109,110] --> Loop 98 
* CEs [103] --> Loop 99 
* CEs [111] --> Loop 100 

### Ranking functions of CR f501_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) 

#### Partial ranking functions of CR f501_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) 


### Specialization of cost equations f485_loop_cont/44 
* CE 29 is refined into CE [112,113,114,115,116,117] 
* CE 28 is refined into CE [118] 


### Cost equations --> "Loop" of f485_loop_cont/44 
* CEs [116,117] --> Loop 101 
* CEs [113,114,115] --> Loop 102 
* CEs [112] --> Loop 103 
* CEs [118] --> Loop 104 

### Ranking functions of CR f485_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) 

#### Partial ranking functions of CR f485_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) 


### Specialization of cost equations f455_loop_cont/44 
* CE 21 is refined into CE [119,120,121,122,123,124] 
* CE 20 is refined into CE [125] 


### Cost equations --> "Loop" of f455_loop_cont/44 
* CEs [120,121,122] --> Loop 105 
* CEs [123,124] --> Loop 106 
* CEs [119] --> Loop 107 
* CEs [125] --> Loop 108 

### Ranking functions of CR f455_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) 

#### Partial ranking functions of CR f455_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) 


### Specialization of cost equations f437_loop_cont/44 
* CE 12 is refined into CE [126,127,128,129,130,131,132] 
* CE 11 is refined into CE [133] 


### Cost equations --> "Loop" of f437_loop_cont/44 
* CEs [129,130] --> Loop 109 
* CEs [128] --> Loop 110 
* CEs [127,131,132] --> Loop 111 
* CEs [126] --> Loop 112 
* CEs [133] --> Loop 113 

### Ranking functions of CR f437_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) 

#### Partial ranking functions of CR f437_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) 


### Specialization of cost equations f422_loop_cont/44 
* CE 6 is refined into CE [134,135,136,137,138,139,140,141,142] 
* CE 5 is refined into CE [143] 


### Cost equations --> "Loop" of f422_loop_cont/44 
* CEs [140,141,142] --> Loop 114 
* CEs [136] --> Loop 115 
* CEs [135,137,138,139] --> Loop 116 
* CEs [134] --> Loop 117 
* CEs [143] --> Loop 118 

### Ranking functions of CR f422_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) 

#### Partial ranking functions of CR f422_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) 


### Specialization of cost equations f0/43 
* CE 1 is refined into CE [144,145,146,147,148] 


### Cost equations --> "Loop" of f0/43 
* CEs [144,145,146,147,148] --> Loop 119 

### 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,W1) 

#### 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,W1) 


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

#### Cost of chains of f422(A,C,D,E,F,O1,P1,W1,X1,Y1,Z1,A2,B2,C2,D2):
* Chain [[53],55]: 1*it(53)+0
  Such that:it(53) =< -E+150

  with precondition: [A=3,W1=3,149>=E,E>=0] 

* Chain [[53],54]: 1*it(53)+0
  Such that:it(53) =< -E+150

  with precondition: [A=3,W1=6,A2=150,B2=0,X1=Y1,X1=C2,X1=D2,149>=E,E>=0] 

* Chain [55]: 0
  with precondition: [A=3,W1=3,E>=0] 


#### Cost of chains of f441(F,G,H,W1,X1,Y1,Z1):
* Chain [[56],58]: 1*it(56)+0
  Such that:it(56) =< -H+50

  with precondition: [W1=3,49>=F,49>=H,H>=0] 

* Chain [[56],57]: 1*it(56)+0
  Such that:it(56) =< -H+50

  with precondition: [W1=6,Z1=50,F+1=X1,49>=F,49>=H,H>=0] 

* Chain [58]: 0
  with precondition: [W1=3,49>=F,H>=0] 


#### Cost of chains of f437(F,G,H,I,W1,X1,Y1,Z1,A2):
* Chain [[59],62]: 1*it(59)+1*s(3)+0
  Such that:aux(4) =< -F+50
it(59) =< aux(4)
s(3) =< aux(4)*50

  with precondition: [W1=3,49>=F] 

* Chain [[59],61]: 1*it(59)+1*s(3)+50
  Such that:aux(3) =< -F+49
aux(2) =< -F+50
aux(1) =< aux(2)
it(59) =< aux(2)
aux(1) =< aux(3)
it(59) =< aux(3)
s(3) =< aux(1)*50

  with precondition: [W1=3,48>=F] 

* Chain [[59],60]: 1*it(59)+1*s(3)+0
  Such that:aux(5) =< -F+50
it(59) =< aux(5)
s(3) =< aux(5)*50

  with precondition: [W1=5,X1=50,Z1=50,A2=0,49>=F] 

* Chain [62]: 0
  with precondition: [W1=3] 

* Chain [61]: 50
  with precondition: [W1=3,49>=F] 

* Chain [60]: 0
  with precondition: [W1=5,A2=0,Y1=G,Z1=H,F=X1,F>=50] 


#### Cost of chains of f461(I,J,K,L,M,N,O,P,W1,X1,Y1,Z1,A2,B2,C2,D2,E2):
* Chain [[63],65]: 1*it(63)+0
  Such that:it(63) =< -M/2+16

  with precondition: [W1=3,99>=I,31>=M,M>=0] 

* Chain [[63],64]: 1*it(63)+0
  Such that:it(63) =< -M/2+16

  with precondition: [W1=5,I+2=X1,99>=I,33>=B2,M>=0,B2>=32,B2>=M+2] 

* Chain [65]: 0
  with precondition: [W1=3,99>=I,M>=0] 


#### Cost of chains of f455(I,J,K,L,M,N,O,P,Q,R,N1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2,G2,H2):
* Chain [[66],69]: 1*it(66)+1*s(10)+0
  Such that:aux(7) =< -I/2+50
aux(8) =< -I/2+101/2
aux(6) =< aux(7)
it(66) =< aux(7)
aux(6) =< aux(8)
it(66) =< aux(8)
s(10) =< aux(6)*16

  with precondition: [W1=3,99>=I] 

* Chain [[66],68]: 1*it(66)+1*s(10)+16
  Such that:aux(7) =< -I/2+50
aux(8) =< -I/2+99/2
aux(6) =< aux(7)
it(66) =< aux(7)
aux(6) =< aux(8)
it(66) =< aux(8)
s(10) =< aux(6)*16

  with precondition: [W1=3,97>=I] 

* Chain [[66],67]: 1*it(66)+1*s(10)+0
  Such that:aux(7) =< -I/2+50
aux(8) =< -I/2+X1/2
aux(6) =< aux(7)
it(66) =< aux(7)
aux(6) =< aux(8)
it(66) =< aux(8)
s(10) =< aux(6)*16

  with precondition: [W1=10,F2=98,H2=100,101>=X1,33>=B2,X1>=100,B2>=32,X1>=I+2] 

* Chain [69]: 0
  with precondition: [W1=3] 

* Chain [68]: 16
  with precondition: [W1=3,99>=I] 

* Chain [67]: 0
  with precondition: [W1=10,F2=98,H2=100,Y1=J,Z1=K,A2=L,B2=M,C2=N,D2=O,E2=P,I=X1,I>=100] 


#### Cost of chains of f485(B,Q,R,S,T,M1,W1,X1,Y1,Z1,A2,B2,C2):
* Chain [[70],72]: 1*it(70)+0
  Such that:it(70) =< Q+1

  with precondition: [B=43690,W1=3,Q>=0] 

* Chain [[70],71]: 1*it(70)+0
  Such that:it(70) =< Q+1

  with precondition: [B=43690,W1=9,Y1+1=0,A2=0,X1=Z1,X1=C2,Q>=0] 

* Chain [72]: 0
  with precondition: [B=43690,W1=3] 

* Chain [71]: 0
  with precondition: [B=43690,W1=9,A2=0,R=X1,Q=Y1,R=Z1,R=C2,0>=Q+1] 


#### Cost of chains of f501(S,T,U,V,W,E1,G1,H1,I1,J1,K1,L1,W1,X1,Y1,Z1,A2,B2,C2,D2,E2,F2):
* Chain [[73],75]: 1*it(73)+0
  Such that:it(73) =< -S+50

  with precondition: [W1=3,49>=S] 

* Chain [[73],74]: 1*it(73)+0
  Such that:it(73) =< -S+50

  with precondition: [W1=8,X1=50,A2=17,B2=2,C2=1,E2=1,49>=S] 

* Chain [75]: 0
  with precondition: [W1=3] 

* Chain [74]: 0
  with precondition: [W1=8,A2=17,B2=2,C2=1,E2=1,Y1=T,Z1=U,S=X1,S>=50] 


#### Cost of chains of f526(V,W,X,A1,B1,C1,D1,F1,W1,X1,Y1,Z1,A2,B2):
* Chain [[76],78]: 1*it(76)+0
  Such that:it(76) =< V-W+1

  with precondition: [W1=3,V>=W] 

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

  with precondition: [W1=4,Y1=1,Z1=0,A2=13,B2=8,V+1=X1,V>=W] 

* Chain [78]: 0
  with precondition: [W1=3] 

* Chain [77]: 0
  with precondition: [W1=4,Y1=1,Z1=0,A2=13,B2=8,W=X1,W>=V+1] 


#### Cost of chains of f546(Y,Z,W1,X1,Y1):
* Chain [[79],81]: 1*it(79)+0
  Such that:it(79) =< -Z+4

  with precondition: [W1=2,Y1=4,Y+1=X1,7>=Y,3>=Z,Z>=0] 

* Chain [[79],80]: 1*it(79)+0
  Such that:it(79) =< -Z+4

  with precondition: [W1=3,7>=Y,3>=Z,Z>=0] 

* Chain [80]: 0
  with precondition: [W1=3,7>=Y,Z>=0] 


#### Cost of chains of f543(X,Y,Z,A1,B1,C1,W1,X1,Y1,Z1,A2,B2,C2):
* Chain [[82],85]: 1*it(82)+1*s(19)+0
  Such that:aux(12) =< -Y+8
it(82) =< aux(12)
s(19) =< aux(12)*4

  with precondition: [W1=3,8>=X,7>=Y,Y>=0] 

* Chain [[82],84]: 1*it(82)+1*s(19)+4
  Such that:aux(11) =< -Y+7
aux(10) =< -Y+8
aux(9) =< aux(10)
it(82) =< aux(10)
aux(9) =< aux(11)
it(82) =< aux(11)
s(19) =< aux(9)*4

  with precondition: [W1=3,8>=X,6>=Y,Y>=0] 

* Chain [[82],83]: 1*it(82)+1*s(19)+0
  Such that:aux(13) =< -Y+8
it(82) =< aux(13)
s(19) =< aux(13)*4

  with precondition: [W1=4,Y1=8,Z1=4,X+7=X1,A1+3=A2,B1+3=B2,C1=C2+7,8>=X,7>=Y] 

* Chain [85]: 0
  with precondition: [W1=3,8>=X,Y>=0] 

* Chain [84]: 4
  with precondition: [W1=3,8>=X,7>=Y,Y>=0] 


#### Cost of chains of f540(X,Y,Z,A1,B1,C1,W1,X1,Y1,Z1,A2,B2,C2):
* Chain [[86],89]: 1*it(86)+1*s(30)+1*s(31)+0
  Such that:aux(15) =< -X/7+9/7
aux(16) =< -X/7+15/7
aux(14) =< aux(15)
it(86) =< aux(15)
aux(14) =< aux(16)
it(86) =< aux(16)
s(32) =< aux(14)*8
s(30) =< s(32)
s(31) =< s(32)*4

  with precondition: [W1=3,8>=X] 

* Chain [[86],88]: 1*it(86)+1*s(30)+1*s(31)+84
  Such that:aux(16) =< -X/7+8/7
aux(15) =< -X/7+9/7
aux(14) =< aux(15)
it(86) =< aux(15)
aux(14) =< aux(16)
it(86) =< aux(16)
s(32) =< aux(14)*8
s(30) =< s(32)
s(31) =< s(32)*4

  with precondition: [W1=3,1>=X] 

* Chain [[86],87]: 1*it(86)+1*s(30)+1*s(31)+0
  Such that:aux(15) =< -X/7+9/7
aux(16) =< -B1/3+B2/3
aux(14) =< aux(15)
it(86) =< aux(15)
aux(14) =< aux(16)
it(86) =< aux(16)
s(32) =< aux(14)*8
s(30) =< s(32)
s(31) =< s(32)*4

  with precondition: [W1=7,Y1=8,Z1=4,3*X+7*A2=7*A1+3*X1,3*X+7*B2=7*B1+3*X1,X+C1=X1+C2,15>=X1,X1>=9,X1>=X+7] 

* Chain [89]: 0
  with precondition: [W1=3] 

* Chain [88]: 84
  with precondition: [W1=3,8>=X] 

* Chain [87]: 0
  with precondition: [W1=7,Y1=Y,Z1=Z,A2=A1,B2=B1,C2=C1,X=X1,X>=9] 


#### Cost of chains of f540_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):
* Chain [91]: 0
  with precondition: [A=3,K1=B,E1=C,E1=F1,E1=G1,E1=H1] 

* Chain [90]: 0
  with precondition: [A=7,K1=B,E1=C,E1=F1,E1=G1,E1=H1] 


#### Cost of chains of f526_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):
* Chain [96]: 0
  with precondition: [A=3,K1=B,E1=C,E1=F1,E1=G1,E1=H1] 

* Chain [95]: 0
  with precondition: [A=4,K1=B,E1=C,E1=F1,E1=G1,E1=H1] 

* Chain [94]: 2*s(51)+2*s(53)+2*s(54)+84
  Such that:aux(18) =< -Y/7+9/7
aux(19) =< -Y/7+15/7
s(50) =< aux(18)
s(51) =< aux(18)
s(50) =< aux(19)
s(51) =< aux(19)
s(52) =< s(50)*8
s(53) =< s(52)
s(54) =< s(52)*4

  with precondition: [A=4,K1=B,E1=C,E1=F1,E1=G1,E1=H1,8>=Y] 

* Chain [93]: 1*s(65)+1*s(67)+1*s(68)+84
  Such that:s(62) =< -Y/7+8/7
s(63) =< -Y/7+9/7
s(64) =< s(63)
s(65) =< s(63)
s(64) =< s(62)
s(65) =< s(62)
s(66) =< s(64)*8
s(67) =< s(66)
s(68) =< s(66)*4

  with precondition: [A=4,K1=B,E1=C,E1=F1,E1=G1,E1=H1,1>=Y] 

* Chain [92]: 0
  with precondition: [A=4,K1=B,E1=C,E1=F1,E1=G1,E1=H1,Y>=9] 


#### Cost of chains of f501_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):
* Chain [100]: 0
  with precondition: [A=3,K1=B,F1=C,F1=H1] 

* Chain [99]: 0
  with precondition: [A=8,K1=B,F1=C,F1=H1] 

* Chain [98]: 1572/7
  with precondition: [A=8,K1=B,F1=C,F1=H1,X>=W+1] 

* Chain [97]: 4*s(83)+2*s(89)+2*s(91)+2*s(92)+1*s(97)+1*s(99)+1*s(100)+84
  Such that:s(94) =< 1
s(87) =< 2
aux(21) =< 8/7
aux(22) =< W-X+1
s(83) =< aux(22)
s(96) =< aux(21)
s(97) =< aux(21)
s(96) =< s(94)
s(97) =< s(94)
s(98) =< s(96)*8
s(99) =< s(98)
s(100) =< s(98)*4
s(88) =< aux(21)
s(89) =< aux(21)
s(88) =< s(87)
s(89) =< s(87)
s(90) =< s(88)*8
s(91) =< s(90)
s(92) =< s(90)*4

  with precondition: [A=8,K1=B,F1=C,F1=H1,W>=X] 


#### Cost of chains of f485_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):
* Chain [104]: 0
  with precondition: [A=3] 

* Chain [103]: 0
  with precondition: [A=9] 

* Chain [102]: 3*s(101)+4*s(108)+1*s(110)+1*s(112)+1*s(113)+2*s(115)+2*s(117)+2*s(118)+84
  Such that:s(104) =< 1
s(105) =< 2
s(107) =< 16
s(106) =< 8/7
aux(23) =< -T+50
s(101) =< aux(23)
s(108) =< s(107)
s(109) =< s(106)
s(110) =< s(106)
s(109) =< s(104)
s(110) =< s(104)
s(111) =< s(109)*8
s(112) =< s(111)
s(113) =< s(111)*4
s(114) =< s(106)
s(115) =< s(106)
s(114) =< s(105)
s(115) =< s(105)
s(116) =< s(114)*8
s(117) =< s(116)
s(118) =< s(116)*4

  with precondition: [A=9,49>=T] 

* Chain [101]: 2020/7
  with precondition: [A=9,T>=50] 


#### Cost of chains of f455_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):
* Chain [108]: 0
  with precondition: [A=3,C=43690] 

* Chain [107]: 0
  with precondition: [A=10,C=43690] 

* Chain [106]: 3070/7
  with precondition: [A=10,C=43690,0>=R+1] 

* Chain [105]: 3*s(151)+3*s(159)+4*s(160)+1*s(162)+1*s(164)+1*s(165)+2*s(167)+2*s(169)+2*s(170)+84
  Such that:s(154) =< 1
s(155) =< 2
s(156) =< 16
s(158) =< 50
s(157) =< 8/7
aux(24) =< R+1
s(151) =< aux(24)
s(159) =< s(158)
s(160) =< s(156)
s(161) =< s(157)
s(162) =< s(157)
s(161) =< s(154)
s(162) =< s(154)
s(163) =< s(161)*8
s(164) =< s(163)
s(165) =< s(163)*4
s(166) =< s(157)
s(167) =< s(157)
s(166) =< s(155)
s(167) =< s(155)
s(168) =< s(166)*8
s(169) =< s(168)
s(170) =< s(168)*4

  with precondition: [A=10,C=43690,R>=0] 


#### Cost of chains of f437_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):
* Chain [113]: 0
  with precondition: [A=3,C=43690] 

* Chain [112]: 0
  with precondition: [A=5,C=43690] 

* Chain [111]: 3*s(174)+3*s(175)+3*s(192)+3*s(193)+4*s(194)+1*s(196)+1*s(198)+1*s(199)+2*s(201)+2*s(203)+2*s(204)+84
  Such that:s(186) =< 1
s(187) =< 2
s(188) =< 16
s(189) =< 50
s(191) =< 99
s(190) =< 8/7
aux(25) =< -J/2+50
aux(26) =< -J/2+101/2
s(192) =< s(191)
s(193) =< s(189)
s(194) =< s(188)
s(195) =< s(190)
s(196) =< s(190)
s(195) =< s(186)
s(196) =< s(186)
s(197) =< s(195)*8
s(198) =< s(197)
s(199) =< s(197)*4
s(200) =< s(190)
s(201) =< s(190)
s(200) =< s(187)
s(201) =< s(187)
s(202) =< s(200)*8
s(203) =< s(202)
s(204) =< s(202)*4
s(173) =< aux(25)
s(174) =< aux(25)
s(173) =< aux(26)
s(174) =< aux(26)
s(175) =< s(173)*16

  with precondition: [A=5,C=43690,99>=J] 

* Chain [110]: 1*s(208)+1*s(209)+16
  Such that:s(205) =< -J/2+50
s(206) =< -J/2+99/2
s(207) =< s(205)
s(208) =< s(205)
s(207) =< s(206)
s(208) =< s(206)
s(209) =< s(207)*16

  with precondition: [A=5,C=43690,97>=J] 

* Chain [109]: 5149/7
  with precondition: [A=5,C=43690,J>=100] 


#### Cost of chains of f422_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):
* Chain [118]: 0
  with precondition: [A=3,C=43690] 

* Chain [117]: 0
  with precondition: [A=6,C=43690] 

* Chain [116]: 4*s(230)+4*s(231)+3*s(246)+3*s(247)+4*s(248)+1*s(250)+1*s(252)+1*s(253)+2*s(255)+2*s(257)+2*s(258)+3*s(260)+3*s(261)+1*s(268)+1*s(269)+84
  Such that:s(238) =< 1
s(239) =< 2
s(240) =< 16
s(242) =< 99
s(243) =< 8/7
s(266) =< 99/2
s(245) =< 101/2
aux(28) =< 50
aux(29) =< -G+50
s(246) =< s(242)
s(247) =< aux(28)
s(248) =< s(240)
s(249) =< s(243)
s(250) =< s(243)
s(249) =< s(238)
s(250) =< s(238)
s(251) =< s(249)*8
s(252) =< s(251)
s(253) =< s(251)*4
s(254) =< s(243)
s(255) =< s(243)
s(254) =< s(239)
s(255) =< s(239)
s(256) =< s(254)*8
s(257) =< s(256)
s(258) =< s(256)*4
s(259) =< aux(28)
s(260) =< aux(28)
s(259) =< s(245)
s(260) =< s(245)
s(261) =< s(259)*16
s(230) =< aux(29)
s(231) =< aux(29)*50
s(267) =< aux(28)
s(268) =< aux(28)
s(267) =< s(266)
s(268) =< s(266)
s(269) =< s(267)*16

  with precondition: [A=6,C=43690,49>=G] 

* Chain [115]: 1*s(273)+1*s(274)+50
  Such that:s(270) =< -G+49
s(271) =< -G+50
s(272) =< s(271)
s(273) =< s(271)
s(272) =< s(270)
s(273) =< s(270)
s(274) =< s(272)*50

  with precondition: [A=6,C=43690,48>=G] 

* Chain [114]: 28949/7
  with precondition: [A=6,C=43690,G>=50] 


#### 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,W1):
* Chain [119]: 122399/7
  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,W1): 
-------------------------------------
* Chain [119] with precondition: [] 
    - Upper bound: 122399/7 
    - Complexity: constant 

### 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,W1): 122399/7 
Asymptotic class: constant 
* Total analysis performed in 1134 ms.

