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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [f23/4]
1. non_recursive  : [exit_location/1]
2. recursive  : [f33/14]
3. recursive  : [f29/14,f33_loop_cont/15,f44/14]
4. recursive  : [f52/12,f55/12]
5. non_recursive  : [f71/13]
6. non_recursive  : [f63/13]
7. non_recursive  : [f52_loop_cont/14]
8. non_recursive  : [f29_loop_cont/14]
9. non_recursive  : [f23_loop_cont/14]
10. non_recursive  : [f0/13]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f23/4
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f33/14
3. SCC is partially evaluated into f29/14
4. SCC is partially evaluated into f52/12
5. SCC is completely evaluated into other SCCs
6. SCC is partially evaluated into f63/13
7. SCC is partially evaluated into f52_loop_cont/14
8. SCC is partially evaluated into f29_loop_cont/14
9. SCC is partially evaluated into f23_loop_cont/14
10. SCC is partially evaluated into f0/13

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

### Specialization of cost equations f23/4 
* CE 4 is refined into CE [39] 
* CE 3 is refined into CE [40] 
* CE 2 is refined into CE [41] 


### Cost equations --> "Loop" of f23/4 
* CEs [41] --> Loop 39 
* CEs [39] --> Loop 40 
* CEs [40] --> Loop 41 

### Ranking functions of CR f23(C,F,O,P) 
* RF of phase [39]: [-F+10]

#### Partial ranking functions of CR f23(C,F,O,P) 
* Partial RF of phase [39]:
  - RF of loop [39:1]:
    -F+10


### Specialization of cost equations f33/14 
* CE 23 is refined into CE [42] 
* CE 21 is refined into CE [43] 
* CE 20 is refined into CE [44] 
* CE 22 is refined into CE [45] 
* CE 17 is refined into CE [46] 
* CE 16 is discarded (unfeasible) 
* CE 18 is refined into CE [47] 
* CE 19 is refined into CE [48] 


### Cost equations --> "Loop" of f33/14 
* CEs [46] --> Loop 42 
* CEs [47] --> Loop 43 
* CEs [48] --> Loop 44 
* CEs [42] --> Loop 45 
* CEs [43] --> Loop 46 
* CEs [44] --> Loop 47 
* CEs [45] --> Loop 48 

### Ranking functions of CR f33(A,C,F,G,H,I,J,O,P,Q,R,S,T,U) 
* RF of phase [42]: [-H+10]
* RF of phase [44]: [-H+10]

#### Partial ranking functions of CR f33(A,C,F,G,H,I,J,O,P,Q,R,S,T,U) 
* Partial RF of phase [42]:
  - RF of loop [42:1]:
    -H+10
* Partial RF of phase [44]:
  - RF of loop [44:1]:
    -H+10


### Specialization of cost equations f29/14 
* CE 12 is refined into CE [49] 
* CE 10 is refined into CE [50,51,52,53] 
* CE 13 is refined into CE [54] 
* CE 11 is refined into CE [55,56,57] 
* CE 8 is refined into CE [58,59,60,61] 
* CE 9 is discarded (unfeasible) 
* CE 7 is refined into CE [62,63] 


### Cost equations --> "Loop" of f29/14 
* CEs [60,61] --> Loop 49 
* CEs [58,59] --> Loop 50 
* CEs [63] --> Loop 51 
* CEs [62] --> Loop 52 
* CEs [56,57] --> Loop 53 
* CEs [55] --> Loop 54 
* CEs [49] --> Loop 55 
* CEs [50,51,52,53] --> Loop 56 
* CEs [54] --> Loop 57 

### Ranking functions of CR f29(A,C,F,G,H,I,J,O,P,Q,R,S,T,U) 
* RF of phase [49]: [-F+10]
* RF of phase [53,54]: [-F+10]

#### Partial ranking functions of CR f29(A,C,F,G,H,I,J,O,P,Q,R,S,T,U) 
* Partial RF of phase [49]:
  - RF of loop [49:1]:
    -F+10
* Partial RF of phase [53,54]:
  - RF of loop [53:1,54:1]:
    -F+10


### Specialization of cost equations f52/12 
* CE 30 is refined into CE [64] 
* CE 29 is refined into CE [65] 
* CE 32 is refined into CE [66] 
* CE 31 is refined into CE [67] 
* CE 26 is refined into CE [68] 
* CE 27 is discarded (unfeasible) 
* CE 24 is refined into CE [69] 
* CE 25 is discarded (unfeasible) 
* CE 28 is refined into CE [70] 


### Cost equations --> "Loop" of f52/12 
* CEs [68] --> Loop 58 
* CEs [69] --> Loop 59 
* CEs [70] --> Loop 60 
* CEs [64] --> Loop 61 
* CEs [65] --> Loop 62 
* CEs [66] --> Loop 63 
* CEs [67] --> Loop 64 

### Ranking functions of CR f52(A,B,C,F,K,L,O,P,Q,R,S,T) 
* RF of phase [58]: [-F+9]
* RF of phase [60]: [-F+9]

#### Partial ranking functions of CR f52(A,B,C,F,K,L,O,P,Q,R,S,T) 
* Partial RF of phase [58]:
  - RF of loop [58:1]:
    -F+9
* Partial RF of phase [60]:
  - RF of loop [60:1]:
    -F+9


### Specialization of cost equations f63/13 
* CE 37 is refined into CE [71] 
* CE 36 is refined into CE [72] 
* CE 38 is refined into CE [73] 


### Cost equations --> "Loop" of f63/13 
* CEs [71] --> Loop 65 
* CEs [72] --> Loop 66 
* CEs [73] --> Loop 67 

### Ranking functions of CR f63(A,B,C,D,E,F,G,H,I,J,K,L,O) 

#### Partial ranking functions of CR f63(A,B,C,D,E,F,G,H,I,J,K,L,O) 


### Specialization of cost equations f52_loop_cont/14 
* CE 34 is refined into CE [74] 
* CE 33 is refined into CE [75,76,77] 
* CE 35 is refined into CE [78] 


### Cost equations --> "Loop" of f52_loop_cont/14 
* CEs [74] --> Loop 68 
* CEs [77] --> Loop 69 
* CEs [76] --> Loop 70 
* CEs [75] --> Loop 71 
* CEs [78] --> Loop 72 

### Ranking functions of CR f52_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N) 

#### Partial ranking functions of CR f52_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N) 


### Specialization of cost equations f29_loop_cont/14 
* CE 15 is refined into CE [79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97] 
* CE 14 is refined into CE [98] 


### Cost equations --> "Loop" of f29_loop_cont/14 
* CEs [97] --> Loop 73 
* CEs [92] --> Loop 74 
* CEs [88] --> Loop 75 
* CEs [91] --> Loop 76 
* CEs [87] --> Loop 77 
* CEs [94] --> Loop 78 
* CEs [86] --> Loop 79 
* CEs [96] --> Loop 80 
* CEs [90] --> Loop 81 
* CEs [89] --> Loop 82 
* CEs [93] --> Loop 83 
* CEs [85] --> Loop 84 
* CEs [84] --> Loop 85 
* CEs [95] --> Loop 86 
* CEs [83] --> Loop 87 
* CEs [81] --> Loop 88 
* CEs [80] --> Loop 89 
* CEs [82] --> Loop 90 
* CEs [79] --> Loop 91 
* CEs [98] --> Loop 92 

### Ranking functions of CR f29_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N) 

#### Partial ranking functions of CR f29_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N) 


### Specialization of cost equations f23_loop_cont/14 
* CE 5 is refined into CE [99] 
* CE 6 is refined into CE [100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147] 


### Cost equations --> "Loop" of f23_loop_cont/14 
* CEs [99] --> Loop 93 
* CEs [141,142,143,144,145,146,147] --> Loop 94 
* CEs [110] --> Loop 95 
* CEs [109,125,126,127,128,129,130,131] --> Loop 96 
* CEs [108,111,112,113,114,115,116,117,118,119,120,121,122,123,124] --> Loop 97 
* CEs [107,132,133,134,135,136,137,138,139] --> Loop 98 
* CEs [100,101,102,103,104,105,106] --> Loop 99 
* CEs [140] --> Loop 100 

### Ranking functions of CR f23_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N) 

#### Partial ranking functions of CR f23_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N) 


### Specialization of cost equations f0/13 
* CE 1 is refined into CE [148,149,150,151,152,153,154] 


### Cost equations --> "Loop" of f0/13 
* CEs [148,149,150,151,152,153,154] --> Loop 101 

### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,O) 

#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,O) 


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

#### Cost of chains of f23(C,F,O,P):
* Chain [[39],41]: 1*it(39)+0
  Such that:it(39) =< -F+10

  with precondition: [C=10,O=3,P=0,9>=F,F>=0] 

* Chain [[39],40]: 1*it(39)+0
  Such that:it(39) =< -F+10

  with precondition: [C=10,O=4,9>=F,F>=0] 

* Chain [40]: 0
  with precondition: [C=10,O=4,F>=0] 


#### Cost of chains of f33(A,C,F,G,H,I,J,O,P,Q,R,S,T,U):
* Chain [[44],48]: 1*it(44)+0
  Such that:it(44) =< -H+10

  with precondition: [A=0,C=10,G=0,O=3,P=0,R=0,S=10,T=0,U=0,F+1=Q,9>=F,9>=H,H>=0] 

* Chain [[44],47]: 1*it(44)+0
  Such that:it(44) =< -H+10

  with precondition: [C=10,G=0,O=2,R=0,S=10,T=0,A=P,F=Q,J=U,0>=A+1,9>=F,9>=H,H>=0] 

* Chain [[44],46]: 1*it(44)+0
  Such that:it(44) =< -H+10

  with precondition: [C=10,G=0,O=2,R=0,S=10,T=0,A=P,F=Q,J=U,9>=F,9>=H,A>=1,H>=0] 

* Chain [[44],45]: 1*it(44)+0
  Such that:it(44) =< -H+10

  with precondition: [C=10,G=0,O=4,9>=F,9>=H,H>=0] 

* Chain [[44],43,[42],48]: 2*it(42)+1
  Such that:aux(1) =< -H+8
aux(2) =< -H+9
it(42) =< aux(1)
it(42) =< aux(2)

  with precondition: [A=0,C=10,G=0,O=3,P=0,R=1,S=10,T=1,U=0,F+1=Q,9>=F,7>=H,H>=0] 

* Chain [[44],43,[42],47]: 2*it(42)+1
  Such that:aux(3) =< -H+8
aux(4) =< -H+9
it(42) =< aux(3)
it(42) =< aux(4)

  with precondition: [C=10,G=0,O=2,R=1,S=10,T=1,A=P,F=Q,J=U,0>=A+1,9>=F,7>=H,H>=0] 

* Chain [[44],43,[42],46]: 2*it(42)+1
  Such that:aux(5) =< -H+8
aux(6) =< -H+9
it(42) =< aux(5)
it(42) =< aux(6)

  with precondition: [C=10,G=0,O=2,R=1,S=10,T=1,A=P,F=Q,J=U,9>=F,7>=H,A>=1,H>=0] 

* Chain [[44],43,[42],45]: 2*it(42)+1
  Such that:aux(7) =< -H+8
aux(8) =< -H+9
it(42) =< aux(7)
it(42) =< aux(8)

  with precondition: [C=10,G=0,O=4,9>=F,7>=H,H>=0] 

* Chain [[44],43,48]: 1*it(44)+1
  Such that:it(44) =< -H+9

  with precondition: [A=0,C=10,G=0,O=3,P=0,R=1,S=10,T=1,U=0,F+1=Q,9>=F,8>=H,H>=0] 

* Chain [[44],43,47]: 1*it(44)+1
  Such that:it(44) =< -H+9

  with precondition: [C=10,G=0,O=2,R=1,S=10,T=1,A=P,F=Q,J=U,0>=A+1,9>=F,8>=H,H>=0] 

* Chain [[44],43,46]: 1*it(44)+1
  Such that:it(44) =< -H+9

  with precondition: [C=10,G=0,O=2,R=1,S=10,T=1,A=P,F=Q,J=U,9>=F,8>=H,A>=1,H>=0] 

* Chain [[44],43,45]: 1*it(44)+1
  Such that:it(44) =< -H+9

  with precondition: [C=10,G=0,O=4,9>=F,8>=H,H>=0] 

* Chain [45]: 0
  with precondition: [C=10,O=4,9>=F,1>=G,G>=0,H>=G] 

* Chain [43,[42],48]: 1*it(42)+1
  Such that:it(42) =< -H+9

  with precondition: [A=0,C=10,G=0,O=3,P=0,R=1,S=10,T=1,U=0,F+1=Q,9>=F,8>=H,H>=0] 

* Chain [43,[42],47]: 1*it(42)+1
  Such that:it(42) =< -H+9

  with precondition: [C=10,G=0,O=2,R=1,S=10,T=1,A=P,F=Q,J=U,0>=A+1,9>=F,8>=H,H>=0] 

* Chain [43,[42],46]: 1*it(42)+1
  Such that:it(42) =< -H+9

  with precondition: [C=10,G=0,O=2,R=1,S=10,T=1,A=P,F=Q,J=U,9>=F,8>=H,A>=1,H>=0] 

* Chain [43,[42],45]: 1*it(42)+1
  Such that:it(42) =< -H+9

  with precondition: [C=10,G=0,O=4,9>=F,8>=H,H>=0] 

* Chain [43,45]: 1
  with precondition: [C=10,G=0,O=4,9>=F,9>=H,H>=0] 


#### Cost of chains of f29(A,C,F,G,H,I,J,O,P,Q,R,S,T,U):
* Chain [[49],57]: 36*it(49)+0
  Such that:it(49) =< -F+10

  with precondition: [A=1,C=10,O=4,9>=F] 

* Chain [[49],56]: 36*it(49)+45
  Such that:it(49) =< -F+9

  with precondition: [A=1,C=10,O=4,8>=F] 

* Chain [[49],55]: 36*it(49)+0
  Such that:it(49) =< -F+10

  with precondition: [A=1,C=10,O=7,P=1,Q=0,R=1,S=10,T=1,U=1,9>=F] 

* Chain [[49],51,[53,54],57]: 36*it(49)+37*it(53)+1*s(28)+1*s(29)+1
  Such that:s(29) =< 10
aux(20) =< -F+8
aux(21) =< -F+9
aux(19) =< aux(20)
it(49) =< aux(20)
aux(19) =< aux(21)
it(49) =< aux(21)
it(53) =< aux(19)
s(28) =< aux(19)*10

  with precondition: [A=1,C=10,O=4,7>=F] 

* Chain [[49],51,[53,54],56]: 36*it(49)+37*it(53)+1*s(28)+1*s(29)+46
  Such that:s(29) =< 10
aux(18) =< -F+7
aux(22) =< -F+8
aux(23) =< -F+9
aux(17) =< aux(22)
aux(18) =< aux(22)
it(49) =< aux(22)
aux(17) =< aux(23)
it(49) =< aux(23)
aux(16) =< aux(17)
it(53) =< aux(17)
aux(16) =< aux(18)
it(53) =< aux(18)
s(28) =< aux(16)*10

  with precondition: [A=1,C=10,O=4,6>=F] 

* Chain [[49],51,[53,54],55]: 36*it(49)+37*it(53)+1*s(28)+1*s(29)+1
  Such that:s(29) =< 10
aux(25) =< -F+8
aux(26) =< -F+9
aux(24) =< aux(25)
it(49) =< aux(25)
aux(24) =< aux(26)
it(49) =< aux(26)
it(53) =< aux(24)
s(28) =< aux(24)*10

  with precondition: [A=1,C=10,O=7,P=0,Q=0,S=10,U=0,R=T,7>=F,1>=R,R>=0] 

* Chain [[49],51,57]: 36*it(49)+1*s(29)+1
  Such that:s(29) =< 10
it(49) =< -F+9

  with precondition: [A=1,C=10,O=4,8>=F] 

* Chain [[49],51,56]: 36*it(49)+1*s(29)+46
  Such that:s(29) =< 10
it(49) =< -F+8

  with precondition: [A=1,C=10,O=4,7>=F] 

* Chain [[49],51,55]: 36*it(49)+1*s(29)+1
  Such that:s(29) =< 10
it(49) =< -F+9

  with precondition: [A=1,C=10,O=7,P=0,Q=0,R=0,S=10,T=0,U=0,8>=F] 

* Chain [57]: 0
  with precondition: [C=10,O=4,1>=A,A>=0] 

* Chain [56]: 45
  with precondition: [C=10,O=4,1>=A,9>=F,A>=0] 

* Chain [55]: 0
  with precondition: [C=10,O=7,Q=0,R=G,S=H,T=I,U=J,A=P,1>=A,A>=0,F>=10] 

* Chain [51,[53,54],57]: 37*it(53)+1*s(28)+1*s(29)+1
  Such that:s(29) =< 10
aux(19) =< -F+9
it(53) =< aux(19)
s(28) =< aux(19)*10

  with precondition: [A=1,C=10,O=4,8>=F] 

* Chain [51,[53,54],56]: 37*it(53)+1*s(28)+1*s(29)+46
  Such that:s(29) =< 10
aux(18) =< -F+8
aux(17) =< -F+9
aux(16) =< aux(17)
it(53) =< aux(17)
aux(16) =< aux(18)
it(53) =< aux(18)
s(28) =< aux(16)*10

  with precondition: [A=1,C=10,O=4,7>=F] 

* Chain [51,[53,54],55]: 37*it(53)+1*s(28)+1*s(29)+1
  Such that:s(29) =< 10
aux(24) =< -F+9
it(53) =< aux(24)
s(28) =< aux(24)*10

  with precondition: [A=1,C=10,O=7,P=0,Q=0,S=10,U=0,R=T,8>=F,1>=R,R>=0] 

* Chain [51,57]: 1*s(29)+1
  Such that:s(29) =< 10

  with precondition: [A=1,C=10,O=4,9>=F] 

* Chain [51,56]: 1*s(29)+46
  Such that:s(29) =< 10

  with precondition: [A=1,C=10,O=4,8>=F] 

* Chain [51,55]: 1*s(29)+1
  Such that:s(29) =< 10

  with precondition: [A=1,C=10,F=9,O=7,P=0,Q=0,R=0,S=10,T=0,U=0] 


#### Cost of chains of f52(A,B,C,F,K,L,O,P,Q,R,S,T):
* Chain [[58],64]: 1*it(58)+0
  Such that:it(58) =< -F+9

  with precondition: [A=0,B=1,C=10,O=6,P=0,Q=1,R=9,S=1,T=1,8>=F] 

* Chain [[58],63]: 1*it(58)+0
  Such that:it(58) =< -F+9

  with precondition: [B=1,C=10,O=4,8>=F] 

* Chain [[58],62]: 1*it(58)+0
  Such that:it(58) =< -F+9

  with precondition: [B=1,C=10,O=5,Q=1,R=9,S=1,A=P,L=T,0>=A+1,8>=F] 

* Chain [[58],61]: 1*it(58)+0
  Such that:it(58) =< -F+9

  with precondition: [B=1,C=10,O=5,Q=1,R=9,S=1,A=P,L=T,8>=F,A>=1] 

* Chain [[58],59,[60],64]: 2*it(58)+1
  Such that:aux(32) =< -F+7
aux(33) =< -F+8
it(58) =< aux(32)
it(58) =< aux(33)

  with precondition: [A=0,B=1,C=10,O=6,P=0,Q=0,R=9,S=0,T=1,6>=F] 

* Chain [[58],59,[60],63]: 2*it(58)+1
  Such that:aux(34) =< -F+7
aux(35) =< -F+8
it(58) =< aux(34)
it(58) =< aux(35)

  with precondition: [B=1,C=10,O=4,6>=F] 

* Chain [[58],59,[60],62]: 2*it(58)+1
  Such that:aux(36) =< -F+7
aux(37) =< -F+8
it(58) =< aux(36)
it(58) =< aux(37)

  with precondition: [B=1,C=10,O=5,Q=0,R=9,S=0,A=P,L=T,0>=A+1,6>=F] 

* Chain [[58],59,[60],61]: 2*it(58)+1
  Such that:aux(38) =< -F+7
aux(39) =< -F+8
it(58) =< aux(38)
it(58) =< aux(39)

  with precondition: [B=1,C=10,O=5,Q=0,R=9,S=0,A=P,L=T,6>=F,A>=1] 

* Chain [[58],59,64]: 1*it(58)+1
  Such that:it(58) =< -F+8

  with precondition: [A=0,B=1,C=10,O=6,P=0,Q=0,R=9,S=0,T=1,7>=F] 

* Chain [[58],59,63]: 1*it(58)+1
  Such that:it(58) =< -F+8

  with precondition: [B=1,C=10,O=4,7>=F] 

* Chain [[58],59,62]: 1*it(58)+1
  Such that:it(58) =< -F+8

  with precondition: [B=1,C=10,O=5,Q=0,R=9,S=0,A=P,L=T,0>=A+1,7>=F] 

* Chain [[58],59,61]: 1*it(58)+1
  Such that:it(58) =< -F+8

  with precondition: [B=1,C=10,O=5,Q=0,R=9,S=0,A=P,L=T,7>=F,A>=1] 

* Chain [64]: 0
  with precondition: [A=0,C=10,O=6,P=0,T=1,S=K,B=Q,F=R,1>=B,B>=0,F>=9] 

* Chain [63]: 0
  with precondition: [C=10,O=4,1>=B,B>=0] 

* Chain [62]: 0
  with precondition: [C=10,O=5,S=K,T=L,A=P,B=Q,F=R,0>=A+1,1>=B,B>=0,F>=9] 

* Chain [61]: 0
  with precondition: [C=10,O=5,S=K,T=L,A=P,B=Q,F=R,1>=B,A>=1,B>=0,F>=9] 

* Chain [59,[60],64]: 1*it(60)+1
  Such that:it(60) =< -F+8

  with precondition: [A=0,B=1,C=10,O=6,P=0,Q=0,R=9,S=0,T=1,7>=F] 

* Chain [59,[60],63]: 1*it(60)+1
  Such that:it(60) =< -F+8

  with precondition: [B=1,C=10,O=4,7>=F] 

* Chain [59,[60],62]: 1*it(60)+1
  Such that:it(60) =< -F+8

  with precondition: [B=1,C=10,O=5,Q=0,R=9,S=0,A=P,L=T,0>=A+1,7>=F] 

* Chain [59,[60],61]: 1*it(60)+1
  Such that:it(60) =< -F+8

  with precondition: [B=1,C=10,O=5,Q=0,R=9,S=0,A=P,L=T,7>=F,A>=1] 

* Chain [59,64]: 1
  with precondition: [A=0,B=1,C=10,F=8,O=6,P=0,Q=0,R=9,S=0,T=1] 

* Chain [59,63]: 1
  with precondition: [B=1,C=10,O=4,8>=F] 

* Chain [59,62]: 1
  with precondition: [B=1,C=10,F=8,O=5,Q=0,R=9,S=0,A=P,L=T,0>=A+1] 

* Chain [59,61]: 1
  with precondition: [B=1,C=10,F=8,O=5,Q=0,R=9,S=0,A=P,L=T,A>=1] 


#### Cost of chains of f63(A,B,C,D,E,F,G,H,I,J,K,L,O):
* Chain [67]: 0
  with precondition: [B=0,C=10] 

* Chain [66]: 0
  with precondition: [C=10,0>=B+1] 

* Chain [65]: 0
  with precondition: [C=10,B>=1] 


#### Cost of chains of f52_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N):
* Chain [72]: 0
  with precondition: [A=4,D=10] 

* Chain [71]: 0
  with precondition: [A=5,C=0,D=10] 

* Chain [70]: 0
  with precondition: [A=5,D=10,0>=C+1] 

* Chain [69]: 0
  with precondition: [A=5,D=10,C>=1] 

* Chain [68]: 0
  with precondition: [A=6,D=10] 


#### Cost of chains of f29_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N):
* Chain [92]: 0
  with precondition: [A=4,C=1,D=10] 

* Chain [91]: 1
  with precondition: [A=7,B=0,C=1,D=10,G=8] 

* Chain [90]: 1*s(64)+0
  Such that:s(64) =< -G+9

  with precondition: [A=7,B=0,C=1,D=10,8>=G] 

* Chain [89]: 2*s(66)+1
  Such that:s(65) =< -G+8
s(66) =< s(65)

  with precondition: [A=7,B=0,C=1,D=10,7>=G] 

* Chain [88]: 2*s(69)+1
  Such that:s(67) =< -G+7
s(68) =< -G+8
s(69) =< s(67)
s(69) =< s(68)

  with precondition: [A=7,B=0,C=1,D=10,6>=G] 

* Chain [87]: 0
  with precondition: [A=7,B=0,C=1,D=10,G>=9] 

* Chain [86]: 0
  with precondition: [A=7,C=1,D=10] 

* Chain [85]: 1
  with precondition: [A=7,C=1,D=10,G=8,0>=B+1] 

* Chain [84]: 1
  with precondition: [A=7,C=1,D=10,G=8,B>=1] 

* Chain [83]: 1*s(70)+0
  Such that:s(70) =< -G+9

  with precondition: [A=7,C=1,D=10,0>=B+1,8>=G] 

* Chain [82]: 2*s(72)+1
  Such that:s(71) =< -G+8
s(72) =< s(71)

  with precondition: [A=7,C=1,D=10,0>=B+1,7>=G] 

* Chain [81]: 2*s(75)+1
  Such that:s(73) =< -G+7
s(74) =< -G+8
s(75) =< s(73)
s(75) =< s(74)

  with precondition: [A=7,C=1,D=10,0>=B+1,6>=G] 

* Chain [80]: 0
  with precondition: [A=7,C=1,D=10,0>=B+1,G>=9] 

* Chain [79]: 1*s(76)+1
  Such that:s(76) =< -G+9

  with precondition: [A=7,C=1,D=10,8>=G] 

* Chain [78]: 1*s(77)+0
  Such that:s(77) =< -G+9

  with precondition: [A=7,C=1,D=10,8>=G,B>=1] 

* Chain [77]: 2*s(79)+1
  Such that:s(78) =< -G+8
s(79) =< s(78)

  with precondition: [A=7,C=1,D=10,7>=G] 

* Chain [76]: 2*s(81)+1
  Such that:s(80) =< -G+8
s(81) =< s(80)

  with precondition: [A=7,C=1,D=10,7>=G,B>=1] 

* Chain [75]: 2*s(84)+1
  Such that:s(82) =< -G+7
s(83) =< -G+8
s(84) =< s(82)
s(84) =< s(83)

  with precondition: [A=7,C=1,D=10,6>=G] 

* Chain [74]: 2*s(87)+1
  Such that:s(85) =< -G+7
s(86) =< -G+8
s(87) =< s(85)
s(87) =< s(86)

  with precondition: [A=7,C=1,D=10,6>=G,B>=1] 

* Chain [73]: 0
  with precondition: [A=7,C=1,D=10,B>=1,G>=9] 


#### Cost of chains of f23_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N):
* Chain [100]: 0
  with precondition: [A=3,B=1,C=1,D=10] 

* Chain [99]: 150
  with precondition: [A=3,B=1,C=1,D=10,G=9] 

* Chain [98]: 1*s(107)+288*s(108)+2*s(111)+4*s(116)+4*s(123)+45
  Such that:s(107) =< 10
aux(48) =< 7
aux(49) =< 8
aux(50) =< 9
aux(51) =< -G+10
s(111) =< aux(50)
s(108) =< aux(51)
s(123) =< aux(48)
s(123) =< aux(49)
s(116) =< aux(49)

  with precondition: [A=3,B=1,C=1,D=10,9>=G] 

* Chain [97]: 17*s(130)+620*s(131)+8*s(132)+4*s(135)+8*s(139)+8*s(144)+46
  Such that:aux(52) =< 7
aux(53) =< 8
aux(54) =< 9
aux(55) =< 10
aux(56) =< -G+9
s(135) =< aux(54)
s(130) =< aux(55)
s(131) =< aux(56)
s(144) =< aux(52)
s(144) =< aux(53)
s(132) =< aux(56)*10
s(139) =< aux(53)

  with precondition: [A=3,B=1,C=1,D=10,8>=G] 

* Chain [96]: 10*s(202)+36*s(203)+325*s(205)+9*s(206)+296*s(207)+2*s(215)+4*s(224)+4*s(234)+46
  Such that:aux(57) =< 7
aux(58) =< 8
aux(59) =< 9
aux(60) =< 10
aux(61) =< -G+8
aux(62) =< -G+9
s(215) =< aux(59)
s(202) =< aux(60)
s(234) =< aux(57)
s(234) =< aux(58)
s(204) =< aux(61)
s(205) =< aux(61)
s(204) =< aux(62)
s(205) =< aux(62)
s(207) =< s(204)
s(206) =< s(204)*10
s(224) =< aux(58)
s(203) =< aux(61)

  with precondition: [A=3,B=1,C=1,D=10,7>=G] 

* Chain [95]: 1*s(269)+36*s(274)+37*s(276)+1*s(277)+46
  Such that:s(269) =< 10
s(270) =< -G+7
s(271) =< -G+8
s(272) =< -G+9
s(273) =< s(271)
s(270) =< s(271)
s(274) =< s(271)
s(273) =< s(272)
s(274) =< s(272)
s(275) =< s(273)
s(276) =< s(273)
s(275) =< s(270)
s(276) =< s(270)
s(277) =< s(275)*10

  with precondition: [A=3,B=1,C=1,D=10,6>=G] 

* Chain [94]: 79
  with precondition: [A=3,B=1,C=1,D=10,G>=10] 

* Chain [93]: 0
  with precondition: [A=4,B=1,C=1,D=10] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,L,O):
* Chain [101]: 16528
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,L,O): 
-------------------------------------
* Chain [101] with precondition: [] 
    - Upper bound: 16528 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L,O): 16528 
Asymptotic class: constant 
* Total analysis performed in 3087 ms.