YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) [A >= B] (?,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) True (1,1) 2. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 3. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) True (1,1) 4. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,A,M,N,O,P) [A = B] (?,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,B,M,N,O,P) True (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,M,N,M,N,K,L) True (1,1) 7. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,A,B,I,J,K,L) True (1,1) 8. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 9. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [A >= 1 + B] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 11. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 12. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) Signature: {(f0,12);(f3,12);(f4,12);(f8,12)} Flow Graph: [0->{4,8,9},1->{4,8,9},2->{4,8,9},3->{4,8,9},4->{},5->{},6->{4,8,9},7->{4,8,9},8->{0,2},9->{0,2},10->{} ,11->{0,2},12->{4,8,9}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) [A >= B] (?,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) True (1,1) 2. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 3. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) True (1,1) 4. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,A,M,N,O,P) [A = B] (1,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,B,M,N,O,P) True (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,M,N,M,N,K,L) True (1,1) 7. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,A,B,I,J,K,L) True (1,1) 8. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 9. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [A >= 1 + B] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 11. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 12. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) Signature: {(f0,12);(f3,12);(f4,12);(f8,12)} Flow Graph: [0->{4,8,9},1->{4,8,9},2->{4,8,9},3->{4,8,9},4->{},5->{},6->{4,8,9},7->{4,8,9},8->{0,2},9->{0,2},10->{} ,11->{0,2},12->{4,8,9}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,9),(8,0),(9,2)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) [A >= B] (?,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) True (1,1) 2. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 3. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) True (1,1) 4. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,A,M,N,O,P) [A = B] (1,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,B,M,N,O,P) True (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,M,N,M,N,K,L) True (1,1) 7. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,A,B,I,J,K,L) True (1,1) 8. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 9. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [A >= 1 + B] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 11. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 12. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) Signature: {(f0,12);(f3,12);(f4,12);(f8,12)} Flow Graph: [0->{4,8,9},1->{4,8,9},2->{4,8},3->{4,8,9},4->{},5->{},6->{4,8,9},7->{4,8,9},8->{2},9->{0},10->{},11->{0 ,2},12->{4,8,9}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) [A >= B] (?,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) True (1,1) 2. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 3. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) True (1,1) 4. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,A,M,N,O,P) [A = B] (?,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,B,M,N,O,P) True (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,M,N,M,N,K,L) True (1,1) 7. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,A,B,I,J,K,L) True (1,1) 8. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 9. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [A >= 1 + B] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 11. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 12. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 13. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 14. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) Signature: {(exitus616,12);(f0,12);(f3,12);(f4,12);(f8,12)} Flow Graph: [0->{4,8,9,13},1->{4,8,9,13},2->{4,8,9,13},3->{4,8,9,13},4->{},5->{},6->{4,8,9,13},7->{4,8,9,13},8->{0,2} ,9->{0,2},10->{},11->{0,2},12->{4,8,9,13},13->{},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,9),(8,0),(9,2)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) [A >= B] (?,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) True (1,1) 2. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 3. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) True (1,1) 4. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,A,M,N,O,P) [A = B] (?,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,B,M,N,O,P) True (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,M,N,M,N,K,L) True (1,1) 7. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,A,B,I,J,K,L) True (1,1) 8. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 9. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [A >= 1 + B] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 11. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 12. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 13. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 14. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) Signature: {(exitus616,12);(f0,12);(f3,12);(f4,12);(f8,12)} Flow Graph: [0->{4,8,9,13},1->{4,8,9,13},2->{4,8,13},3->{4,8,9,13},4->{},5->{},6->{4,8,9,13},7->{4,8,9,13},8->{2} ,9->{0},10->{},11->{0,2},12->{4,8,9,13},13->{},14->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | +- p:[0,9] c: [9] | `- p:[8,2] c: [8] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) [A >= B] (?,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,1 + B,D,D,F,F,A,B,I,J,K,L) True (1,1) 2. f4(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 3. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(1 + A,B,D,D,F,F,A,B,I,J,K,L) True (1,1) 4. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,A,M,N,O,P) [A = B] (?,1) 5. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(O,P,D,M,F,N,A,B,M,N,O,P) True (1,1) 6. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,M,N,M,N,K,L) True (1,1) 7. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(F,D,D,D,F,F,A,B,I,J,K,L) True (1,1) 8. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [B >= 1 + A] (?,1) 9. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,D,D,F,F,A,B,I,J,K,L) [A >= 1 + B] (?,1) 10. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f8(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 11. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f4(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 12. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> f3(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) 13. f3(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 14. f0(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (1,1) Signature: {(exitus616,12);(f0,12);(f3,12);(f4,12);(f8,12)} Flow Graph: [0->{4,8,9,13},1->{4,8,9,13},2->{4,8,13},3->{4,8,9,13},4->{},5->{},6->{4,8,9,13},7->{4,8,9,13},8->{2} ,9->{0},10->{},11->{0,2},12->{4,8,9,13},13->{},14->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | +- p:[0,9] c: [9] | `- p:[8,2] c: [8]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,J,K,L,0.0,0.1] f4 ~> f3 [A <= A, B <= K + B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f0 ~> f3 [A <= A, B <= K + B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f4 ~> f3 [A <= A + B, B <= B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f0 ~> f3 [A <= K + A, B <= B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f3 ~> f8 [A <= unknown, B <= unknown, C <= D, D <= unknown, E <= F, F <= unknown, G <= A, H <= A, I <= unknown, J <= unknown, K <= unknown, L <= unknown] f0 ~> f8 [A <= unknown, B <= unknown, C <= D, D <= unknown, E <= F, F <= unknown, G <= A, H <= B, I <= unknown, J <= unknown, K <= unknown, L <= unknown] f0 ~> f3 [A <= F, B <= D, C <= D, D <= D, E <= F, F <= F, G <= unknown, H <= unknown, I <= unknown, J <= unknown, K <= K, L <= L] f0 ~> f3 [A <= F, B <= D, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f3 ~> f4 [A <= A, B <= B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f3 ~> f4 [A <= A, B <= B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f0 ~> f8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] f0 ~> f4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] f0 ~> f3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] f3 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] f0 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] + Loop: [0.0 <= K + A + B] f4 ~> f3 [A <= A, B <= K + B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f3 ~> f4 [A <= A, B <= B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] + Loop: [0.1 <= K + A + B] f3 ~> f4 [A <= A, B <= B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] f4 ~> f3 [A <= A + B, B <= B, C <= D, D <= D, E <= F, F <= F, G <= A, H <= B, I <= I, J <= J, K <= K, L <= L] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,J,K,L,0.0,0.1] f4 ~> f3 [A ~=> G,B ~=> H,D ~=> C,F ~=> E,B ~+> B,K ~+> B] f0 ~> f3 [A ~=> G,B ~=> H,D ~=> C,F ~=> E,B ~+> B,K ~+> B] f4 ~> f3 [A ~=> G,B ~=> H,D ~=> C,F ~=> E,A ~+> A,B ~+> A] f0 ~> f3 [A ~=> G,B ~=> H,D ~=> C,F ~=> E,A ~+> A,K ~+> A] f3 ~> f8 [A ~=> G ,A ~=> H ,D ~=> C ,F ~=> E ,huge ~=> A ,huge ~=> B ,huge ~=> D ,huge ~=> F ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L] f0 ~> f8 [A ~=> G ,B ~=> H ,D ~=> C ,F ~=> E ,huge ~=> A ,huge ~=> B ,huge ~=> D ,huge ~=> F ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L] f0 ~> f3 [D ~=> B,D ~=> C,F ~=> A,F ~=> E,huge ~=> G,huge ~=> H,huge ~=> I,huge ~=> J] f0 ~> f3 [A ~=> G,B ~=> H,D ~=> B,D ~=> C,F ~=> A,F ~=> E] f3 ~> f4 [A ~=> G,B ~=> H,D ~=> C,F ~=> E] f3 ~> f4 [A ~=> G,B ~=> H,D ~=> C,F ~=> E] f0 ~> f8 [] f0 ~> f4 [] f0 ~> f3 [] f3 ~> exitus616 [] f0 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,K ~+> 0.0] f4 ~> f3 [A ~=> G,B ~=> H,D ~=> C,F ~=> E,B ~+> B,K ~+> B] f3 ~> f4 [A ~=> G,B ~=> H,D ~=> C,F ~=> E] + Loop: [A ~+> 0.1,B ~+> 0.1,K ~+> 0.1] f3 ~> f4 [A ~=> G,B ~=> H,D ~=> C,F ~=> E] f4 ~> f3 [A ~=> G,B ~=> H,D ~=> C,F ~=> E,A ~+> A,B ~+> A] + Applied Processor: LareProcessor + Details: f0 ~> f8 [A ~=> G ,A ~=> H ,B ~=> H ,D ~=> C ,F ~=> E ,F ~=> G ,F ~=> H ,huge ~=> A ,huge ~=> B ,huge ~=> D ,huge ~=> F ,huge ~=> I ,huge ~=> J ,huge ~=> K ,huge ~=> L ,A ~+> G ,A ~+> H ,A ~+> 0.0 ,A ~+> 0.1 ,A ~+> tick ,B ~+> G ,B ~+> H ,B ~+> 0.0 ,B ~+> 0.1 ,B ~+> tick ,D ~+> G ,D ~+> H ,D ~+> 0.0 ,D ~+> 0.1 ,D ~+> tick ,F ~+> G ,F ~+> H ,F ~+> 0.0 ,F ~+> 0.1 ,F ~+> tick ,tick ~+> tick ,K ~+> G ,K ~+> H ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> tick ,A ~*> G ,A ~*> H ,A ~*> 0.0 ,A ~*> 0.1 ,A ~*> tick ,B ~*> G ,B ~*> H ,B ~*> 0.0 ,B ~*> 0.1 ,B ~*> tick ,D ~*> G ,D ~*> H ,D ~*> 0.0 ,D ~*> 0.1 ,D ~*> tick ,F ~*> G ,F ~*> H ,F ~*> 0.0 ,F ~*> 0.1 ,F ~*> tick ,K ~*> G ,K ~*> H ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> tick] f0 ~> exitus616 [A ~=> G ,B ~=> H ,D ~=> B ,D ~=> C ,D ~=> H ,F ~=> A ,F ~=> E ,F ~=> G ,huge ~=> G ,huge ~=> H ,huge ~=> I ,huge ~=> J ,A ~+> A ,A ~+> G ,A ~+> 0.0 ,A ~+> 0.1 ,A ~+> tick ,B ~+> A ,B ~+> B ,B ~+> G ,B ~+> H ,B ~+> 0.0 ,B ~+> 0.1 ,B ~+> tick ,D ~+> A ,D ~+> B ,D ~+> G ,D ~+> H ,D ~+> 0.0 ,D ~+> 0.1 ,D ~+> tick ,F ~+> A ,F ~+> G ,F ~+> 0.0 ,F ~+> 0.1 ,F ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> G ,K ~+> H ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> G ,A ~*> H ,A ~*> 0.0 ,A ~*> 0.1 ,A ~*> tick ,B ~*> A ,B ~*> B ,B ~*> G ,B ~*> H ,B ~*> 0.0 ,B ~*> 0.1 ,B ~*> tick ,D ~*> A ,D ~*> B ,D ~*> G ,D ~*> H ,D ~*> 0.0 ,D ~*> 0.1 ,D ~*> tick ,F ~*> A ,F ~*> B ,F ~*> G ,F ~*> H ,F ~*> 0.0 ,F ~*> 0.1 ,F ~*> tick ,K ~*> A ,K ~*> B ,K ~*> G ,K ~*> H ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> tick] + f3> [A ~=> G ,B ~=> H ,D ~=> C ,F ~=> E ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> H ,B ~+> 0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> H ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,B ~*> B ,K ~*> B ,K ~*> H] f4> [A ~=> G ,B ~=> H ,D ~=> C ,F ~=> E ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> H ,B ~+> 0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> H ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> H ,B ~*> B ,B ~*> H ,K ~*> B ,K ~*> H] f3> [A ~=> G ,B ~=> H ,D ~=> C ,F ~=> E ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> H ,B ~+> 0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> H ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> H ,B ~*> B ,B ~*> H ,K ~*> B ,K ~*> H] f4> [A ~=> G ,D ~=> C ,F ~=> E ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> H ,B ~+> 0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> H ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> H ,B ~*> B ,B ~*> H ,K ~*> B ,K ~*> H] + f4> [B ~=> H ,D ~=> C ,F ~=> E ,A ~+> A ,A ~+> G ,A ~+> 0.1 ,A ~+> tick ,B ~+> A ,B ~+> G ,B ~+> 0.1 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.1 ,K ~+> tick ,A ~*> A ,B ~*> A ,B ~*> G ,K ~*> A] f3> [A ~=> G ,B ~=> H ,D ~=> C ,F ~=> E ,A ~+> A ,A ~+> G ,A ~+> 0.1 ,A ~+> tick ,B ~+> A ,B ~+> G ,B ~+> 0.1 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.1 ,K ~+> tick ,A ~*> A ,A ~*> G ,B ~*> A ,B ~*> G ,K ~*> A ,K ~*> G] f4> [A ~=> G ,B ~=> H ,D ~=> C ,F ~=> E ,A ~+> A ,A ~+> G ,A ~+> 0.1 ,A ~+> tick ,B ~+> A ,B ~+> G ,B ~+> 0.1 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.1 ,K ~+> tick ,A ~*> A ,A ~*> G ,B ~*> A ,B ~*> G ,K ~*> A ,K ~*> G] f3> [A ~=> G ,B ~=> H ,D ~=> C ,F ~=> E ,A ~+> A ,A ~+> G ,A ~+> 0.1 ,A ~+> tick ,B ~+> A ,B ~+> G ,B ~+> 0.1 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.1 ,K ~+> tick ,A ~*> A ,A ~*> G ,B ~*> A ,B ~*> G ,K ~*> A ,K ~*> G] YES(?,POLY)