MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True (1,1) 1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] (?,1) 2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] (?,1) 3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] (?,1) 4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] (?,1) 5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] (?,1) 6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] (?,1) 7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] (?,1) 8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] (?,1) Signature: {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Flow Graph: [0->{1,8},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,8)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True (1,1) 1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] (?,1) 2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] (?,1) 3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] (?,1) 4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] (?,1) 5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] (?,1) 6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] (?,1) 7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] (?,1) 8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] (?,1) Signature: {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Flow Graph: [0->{1},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] Signature: {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Rule Graph: [0->{1},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: f0.0(A,B,C,D,E,F,G,H) -> f15.1(10,35,285,I,I,0,G,H) True f15.1(A,B,C,D,E,F,G,H) -> f25.2(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.5(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.6(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.7(A,B,C,D,E,F,I,1) [A >= 1 + F] f25.2(A,B,C,D,E,F,G,H) -> f25.2(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.5(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.6(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.7(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f41.3(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,E,1 + F,G,H) [E >= B] f41.3(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,E,1 + F,G,H) [E >= B] f41.4(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] f41.4(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] f25.5(A,B,C,D,E,F,G,H) -> f41.3(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] f25.5(A,B,C,D,E,F,G,H) -> f41.4(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] f25.6(A,B,C,D,E,F,G,H) -> f41.3(A,B,C,D,E,F,G,H) [H >= E] f25.6(A,B,C,D,E,F,G,H) -> f41.4(A,B,C,D,E,F,G,H) [H >= E] f25.7(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] f25.7(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] f15.8(A,B,C,D,E,F,G,H) -> f48.9(A,B,C,D,E,F,G,H) [F >= A] Signature: {(f0.0,8);(f15.1,8);(f15.8,8);(f25.2,8);(f25.5,8);(f25.6,8);(f25.7,8);(f41.3,8);(f41.4,8);(f48.9,8)} Rule Graph: [0->{1,2,3,4},1->{5,6,7,8},2->{13,14},3->{15,16},4->{17,18},5->{5,6,7,8},6->{13,14},7->{15,16},8->{17,18} ,9->{1,2,3,4},10->{19},11->{1,2,3,4},12->{19},13->{9,10},14->{11,12},15->{9,10},16->{11,12},17->{1,2,3,4} ,18->{19},19->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose MAYBE + Considered Problem: Rules: f0.0(A,B,C,D,E,F,G,H) -> f15.1(10,35,285,I,I,0,G,H) True f15.1(A,B,C,D,E,F,G,H) -> f25.2(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.5(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.6(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.7(A,B,C,D,E,F,I,1) [A >= 1 + F] f25.2(A,B,C,D,E,F,G,H) -> f25.2(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.5(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.6(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.7(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f41.3(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,E,1 + F,G,H) [E >= B] f41.3(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,E,1 + F,G,H) [E >= B] f41.4(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] f41.4(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] f25.5(A,B,C,D,E,F,G,H) -> f41.3(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] f25.5(A,B,C,D,E,F,G,H) -> f41.4(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] f25.6(A,B,C,D,E,F,G,H) -> f41.3(A,B,C,D,E,F,G,H) [H >= E] f25.6(A,B,C,D,E,F,G,H) -> f41.4(A,B,C,D,E,F,G,H) [H >= E] f25.7(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] f25.7(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] f15.8(A,B,C,D,E,F,G,H) -> f48.9(A,B,C,D,E,F,G,H) [F >= A] f48.9(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True f48.9(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True f48.9(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True Signature: {(exitus616,8) ;(f0.0,8) ;(f15.1,8) ;(f15.8,8) ;(f25.2,8) ;(f25.5,8) ;(f25.6,8) ;(f25.7,8) ;(f41.3,8) ;(f41.4,8) ;(f48.9,8)} Rule Graph: [0->{1,2,3,4},1->{5,6,7,8},2->{13,14},3->{15,16},4->{17,18},5->{5,6,7,8},6->{13,14},7->{15,16},8->{17,18} ,9->{1,2,3,4},10->{19},11->{1,2,3,4},12->{19},13->{9,10},14->{11,12},15->{9,10},16->{11,12},17->{1,2,3,4} ,18->{19},19->{20,21,22}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] | `- p:[1,9,13,2,11,14,6,5,16,3,17,4,8,7,15] c: [1,2,3,4,6,7,8,9,11,13,14,15,16,17] | `- p:[5] c: [5] * Step 6: AbstractSize MAYBE + Considered Problem: (Rules: f0.0(A,B,C,D,E,F,G,H) -> f15.1(10,35,285,I,I,0,G,H) True f15.1(A,B,C,D,E,F,G,H) -> f25.2(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.5(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.6(A,B,C,D,E,F,I,1) [A >= 1 + F] f15.1(A,B,C,D,E,F,G,H) -> f25.7(A,B,C,D,E,F,I,1) [A >= 1 + F] f25.2(A,B,C,D,E,F,G,H) -> f25.2(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.5(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.6(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f25.2(A,B,C,D,E,F,G,H) -> f25.7(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] f41.3(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,E,1 + F,G,H) [E >= B] f41.3(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,E,1 + F,G,H) [E >= B] f41.4(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] f41.4(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] f25.5(A,B,C,D,E,F,G,H) -> f41.3(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] f25.5(A,B,C,D,E,F,G,H) -> f41.4(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] f25.6(A,B,C,D,E,F,G,H) -> f41.3(A,B,C,D,E,F,G,H) [H >= E] f25.6(A,B,C,D,E,F,G,H) -> f41.4(A,B,C,D,E,F,G,H) [H >= E] f25.7(A,B,C,D,E,F,G,H) -> f15.1(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] f25.7(A,B,C,D,E,F,G,H) -> f15.8(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] f15.8(A,B,C,D,E,F,G,H) -> f48.9(A,B,C,D,E,F,G,H) [F >= A] f48.9(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True f48.9(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True f48.9(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True Signature: {(exitus616,8) ;(f0.0,8) ;(f15.1,8) ;(f15.8,8) ;(f25.2,8) ;(f25.5,8) ;(f25.6,8) ;(f25.7,8) ;(f41.3,8) ;(f41.4,8) ;(f48.9,8)} Rule Graph: [0->{1,2,3,4},1->{5,6,7,8},2->{13,14},3->{15,16},4->{17,18},5->{5,6,7,8},6->{13,14},7->{15,16},8->{17,18} ,9->{1,2,3,4},10->{19},11->{1,2,3,4},12->{19},13->{9,10},14->{11,12},15->{9,10},16->{11,12},17->{1,2,3,4} ,18->{19},19->{20,21,22}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] | `- p:[1,9,13,2,11,14,6,5,16,3,17,4,8,7,15] c: [1,2,3,4,6,7,8,9,11,13,14,15,16,17] | `- p:[5] c: [5]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,0.0,0.0.0] f0.0 ~> f15.1 [A <= 10*K, B <= 35*K, C <= 285*K, D <= unknown, E <= unknown, F <= 0*K, G <= G, H <= H] f15.1 ~> f25.2 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f15.1 ~> f25.5 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f15.1 ~> f25.6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f15.1 ~> f25.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f25.2 ~> f25.2 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f25.2 ~> f25.5 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f25.2 ~> f25.6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f25.2 ~> f25.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f41.3 ~> f15.1 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H] f41.3 ~> f15.8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H] f41.4 ~> f15.1 [A <= A, B <= B, C <= C, D <= D, E <= B + E, F <= K + F, G <= G, H <= H] f41.4 ~> f15.8 [A <= A, B <= B, C <= C, D <= D, E <= B + E, F <= K + F, G <= G, H <= H] f25.5 ~> f41.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f25.5 ~> f41.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f25.6 ~> f41.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f25.6 ~> f41.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f25.7 ~> f15.1 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= K + F, G <= G, H <= H] f25.7 ~> f15.8 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= K + F, G <= G, H <= H] f15.8 ~> f48.9 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f48.9 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f48.9 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f48.9 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0 <= K + A + F] f15.1 ~> f25.2 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f41.3 ~> f15.1 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H] f25.5 ~> f41.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f15.1 ~> f25.5 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f41.4 ~> f15.1 [A <= A, B <= B, C <= C, D <= D, E <= B + E, F <= K + F, G <= G, H <= H] f25.5 ~> f41.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f25.2 ~> f25.5 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f25.2 ~> f25.2 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f25.6 ~> f41.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f15.1 ~> f25.6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f25.7 ~> f15.1 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= K + F, G <= G, H <= H] f15.1 ~> f25.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f25.2 ~> f25.7 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f25.2 ~> f25.6 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f25.6 ~> f41.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0.0 <= K + E + H] f25.2 ~> f25.2 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] + Applied Processor: AbstractFlow + Details: () * Step 8: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,0.0,0.0.0] f0.0 ~> f15.1 [K ~=> A,K ~=> B,K ~=> C,K ~=> F,huge ~=> D,huge ~=> E] f15.1 ~> f25.2 [K ~=> H,huge ~=> G] f15.1 ~> f25.5 [K ~=> H,huge ~=> G] f15.1 ~> f25.6 [K ~=> H,huge ~=> G] f15.1 ~> f25.7 [K ~=> H,huge ~=> G] f25.2 ~> f25.2 [huge ~=> G,E ~+> H,H ~+> H] f25.2 ~> f25.5 [huge ~=> G,E ~+> H,H ~+> H] f25.2 ~> f25.6 [huge ~=> G,E ~+> H,H ~+> H] f25.2 ~> f25.7 [huge ~=> G,E ~+> H,H ~+> H] f41.3 ~> f15.1 [F ~+> F,K ~+> F] f41.3 ~> f15.8 [F ~+> F,K ~+> F] f41.4 ~> f15.1 [B ~+> E,E ~+> E,F ~+> F,K ~+> F] f41.4 ~> f15.8 [B ~+> E,E ~+> E,F ~+> F,K ~+> F] f25.5 ~> f41.3 [] f25.5 ~> f41.4 [] f25.6 ~> f41.3 [] f25.6 ~> f41.4 [] f25.7 ~> f15.1 [E ~+> E,F ~+> F,K ~+> E,K ~+> F] f25.7 ~> f15.8 [E ~+> E,F ~+> F,K ~+> E,K ~+> F] f15.8 ~> f48.9 [] f48.9 ~> exitus616 [] f48.9 ~> exitus616 [] f48.9 ~> exitus616 [] + Loop: [A ~+> 0.0,F ~+> 0.0,K ~+> 0.0] f15.1 ~> f25.2 [K ~=> H,huge ~=> G] f41.3 ~> f15.1 [F ~+> F,K ~+> F] f25.5 ~> f41.3 [] f15.1 ~> f25.5 [K ~=> H,huge ~=> G] f41.4 ~> f15.1 [B ~+> E,E ~+> E,F ~+> F,K ~+> F] f25.5 ~> f41.4 [] f25.2 ~> f25.5 [huge ~=> G,E ~+> H,H ~+> H] f25.2 ~> f25.2 [huge ~=> G,E ~+> H,H ~+> H] f25.6 ~> f41.4 [] f15.1 ~> f25.6 [K ~=> H,huge ~=> G] f25.7 ~> f15.1 [E ~+> E,F ~+> F,K ~+> E,K ~+> F] f15.1 ~> f25.7 [K ~=> H,huge ~=> G] f25.2 ~> f25.7 [huge ~=> G,E ~+> H,H ~+> H] f25.2 ~> f25.6 [huge ~=> G,E ~+> H,H ~+> H] f25.6 ~> f41.3 [] + Loop: [E ~+> 0.0.0,H ~+> 0.0.0,K ~+> 0.0.0] f25.2 ~> f25.2 [huge ~=> G,E ~+> H,H ~+> H] + Applied Processor: Lare + Details: Unknown bound. MAYBE