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


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


WORST_CASE(?,O(n^2))  

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

#### Computed strongly connected components 
0. recursive  : [lbl131/17]
1. recursive  : [lbl131_loop_cont/18,lbl91/17]
2. recursive  : [lbl142/17,lbl91_loop_cont/18]
3. non_recursive  : [exit_location/1]
4. non_recursive  : [stop/9]
5. non_recursive  : [lbl142_loop_cont/10]
6. non_recursive  : [start/9]
7. non_recursive  : [start0/9]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into lbl131/17
1. SCC is partially evaluated into lbl91/17
2. SCC is partially evaluated into lbl142/17
3. SCC is completely evaluated into other SCCs
4. SCC is completely evaluated into other SCCs
5. SCC is partially evaluated into lbl142_loop_cont/10
6. SCC is partially evaluated into start/9
7. SCC is partially evaluated into start0/9

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

### Specialization of cost equations lbl131/17 
* CE 13 is refined into CE [29] 
* CE 11 is refined into CE [30] 
* CE 10 is refined into CE [31] 
* CE 12 is refined into CE [32] 


### Cost equations --> "Loop" of lbl131/17 
* CEs [32] --> Loop 20 
* CEs [29] --> Loop 21 
* CEs [30] --> Loop 22 
* CEs [31] --> Loop 23 

### Ranking functions of CR lbl131(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R) 
* RF of phase [20]: [A-E,D-E,-E+G]

#### Partial ranking functions of CR lbl131(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R) 
* Partial RF of phase [20]:
  - RF of loop [20:1]:
    A-E
    D-E
    -E+G


### Specialization of cost equations lbl91/17 
* CE 14 is refined into CE [33,34] 
* CE 17 is refined into CE [35] 
* CE 16 is refined into CE [36,37] 
* CE 15 is refined into CE [38,39] 


### Cost equations --> "Loop" of lbl91/17 
* CEs [39] --> Loop 24 
* CEs [38] --> Loop 25 
* CEs [34] --> Loop 26 
* CEs [33] --> Loop 27 
* CEs [35] --> Loop 28 
* CEs [37] --> Loop 29 
* CEs [36] --> Loop 30 

### Ranking functions of CR lbl91(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R) 
* RF of phase [24,25]: [A-E-1,D-E-1,-E+G-1]

#### Partial ranking functions of CR lbl91(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R) 
* Partial RF of phase [24,25]:
  - RF of loop [24:1]:
    A/2-E/2-1
    D/2-E/2-1
    -E/2+G/2-1
  - RF of loop [25:1]:
    A-E-1
    D-E-1
    -E+G-1


### Specialization of cost equations lbl142/17 
* CE 21 is refined into CE [40,41] 
* CE 22 is refined into CE [42,43,44,45,46,47,48,49] 
* CE 23 is refined into CE [50,51,52,53] 
* CE 26 is refined into CE [54] 
* CE 24 is refined into CE [55] 
* CE 18 is refined into CE [56,57,58,59,60,61,62,63] 
* CE 19 is refined into CE [64,65] 
* CE 20 is refined into CE [66,67,68,69] 
* CE 25 is refined into CE [70] 


### Cost equations --> "Loop" of lbl142/17 
* CEs [60] --> Loop 31 
* CEs [63] --> Loop 32 
* CEs [59,61,62] --> Loop 33 
* CEs [57,58,69] --> Loop 34 
* CEs [67,68] --> Loop 35 
* CEs [65] --> Loop 36 
* CEs [56] --> Loop 37 
* CEs [66] --> Loop 38 
* CEs [64] --> Loop 39 
* CEs [70] --> Loop 40 
* CEs [49] --> Loop 41 
* CEs [45,48] --> Loop 42 
* CEs [44,46,47,53] --> Loop 43 
* CEs [41,42,43,52] --> Loop 44 
* CEs [40,50,51] --> Loop 45 
* CEs [54] --> Loop 46 
* CEs [55] --> Loop 47 

### Ranking functions of CR lbl142(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R) 
* RF of phase [31,32,33,34,35,36]: [E-2,G-1]

#### Partial ranking functions of CR lbl142(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R) 
* Partial RF of phase [31,32,33,34,35,36]:
  - RF of loop [31:1,34:1]:
    E-3
    G-2
  - RF of loop [32:1]:
    E-5
    G-4
  - RF of loop [33:1]:
    E-4
    G-3
  - RF of loop [35:1,36:1]:
    E-2
    G-1


### Specialization of cost equations lbl142_loop_cont/10 
* CE 27 is refined into CE [71] 
* CE 28 is refined into CE [72] 


### Cost equations --> "Loop" of lbl142_loop_cont/10 
* CEs [71] --> Loop 48 
* CEs [72] --> Loop 49 

### Ranking functions of CR lbl142_loop_cont(A,B,C,D,E,F,G,H,I,J) 

#### Partial ranking functions of CR lbl142_loop_cont(A,B,C,D,E,F,G,H,I,J) 


### Specialization of cost equations start/9 
* CE 2 is refined into CE [73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,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] 
* CE 3 is refined into CE [147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163] 
* CE 4 is refined into CE [164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205] 
* CE 5 is refined into CE [206,207] 
* CE 6 is refined into CE [208,209,210,211,212,213,214,215] 
* CE 7 is refined into CE [216,217,218,219] 
* CE 8 is refined into CE [220] 
* CE 9 is refined into CE [221,222] 


### Cost equations --> "Loop" of start/9 
* CEs [86,97,106,117,126,135,144,161,178,192,203] --> Loop 50 
* CEs [85,96,105,116,125,134,143,160,177,191,202] --> Loop 51 
* CEs [84,95,104,115,124,133,138,139,140,141,142,145,146,159,176,190,201,215] --> Loop 52 
* CEs [83,88,94,99,100,101,102,103,107,108,114,119,120,121,122,123,127,128,129,130,131,132,136,137,158,163,175,180,189,194,200,205,211,214] --> Loop 53 
* CEs [80,81,82,87,91,92,93,98,111,112,113,118,157,162,174,179,188,193,197,198,199,204,210,212,213,219] --> Loop 54 
* CEs [155,156,172,173,186,187,207,208,209,218] --> Loop 55 
* CEs [206,216,217] --> Loop 56 
* CEs [220] --> Loop 57 
* CEs [78,79,89,90,109,110,153,154,170,171,184,185,195,196] --> Loop 58 
* CEs [73,74,75,76,77,150,151,152,167,168,169,181,182,183] --> Loop 59 
* CEs [147,148,149,164,165,166] --> Loop 60 
* CEs [221,222] --> Loop 61 

### Ranking functions of CR start(A,B,C,D,E,F,G,H,J) 

#### Partial ranking functions of CR start(A,B,C,D,E,F,G,H,J) 


### Specialization of cost equations start0/9 
* CE 1 is refined into CE [223,224,225,226,227,228,229,230,231,232,233,234] 


### Cost equations --> "Loop" of start0/9 
* CEs [234] --> Loop 62 
* CEs [233] --> Loop 63 
* CEs [232] --> Loop 64 
* CEs [231] --> Loop 65 
* CEs [230] --> Loop 66 
* CEs [229] --> Loop 67 
* CEs [228] --> Loop 68 
* CEs [227] --> Loop 69 
* CEs [226] --> Loop 70 
* CEs [225] --> Loop 71 
* CEs [224] --> Loop 72 
* CEs [223] --> Loop 73 

### Ranking functions of CR start0(A,B,C,D,E,F,G,H,J) 

#### Partial ranking functions of CR start0(A,B,C,D,E,F,G,H,J) 


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

#### Cost of chains of lbl131(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R):
* Chain [[20],23]: 1*it(20)+0
  Such that:it(20) =< -E+O

  with precondition: [J=2,A=D,A=K,B=L,C=M,A=N,G=O,F=P,G=Q+1,H=R,E>=1,G>=E+1,A>=G] 

* Chain [[20],22]: 1*it(20)+0
  Such that:it(20) =< -E+O

  with precondition: [J=3,A=D,A=K,C=M,A=N,F=P,G=Q,H=R,E>=1,O>=E+1,A>=G,G>=O+1] 

* Chain [[20],21]: 1*it(20)+0
  Such that:it(20) =< -E+G

  with precondition: [J=4,A=D,E>=1,G>=E+1,A>=G] 

* Chain [23]: 0
  with precondition: [J=2,D=A,L=B,M=C,G=E,P=F,R=H,D=K,D=N,G=O,G=Q+1,G>=1,D>=G] 

* Chain [22]: 0
  with precondition: [J=3,D=A,M=C,P=F,R=H,D=K,D=N,E=O,G=Q,E>=1,G>=E+1,D>=G] 

* Chain [21]: 0
  with precondition: [J=4,D=A,E>=1,G>=E,D>=G] 


#### Cost of chains of lbl91(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R):
* Chain [[24,25],30]: 1*it(24)+2*it(25)+0
  Such that:aux(5) =< -E+Q+1
it(24) =< -E/2+Q/2
aux(7) =< -E+K
aux(8) =< -E+Q
it(24) =< aux(7)
it(25) =< aux(7)
it(24) =< aux(8)
it(25) =< aux(8)
it(24) =< aux(5)
it(25) =< aux(5)

  with precondition: [J=2,A=D,A=K,C=M,A=N,G=O,F=P,G=Q+1,H=R,E>=0,G>=E+2,A>=G] 

* Chain [[24,25],29]: 1*it(24)+2*it(25)+1*s(4)+0
  Such that:it(24) =< -E/2+Q/2
aux(9) =< -E+K
aux(10) =< -E+Q
aux(11) =< -E+Q+1
aux(2) =< aux(10)
aux(2) =< aux(11)
it(24) =< aux(11)
s(4) =< aux(11)
it(24) =< aux(9)
it(25) =< aux(9)
it(24) =< aux(2)
it(25) =< aux(2)
it(25) =< aux(11)

  with precondition: [J=2,A=D,A=K,C=M,A=N,G=O,F=P,G=Q+1,H=R,E>=0,G>=E+3,A>=G] 

* Chain [[24,25],28]: 1*it(24)+2*it(25)+0
  Such that:it(24) =< -E/2+G/2
aux(12) =< A-E
aux(13) =< -E+G
it(24) =< aux(12)
it(25) =< aux(12)
it(24) =< aux(13)
it(25) =< aux(13)

  with precondition: [J=4,A=D,E>=0,G>=E+2,A>=G] 

* Chain [[24,25],27]: 1*it(24)+2*it(25)+0
  Such that:it(24) =< -E/2+G/2
aux(14) =< A-E
aux(15) =< -E+G
it(24) =< aux(14)
it(25) =< aux(14)
it(24) =< aux(15)
it(25) =< aux(15)

  with precondition: [J=4,A=D,E>=0,G>=E+2,A>=G] 

* Chain [[24,25],26]: 1*it(24)+2*it(25)+1*s(5)+0
  Such that:it(24) =< -E/2+G/2
aux(16) =< A-E
aux(17) =< -E+G
it(24) =< aux(17)
s(5) =< aux(17)
it(24) =< aux(16)
it(25) =< aux(16)
it(25) =< aux(17)

  with precondition: [J=4,A=D,E>=0,G>=E+3,A>=G] 

* Chain [30]: 0
  with precondition: [J=2,L=B,M=C,A=D,G=E+1,P=F,R=H,A=K,A=N,G=O,G=Q+1,G>=1,A>=G] 

* Chain [29]: 1*s(4)+0
  Such that:s(4) =< -E+G

  with precondition: [J=2,L=B,M=C,A=D,P=F,R=H,A=K,A=N,G=O,G=Q+1,E>=0,G>=E+2,A>=G] 

* Chain [28]: 0
  with precondition: [J=4] 

* Chain [27]: 0
  with precondition: [J=4,A=D,E>=0,G>=E+1,A>=G] 

* Chain [26]: 1*s(5)+0
  Such that:s(5) =< -E+G

  with precondition: [J=4,A=D,E>=0,G>=E+2,A>=G] 


#### Cost of chains of lbl142(A,B,C,D,E,F,G,H,J,K,L,M,N,O,P,Q,R):
* Chain [[31,32,33,34,35,36],46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+0
  Such that:aux(33) =< D
aux(55) =< E
it(31) =< aux(55)
aux(36) =< aux(55)
aux(38) =< aux(33)
aux(34) =< aux(55)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(55)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=2,A>=G+1] 

* Chain [[31,32,33,34,35,36],45]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+0
  Such that:aux(33) =< D
aux(56) =< E
it(31) =< aux(56)
aux(36) =< aux(56)
aux(38) =< aux(33)
aux(34) =< aux(56)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(56)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=2,A>=G+1] 

* Chain [[31,32,33,34,35,36],44]: 12*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+6*s(124)+1
  Such that:aux(58) =< D
aux(59) =< E
it(31) =< aux(59)
s(124) =< aux(59)
s(124) =< aux(58)
aux(36) =< aux(59)
aux(38) =< aux(58)
aux(34) =< aux(59)-1
s(94) =< it(31)*aux(58)
s(89) =< it(31)*aux(59)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=3,A>=G+1] 

* Chain [[31,32,33,34,35,36],43]: 14*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+9*s(130)+1
  Such that:aux(63) =< D
aux(64) =< E
it(31) =< aux(64)
s(130) =< aux(64)
s(130) =< aux(63)
aux(36) =< aux(64)
aux(38) =< aux(63)
aux(34) =< aux(64)-1
s(94) =< it(31)*aux(63)
s(89) =< it(31)*aux(64)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=4,A>=G+1] 

* Chain [[31,32,33,34,35,36],42]: 12*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+10*s(139)+1
  Such that:aux(70) =< D
aux(71) =< E
s(139) =< aux(71)
it(31) =< aux(71)
s(139) =< aux(70)
aux(36) =< aux(71)
aux(38) =< aux(70)
aux(34) =< aux(71)-1
s(94) =< it(31)*aux(70)
s(89) =< it(31)*aux(71)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=5,A>=G+1] 

* Chain [[31,32,33,34,35,36],41]: 12*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+3*s(152)+1
  Such that:aux(73) =< D
aux(74) =< E
s(152) =< aux(74)
it(31) =< aux(74)
s(152) =< aux(73)
aux(36) =< aux(74)
aux(38) =< aux(73)
aux(34) =< aux(74)-1
s(94) =< it(31)*aux(73)
s(89) =< it(31)*aux(74)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=6,A>=G+1] 

* Chain [[31,32,33,34,35,36],39,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+1
  Such that:aux(33) =< D
aux(75) =< E
it(31) =< aux(75)
aux(36) =< aux(75)
aux(38) =< aux(33)
aux(34) =< aux(75)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(75)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=2,A>=G+1] 

* Chain [[31,32,33,34,35,36],39,40,47]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+2
  Such that:aux(51) =< G+1
aux(33) =< K
aux(76) =< G
aux(32) =< aux(51)
it(31) =< aux(51)
it(31) =< aux(76)
aux(32) =< aux(76)
aux(36) =< aux(32)
aux(38) =< aux(33)
aux(34) =< aux(32)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(32)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=5,O=0,Q+1=0,A=D,G+1=E,A=K,C=M,A=N,F=P,H=R,G>=2,A>=G+1] 

* Chain [[31,32,33,34,35,36],39,40,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+2
  Such that:aux(33) =< D
aux(77) =< E
it(31) =< aux(77)
aux(36) =< aux(77)
aux(38) =< aux(33)
aux(34) =< aux(77)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(77)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=2,A>=G+1] 

* Chain [[31,32,33,34,35,36],38,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+1
  Such that:aux(33) =< D
aux(78) =< E
it(31) =< aux(78)
aux(36) =< aux(78)
aux(38) =< aux(33)
aux(34) =< aux(78)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(78)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=2,A>=G+1] 

* Chain [[31,32,33,34,35,36],38,40,47]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+2
  Such that:aux(51) =< G+1
aux(33) =< K
aux(79) =< G
aux(32) =< aux(51)
it(31) =< aux(51)
it(31) =< aux(79)
aux(32) =< aux(79)
aux(36) =< aux(32)
aux(38) =< aux(33)
aux(34) =< aux(32)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(32)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=5,O=0,Q+1=0,A=D,G+1=E,A=K,C=M,A=N,F=P,H=R,G>=2,A>=G+1] 

* Chain [[31,32,33,34,35,36],38,40,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+2
  Such that:aux(33) =< D
aux(80) =< E
it(31) =< aux(80)
aux(36) =< aux(80)
aux(38) =< aux(33)
aux(34) =< aux(80)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(80)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=2,A>=G+1] 

* Chain [[31,32,33,34,35,36],37,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+2
  Such that:aux(33) =< D
aux(81) =< E
it(31) =< aux(81)
aux(36) =< aux(81)
aux(38) =< aux(33)
aux(34) =< aux(81)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(81)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=3,A>=G+1] 

* Chain [[31,32,33,34,35,36],37,45]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+2
  Such that:aux(33) =< D
aux(82) =< E
it(31) =< aux(82)
aux(36) =< aux(82)
aux(38) =< aux(33)
aux(34) =< aux(82)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(82)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=3,A>=G+1] 

* Chain [[31,32,33,34,35,36],37,39,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+3
  Such that:aux(33) =< D
aux(83) =< E
it(31) =< aux(83)
aux(36) =< aux(83)
aux(38) =< aux(33)
aux(34) =< aux(83)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(83)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=3,A>=G+1] 

* Chain [[31,32,33,34,35,36],37,39,40,47]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+4
  Such that:aux(51) =< G+1
aux(33) =< K
aux(84) =< G
aux(32) =< aux(51)
it(31) =< aux(51)
it(31) =< aux(84)
aux(32) =< aux(84)
aux(36) =< aux(32)
aux(38) =< aux(33)
aux(34) =< aux(32)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(32)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=5,O=0,Q+1=0,A=D,G+1=E,A=K,C=M,A=N,F=P,H=R,G>=3,A>=G+1] 

* Chain [[31,32,33,34,35,36],37,39,40,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+4
  Such that:aux(33) =< D
aux(85) =< E
it(31) =< aux(85)
aux(36) =< aux(85)
aux(38) =< aux(33)
aux(34) =< aux(85)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(85)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=3,A>=G+1] 

* Chain [[31,32,33,34,35,36],37,38,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+3
  Such that:aux(33) =< D
aux(86) =< E
it(31) =< aux(86)
aux(36) =< aux(86)
aux(38) =< aux(33)
aux(34) =< aux(86)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(86)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=3,A>=G+1] 

* Chain [[31,32,33,34,35,36],37,38,40,47]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+4
  Such that:aux(51) =< G+1
aux(33) =< K
aux(87) =< G
aux(32) =< aux(51)
it(31) =< aux(51)
it(31) =< aux(87)
aux(32) =< aux(87)
aux(36) =< aux(32)
aux(38) =< aux(33)
aux(34) =< aux(32)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(32)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=5,O=0,Q+1=0,A=D,G+1=E,A=K,C=M,A=N,F=P,H=R,G>=3,A>=G+1] 

* Chain [[31,32,33,34,35,36],37,38,40,46]: 10*it(31)+1*s(89)+3*s(90)+1*s(91)+2*s(92)+2*s(95)+4*s(96)+8*s(97)+1*s(100)+2*s(101)+3*s(106)+2*s(107)+4
  Such that:aux(33) =< D
aux(88) =< E
it(31) =< aux(88)
aux(36) =< aux(88)
aux(38) =< aux(33)
aux(34) =< aux(88)-1
s(94) =< it(31)*aux(33)
s(89) =< it(31)*aux(88)
s(106) =< it(31)*aux(36)
s(104) =< it(31)*aux(38)
aux(37) =< it(31)*aux(36)
aux(35) =< it(31)*aux(34)
s(95) =< aux(37)*(1/2)
s(112) =< aux(37)*(1/2)
s(100) =< aux(35)*(1/2)
s(91) =< aux(35)*(1/2)
s(95) =< s(104)
s(97) =< s(104)
s(95) =< aux(37)
s(97) =< aux(37)
s(107) =< s(112)
s(107) =< s(104)
s(107) =< aux(37)
s(96) =< aux(37)
s(90) =< aux(35)
s(100) =< aux(35)
s(100) =< s(104)
s(101) =< s(104)
s(101) =< aux(35)
s(91) =< aux(35)
s(91) =< s(94)
s(92) =< s(94)
s(92) =< aux(35)

  with precondition: [J=4,A=D,G+1=E,G>=3,A>=G+1] 

* Chain [47]: 0
  with precondition: [E=0,G+1=0,J=5,O=0,Q+1=0,L=B,M=C,A=D,P=F,R=H,A=K,A=N,A>=0] 

* Chain [46]: 0
  with precondition: [J=4] 

* Chain [45]: 0
  with precondition: [J=4,A=D,G+1=E,G>=1,A>=G+1] 

* Chain [44]: 2*s(119)+2*s(124)+4*s(125)+1
  Such that:s(120) =< D
s(122) =< G/2
aux(57) =< G
s(119) =< aux(57)
s(124) =< s(122)
s(124) =< s(120)
s(125) =< s(120)
s(124) =< aux(57)
s(125) =< aux(57)

  with precondition: [J=4,A=D,G+1=E,G>=2,A>=G+1] 

* Chain [43]: 4*s(129)+3*s(130)+6*s(131)+1
  Such that:aux(60) =< D
aux(61) =< G
aux(62) =< G/2
s(129) =< aux(61)
s(130) =< aux(62)
s(130) =< aux(60)
s(131) =< aux(60)
s(130) =< aux(61)
s(131) =< aux(61)

  with precondition: [J=4,A=D,G+1=E,G>=3,A>=G+1] 

* Chain [42]: 1*s(139)+2*s(142)+7*s(143)+2*s(149)+1
  Such that:aux(67) =< D
aux(68) =< G
aux(69) =< G/2
s(139) =< aux(69)
s(147) =< aux(69)
s(139) =< aux(68)
s(142) =< aux(68)
s(139) =< aux(67)
s(143) =< aux(67)
s(143) =< aux(68)
s(147) =< aux(68)
s(149) =< s(147)
s(149) =< aux(67)
s(149) =< aux(68)

  with precondition: [J=4,A=D,G+1=E,G>=4,A>=G+1] 

* Chain [41]: 2*s(151)+1*s(152)+2*s(156)+1
  Such that:s(153) =< D
s(152) =< G/2
aux(72) =< G
s(151) =< aux(72)
s(152) =< aux(72)
s(152) =< s(153)
s(156) =< s(153)
s(156) =< aux(72)

  with precondition: [J=4,A=D,G+1=E,G>=5,A>=G+1] 

* Chain [40,47]: 1
  with precondition: [E=1,G=0,J=5,O=0,Q+1=0,A=D,A=K,B=L,C=M,A=N,F=P,H=R,A>=1] 

* Chain [40,46]: 1
  with precondition: [E=1,G=0,J=4,A=D,A>=1] 

* Chain [39,46]: 1
  with precondition: [E=2,G=1,J=4,A=D,A>=2] 

* Chain [39,40,47]: 2
  with precondition: [E=2,G=1,J=5,O=0,Q+1=0,A=D,A=K,B=L,C=M,A=N,F=P,H=R,A>=2] 

* Chain [39,40,46]: 2
  with precondition: [E=2,G=1,J=4,A=D,A>=2] 

* Chain [38,46]: 1
  with precondition: [E=2,G=1,J=4,A=D,A>=2] 

* Chain [38,40,47]: 2
  with precondition: [E=2,G=1,J=5,O=0,Q+1=0,A=D,A=K,C=M,A=N,F=P,H=R,A>=2] 

* Chain [38,40,46]: 2
  with precondition: [E=2,G=1,J=4,A=D,A>=2] 

* Chain [37,46]: 2
  with precondition: [E=3,G=2,J=4,A=D,A>=3] 

* Chain [37,45]: 2
  with precondition: [E=3,G=2,J=4,A=D,A>=3] 

* Chain [37,39,46]: 3
  with precondition: [E=3,G=2,J=4,A=D,A>=3] 

* Chain [37,39,40,47]: 4
  with precondition: [E=3,G=2,J=5,O=0,Q+1=0,A=D,A=K,C=M,A=N,F=P,H=R,A>=3] 

* Chain [37,39,40,46]: 4
  with precondition: [E=3,G=2,J=4,A=D,A>=3] 

* Chain [37,38,46]: 3
  with precondition: [E=3,G=2,J=4,A=D,A>=3] 

* Chain [37,38,40,47]: 4
  with precondition: [E=3,G=2,J=5,O=0,Q+1=0,A=D,A=K,C=M,A=N,F=P,H=R,A>=3] 

* Chain [37,38,40,46]: 4
  with precondition: [E=3,G=2,J=4,A=D,A>=3] 


#### Cost of chains of lbl142_loop_cont(A,B,C,D,E,F,G,H,I,J):
* Chain [49]: 0
  with precondition: [A=4] 

* Chain [48]: 0
  with precondition: [A=5] 


#### Cost of chains of start(A,B,C,D,E,F,G,H,J):
* Chain [61]: 0
  with precondition: [A=0,D=0,C=B,F=E,H=G] 

* Chain [60]: 2
  with precondition: [A=1,D=1,C=B,F=E,H=G] 

* Chain [59]: 53/2
  with precondition: [A=2,D=2,C=B,F=E,H=G] 

* Chain [58]: 65
  with precondition: [A=3,D=3,C=B,F=E,H=G] 

* Chain [57]: 0
  with precondition: [D=A,C=B,F=E,H=G,0>=D+1] 

* Chain [56]: 0
  with precondition: [D=A,C=B,F=E,H=G,D>=1] 

* Chain [55]: 5*s(674)+4*s(679)+9*s(682)+1
  Such that:aux(120) =< A
aux(121) =< D
aux(122) =< D/2
s(674) =< aux(120)
s(679) =< aux(122)
s(679) =< aux(121)
s(682) =< aux(121)

  with precondition: [D=A,C=B,F=E,H=G,D>=2] 

* Chain [54]: 73*s(695)+575*s(697)+25*s(703)+50*s(710)+150*s(711)+100*s(715)+50*s(717)+50*s(718)+600*s(719)+100*s(720)+150*s(722)+100*s(723)+100*s(724)+2*s(829)+6*s(836)+18*s(837)+12*s(841)+6*s(843)+6*s(844)+72*s(845)+12*s(846)+18*s(848)+12*s(849)+12*s(850)+4
  Such that:s(825) =< A/2
aux(146) =< A
aux(147) =< D
aux(148) =< D/2
s(695) =< aux(146)
s(703) =< aux(148)
s(829) =< s(825)
s(829) =< aux(146)
s(832) =< aux(146)
s(834) =< aux(146)-1
s(835) =< s(695)*aux(146)
s(836) =< s(695)*aux(146)
s(837) =< s(695)*s(832)
s(838) =< s(695)*s(832)
s(840) =< s(695)*s(834)
s(841) =< s(838)*(1/2)
s(842) =< s(838)*(1/2)
s(843) =< s(840)*(1/2)
s(844) =< s(840)*(1/2)
s(841) =< s(838)
s(845) =< s(838)
s(846) =< s(842)
s(846) =< s(838)
s(848) =< s(840)
s(843) =< s(840)
s(843) =< s(838)
s(849) =< s(838)
s(849) =< s(840)
s(844) =< s(840)
s(844) =< s(835)
s(850) =< s(835)
s(850) =< s(840)
s(697) =< aux(147)
s(706) =< aux(147)
s(708) =< aux(147)-1
s(709) =< s(697)*aux(147)
s(710) =< s(697)*aux(147)
s(711) =< s(697)*s(706)
s(712) =< s(697)*s(706)
s(714) =< s(697)*s(708)
s(715) =< s(712)*(1/2)
s(716) =< s(712)*(1/2)
s(717) =< s(714)*(1/2)
s(718) =< s(714)*(1/2)
s(715) =< s(712)
s(719) =< s(712)
s(720) =< s(716)
s(720) =< s(712)
s(722) =< s(714)
s(717) =< s(714)
s(717) =< s(712)
s(723) =< s(712)
s(723) =< s(714)
s(718) =< s(714)
s(718) =< s(709)
s(724) =< s(709)
s(724) =< s(714)
s(703) =< aux(147)

  with precondition: [D=A,C=B,F=E,H=G,D>=3] 

* Chain [53]: 1417*s(1135)+55*s(1141)+114*s(1148)+342*s(1149)+228*s(1153)+114*s(1155)+114*s(1156)+1368*s(1157)+228*s(1158)+342*s(1160)+228*s(1161)+228*s(1162)+2*s(1950)+6
  Such that:aux(190) =< D
aux(191) =< D/2
s(1141) =< aux(191)
s(1948) =< aux(191)
s(1135) =< aux(190)
s(1144) =< aux(190)
s(1146) =< aux(190)-1
s(1147) =< s(1135)*aux(190)
s(1148) =< s(1135)*aux(190)
s(1149) =< s(1135)*s(1144)
s(1150) =< s(1135)*s(1144)
s(1152) =< s(1135)*s(1146)
s(1153) =< s(1150)*(1/2)
s(1154) =< s(1150)*(1/2)
s(1155) =< s(1152)*(1/2)
s(1156) =< s(1152)*(1/2)
s(1153) =< s(1150)
s(1157) =< s(1150)
s(1158) =< s(1154)
s(1158) =< s(1150)
s(1160) =< s(1152)
s(1155) =< s(1152)
s(1155) =< s(1150)
s(1161) =< s(1150)
s(1161) =< s(1152)
s(1156) =< s(1152)
s(1156) =< s(1147)
s(1162) =< s(1147)
s(1162) =< s(1152)
s(1141) =< aux(190)
s(1948) =< aux(190)
s(1950) =< s(1948)
s(1950) =< aux(190)

  with precondition: [D=A,C=B,F=E,H=G,D>=4] 

* Chain [52]: 597*s(1952)+29*s(1957)+22*s(1961)+28*s(1968)+84*s(1969)+56*s(1973)+28*s(1975)+28*s(1976)+336*s(1977)+56*s(1978)+84*s(1980)+56*s(1981)+56*s(1982)+6
  Such that:aux(218) =< D
aux(219) =< D/2
s(1957) =< aux(219)
s(1958) =< aux(219)
s(1957) =< aux(218)
s(1952) =< aux(218)
s(1958) =< aux(218)
s(1961) =< s(1958)
s(1961) =< aux(218)
s(1964) =< aux(218)
s(1966) =< aux(218)-1
s(1967) =< s(1952)*aux(218)
s(1968) =< s(1952)*aux(218)
s(1969) =< s(1952)*s(1964)
s(1970) =< s(1952)*s(1964)
s(1972) =< s(1952)*s(1966)
s(1973) =< s(1970)*(1/2)
s(1974) =< s(1970)*(1/2)
s(1975) =< s(1972)*(1/2)
s(1976) =< s(1972)*(1/2)
s(1973) =< s(1970)
s(1977) =< s(1970)
s(1978) =< s(1974)
s(1978) =< s(1970)
s(1980) =< s(1972)
s(1975) =< s(1972)
s(1975) =< s(1970)
s(1981) =< s(1970)
s(1981) =< s(1972)
s(1976) =< s(1972)
s(1976) =< s(1967)
s(1982) =< s(1967)
s(1982) =< s(1972)

  with precondition: [D=A,C=B,F=E,H=G,D>=5] 

* Chain [51]: 309*s(2483)+17*s(2486)+11*s(2496)+33*s(2497)+22*s(2501)+11*s(2503)+11*s(2504)+132*s(2505)+22*s(2506)+33*s(2508)+22*s(2509)+22*s(2510)+3
  Such that:aux(237) =< D
aux(238) =< D/2
s(2486) =< aux(238)
s(2483) =< aux(237)
s(2486) =< aux(237)
s(2492) =< aux(237)
s(2494) =< aux(237)-1
s(2495) =< s(2483)*aux(237)
s(2496) =< s(2483)*aux(237)
s(2497) =< s(2483)*s(2492)
s(2498) =< s(2483)*s(2492)
s(2500) =< s(2483)*s(2494)
s(2501) =< s(2498)*(1/2)
s(2502) =< s(2498)*(1/2)
s(2503) =< s(2500)*(1/2)
s(2504) =< s(2500)*(1/2)
s(2501) =< s(2498)
s(2505) =< s(2498)
s(2506) =< s(2502)
s(2506) =< s(2498)
s(2508) =< s(2500)
s(2503) =< s(2500)
s(2503) =< s(2498)
s(2509) =< s(2498)
s(2509) =< s(2500)
s(2504) =< s(2500)
s(2504) =< s(2495)
s(2510) =< s(2495)
s(2510) =< s(2500)

  with precondition: [D=A,C=B,F=E,H=G,D>=6] 

* Chain [50]: 188*s(2824)+11*s(2833)+33*s(2834)+22*s(2838)+11*s(2840)+11*s(2841)+132*s(2842)+22*s(2843)+33*s(2845)+22*s(2846)+22*s(2847)+6*s(2849)+3
  Such that:aux(250) =< D
aux(251) =< D/2
s(2849) =< aux(251)
s(2824) =< aux(250)
s(2829) =< aux(250)
s(2831) =< aux(250)-1
s(2832) =< s(2824)*aux(250)
s(2833) =< s(2824)*aux(250)
s(2834) =< s(2824)*s(2829)
s(2835) =< s(2824)*s(2829)
s(2837) =< s(2824)*s(2831)
s(2838) =< s(2835)*(1/2)
s(2839) =< s(2835)*(1/2)
s(2840) =< s(2837)*(1/2)
s(2841) =< s(2837)*(1/2)
s(2838) =< s(2835)
s(2842) =< s(2835)
s(2843) =< s(2839)
s(2843) =< s(2835)
s(2845) =< s(2837)
s(2840) =< s(2837)
s(2840) =< s(2835)
s(2846) =< s(2835)
s(2846) =< s(2837)
s(2841) =< s(2837)
s(2841) =< s(2832)
s(2847) =< s(2832)
s(2847) =< s(2837)
s(2849) =< aux(250)

  with precondition: [D=A,C=B,F=E,H=G,D>=7] 


#### Cost of chains of start0(A,B,C,D,E,F,G,H,J):
* Chain [73]: 0
  with precondition: [A=0] 

* Chain [72]: 2
  with precondition: [A=1] 

* Chain [71]: 53/2
  with precondition: [A=2] 

* Chain [70]: 65
  with precondition: [A=3] 

* Chain [69]: 0
  with precondition: [0>=A+1] 

* Chain [68]: 0
  with precondition: [A>=1] 

* Chain [67]: 14*s(3124)+4*s(3125)+1
  Such that:s(3123) =< A/2
aux(252) =< A
s(3124) =< aux(252)
s(3125) =< s(3123)
s(3125) =< aux(252)

  with precondition: [A>=2] 

* Chain [66]: 648*s(3131)+27*s(3132)+56*s(3137)+168*s(3138)+112*s(3141)+56*s(3143)+56*s(3144)+672*s(3145)+112*s(3146)+168*s(3147)+112*s(3148)+112*s(3149)+4
  Such that:aux(253) =< A
aux(254) =< A/2
s(3131) =< aux(253)
s(3132) =< aux(254)
s(3132) =< aux(253)
s(3134) =< aux(253)
s(3135) =< aux(253)-1
s(3136) =< s(3131)*aux(253)
s(3137) =< s(3131)*aux(253)
s(3138) =< s(3131)*s(3134)
s(3139) =< s(3131)*s(3134)
s(3140) =< s(3131)*s(3135)
s(3141) =< s(3139)*(1/2)
s(3142) =< s(3139)*(1/2)
s(3143) =< s(3140)*(1/2)
s(3144) =< s(3140)*(1/2)
s(3141) =< s(3139)
s(3145) =< s(3139)
s(3146) =< s(3142)
s(3146) =< s(3139)
s(3147) =< s(3140)
s(3143) =< s(3140)
s(3143) =< s(3139)
s(3148) =< s(3139)
s(3148) =< s(3140)
s(3144) =< s(3140)
s(3144) =< s(3136)
s(3149) =< s(3136)
s(3149) =< s(3140)

  with precondition: [A>=3] 

* Chain [65]: 55*s(3169)+1417*s(3171)+114*s(3175)+342*s(3176)+228*s(3179)+114*s(3181)+114*s(3182)+1368*s(3183)+228*s(3184)+342*s(3185)+228*s(3186)+228*s(3187)+2*s(3188)+6
  Such that:s(3167) =< A
s(3168) =< A/2
s(3169) =< s(3168)
s(3170) =< s(3168)
s(3171) =< s(3167)
s(3172) =< s(3167)
s(3173) =< s(3167)-1
s(3174) =< s(3171)*s(3167)
s(3175) =< s(3171)*s(3167)
s(3176) =< s(3171)*s(3172)
s(3177) =< s(3171)*s(3172)
s(3178) =< s(3171)*s(3173)
s(3179) =< s(3177)*(1/2)
s(3180) =< s(3177)*(1/2)
s(3181) =< s(3178)*(1/2)
s(3182) =< s(3178)*(1/2)
s(3179) =< s(3177)
s(3183) =< s(3177)
s(3184) =< s(3180)
s(3184) =< s(3177)
s(3185) =< s(3178)
s(3181) =< s(3178)
s(3181) =< s(3177)
s(3186) =< s(3177)
s(3186) =< s(3178)
s(3182) =< s(3178)
s(3182) =< s(3174)
s(3187) =< s(3174)
s(3187) =< s(3178)
s(3169) =< s(3167)
s(3170) =< s(3167)
s(3188) =< s(3170)
s(3188) =< s(3167)

  with precondition: [A>=4] 

* Chain [64]: 29*s(3191)+597*s(3193)+22*s(3194)+28*s(3198)+84*s(3199)+56*s(3202)+28*s(3204)+28*s(3205)+336*s(3206)+56*s(3207)+84*s(3208)+56*s(3209)+56*s(3210)+6
  Such that:s(3189) =< A
s(3190) =< A/2
s(3191) =< s(3190)
s(3192) =< s(3190)
s(3191) =< s(3189)
s(3193) =< s(3189)
s(3192) =< s(3189)
s(3194) =< s(3192)
s(3194) =< s(3189)
s(3195) =< s(3189)
s(3196) =< s(3189)-1
s(3197) =< s(3193)*s(3189)
s(3198) =< s(3193)*s(3189)
s(3199) =< s(3193)*s(3195)
s(3200) =< s(3193)*s(3195)
s(3201) =< s(3193)*s(3196)
s(3202) =< s(3200)*(1/2)
s(3203) =< s(3200)*(1/2)
s(3204) =< s(3201)*(1/2)
s(3205) =< s(3201)*(1/2)
s(3202) =< s(3200)
s(3206) =< s(3200)
s(3207) =< s(3203)
s(3207) =< s(3200)
s(3208) =< s(3201)
s(3204) =< s(3201)
s(3204) =< s(3200)
s(3209) =< s(3200)
s(3209) =< s(3201)
s(3205) =< s(3201)
s(3205) =< s(3197)
s(3210) =< s(3197)
s(3210) =< s(3201)

  with precondition: [A>=5] 

* Chain [63]: 17*s(3213)+309*s(3214)+11*s(3218)+33*s(3219)+22*s(3222)+11*s(3224)+11*s(3225)+132*s(3226)+22*s(3227)+33*s(3228)+22*s(3229)+22*s(3230)+3
  Such that:s(3211) =< A
s(3212) =< A/2
s(3213) =< s(3212)
s(3214) =< s(3211)
s(3213) =< s(3211)
s(3215) =< s(3211)
s(3216) =< s(3211)-1
s(3217) =< s(3214)*s(3211)
s(3218) =< s(3214)*s(3211)
s(3219) =< s(3214)*s(3215)
s(3220) =< s(3214)*s(3215)
s(3221) =< s(3214)*s(3216)
s(3222) =< s(3220)*(1/2)
s(3223) =< s(3220)*(1/2)
s(3224) =< s(3221)*(1/2)
s(3225) =< s(3221)*(1/2)
s(3222) =< s(3220)
s(3226) =< s(3220)
s(3227) =< s(3223)
s(3227) =< s(3220)
s(3228) =< s(3221)
s(3224) =< s(3221)
s(3224) =< s(3220)
s(3229) =< s(3220)
s(3229) =< s(3221)
s(3225) =< s(3221)
s(3225) =< s(3217)
s(3230) =< s(3217)
s(3230) =< s(3221)

  with precondition: [A>=6] 

* Chain [62]: 6*s(3233)+188*s(3234)+11*s(3238)+33*s(3239)+22*s(3242)+11*s(3244)+11*s(3245)+132*s(3246)+22*s(3247)+33*s(3248)+22*s(3249)+22*s(3250)+3
  Such that:s(3231) =< A
s(3232) =< A/2
s(3233) =< s(3232)
s(3234) =< s(3231)
s(3235) =< s(3231)
s(3236) =< s(3231)-1
s(3237) =< s(3234)*s(3231)
s(3238) =< s(3234)*s(3231)
s(3239) =< s(3234)*s(3235)
s(3240) =< s(3234)*s(3235)
s(3241) =< s(3234)*s(3236)
s(3242) =< s(3240)*(1/2)
s(3243) =< s(3240)*(1/2)
s(3244) =< s(3241)*(1/2)
s(3245) =< s(3241)*(1/2)
s(3242) =< s(3240)
s(3246) =< s(3240)
s(3247) =< s(3243)
s(3247) =< s(3240)
s(3248) =< s(3241)
s(3244) =< s(3241)
s(3244) =< s(3240)
s(3249) =< s(3240)
s(3249) =< s(3241)
s(3245) =< s(3241)
s(3245) =< s(3237)
s(3250) =< s(3237)
s(3250) =< s(3241)
s(3233) =< s(3231)

  with precondition: [A>=7] 


Closed-form bounds of start0(A,B,C,D,E,F,G,H,J): 
-------------------------------------
* Chain [73] with precondition: [A=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [72] with precondition: [A=1] 
    - Upper bound: 2 
    - Complexity: constant 
* Chain [71] with precondition: [A=2] 
    - Upper bound: 53/2 
    - Complexity: constant 
* Chain [70] with precondition: [A=3] 
    - Upper bound: 65 
    - Complexity: constant 
* Chain [69] with precondition: [0>=A+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [68] with precondition: [A>=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [67] with precondition: [A>=2] 
    - Upper bound: 16*A+1 
    - Complexity: n 
* Chain [66] with precondition: [A>=3] 
    - Upper bound: 648*A+4+1232*A*A+(A-1)*(224*A)+27/2*A 
    - Complexity: n^2 
* Chain [65] with precondition: [A>=4] 
    - Upper bound: 1417*A+6+2508*A*A+(A-1)*(456*A)+57/2*A 
    - Complexity: n^2 
* Chain [64] with precondition: [A>=5] 
    - Upper bound: 597*A+6+616*A*A+(A-1)*(112*A)+51/2*A 
    - Complexity: n^2 
* Chain [63] with precondition: [A>=6] 
    - Upper bound: 309*A+3+242*A*A+(A-1)*(44*A)+17/2*A 
    - Complexity: n^2 
* Chain [62] with precondition: [A>=7] 
    - Upper bound: 188*A+3+242*A*A+(A-1)*(44*A)+3*A 
    - Complexity: n^2 

### Maximum cost of start0(A,B,C,D,E,F,G,H,J): max([65,nat(A)*288+1+nat(A)*374*nat(A)+nat(A)*68*nat(nat(A)+ -1)+nat(A/2)*10+max([nat(A/2)*24+2,nat(A)*769+2+nat(A)*1276*nat(A)+nat(A)*232*nat(nat(A)+ -1)+nat(A/2)*30+(nat(A)*616*nat(A)+nat(A)*51+nat(A)*112*nat(nat(A)+ -1))])+(nat(A/2)*11+nat(A)*121)+(nat(A)*174+2+nat(A)*242*nat(A)+nat(A)*44*nat(nat(A)+ -1)+nat(A/2)*2)+(nat(A)*14+1+nat(A/2)*4)]) 
Asymptotic class: n^2 
* Total analysis performed in 10348 ms.