YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= A] (?,1) 1. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,0,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= C] (?,1) 2. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E + S,1 + F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= D && 0 >= 1 + R] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E,F,G + S,1 + H,I,J,K,L,M,N,O,P,Q) [9 >= D] (?,1) 4. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [D >= 10] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f58(A,B,C,D,E,F,G,H,E,F,G,H,1500,S,O,P,Q) [C >= 10] (?,1) 6. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,S,S,Q) [9 >= B] (?,1) 7. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(1 + A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [B >= 10] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,0,D,0,0,0,0,I,J,K,L,M,N,O,P,1000) [A >= 10] (?,1) 9. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(0,B,C,D,E,F,G,H,I,J,K,L,M,N,0,P,Q) True (1,1) Signature: {(f0,17);(f11,17);(f14,17);(f33,17);(f36,17);(f58,17)} Flow Graph: [0->{6,7},1->{2,3,4},2->{2,3,4},3->{2,3,4},4->{1,5},5->{},6->{6,7},7->{0,8},8->{1,5},9->{0,8}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= A] (?,1) 1. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,0,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= C] (?,1) 2. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E + S,1 + F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= D && 0 >= 1 + R] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E,F,G + S,1 + H,I,J,K,L,M,N,O,P,Q) [9 >= D] (?,1) 4. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [D >= 10] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f58(A,B,C,D,E,F,G,H,E,F,G,H,1500,S,O,P,Q) [C >= 10] (1,1) 6. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,S,S,Q) [9 >= B] (?,1) 7. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(1 + A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [B >= 10] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,0,D,0,0,0,0,I,J,K,L,M,N,O,P,1000) [A >= 10] (1,1) 9. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(0,B,C,D,E,F,G,H,I,J,K,L,M,N,0,P,Q) True (1,1) Signature: {(f0,17);(f11,17);(f14,17);(f33,17);(f36,17);(f58,17)} Flow Graph: [0->{6,7},1->{2,3,4},2->{2,3,4},3->{2,3,4},4->{1,5},5->{},6->{6,7},7->{0,8},8->{1,5},9->{0,8}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,7),(1,4),(8,5),(9,8)] * Step 3: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= A] (?,1) 1. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,0,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= C] (?,1) 2. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E + S,1 + F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= D && 0 >= 1 + R] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E,F,G + S,1 + H,I,J,K,L,M,N,O,P,Q) [9 >= D] (?,1) 4. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [D >= 10] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f58(A,B,C,D,E,F,G,H,E,F,G,H,1500,S,O,P,Q) [C >= 10] (1,1) 6. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,S,S,Q) [9 >= B] (?,1) 7. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(1 + A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [B >= 10] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,0,D,0,0,0,0,I,J,K,L,M,N,O,P,1000) [A >= 10] (1,1) 9. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(0,B,C,D,E,F,G,H,I,J,K,L,M,N,0,P,Q) True (1,1) Signature: {(f0,17);(f11,17);(f14,17);(f33,17);(f36,17);(f58,17)} Flow Graph: [0->{6},1->{2,3},2->{2,3,4},3->{2,3,4},4->{1,5},5->{},6->{6,7},7->{0,8},8->{1},9->{0}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= A] (?,1) 1. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,0,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= C] (?,1) 2. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E + S,1 + F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= D && 0 >= 1 + R] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E,F,G + S,1 + H,I,J,K,L,M,N,O,P,Q) [9 >= D] (?,1) 4. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [D >= 10] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f58(A,B,C,D,E,F,G,H,E,F,G,H,1500,S,O,P,Q) [C >= 10] (?,1) 6. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,S,S,Q) [9 >= B] (?,1) 7. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(1 + A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [B >= 10] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,0,D,0,0,0,0,I,J,K,L,M,N,O,P,1000) [A >= 10] (?,1) 9. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(0,B,C,D,E,F,G,H,I,J,K,L,M,N,0,P,Q) True (1,1) 10. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) True (?,1) Signature: {(exitus616,17);(f0,17);(f11,17);(f14,17);(f33,17);(f36,17);(f58,17)} Flow Graph: [0->{6,7},1->{2,3,4},2->{2,3,4},3->{2,3,4},4->{1,5,10},5->{},6->{6,7},7->{0,8},8->{1,5,10},9->{0,8} ,10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,7),(1,4),(8,5),(9,8)] * Step 5: LooptreeTransformer WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= A] (?,1) 1. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,0,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= C] (?,1) 2. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E + S,1 + F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= D && 0 >= 1 + R] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E,F,G + S,1 + H,I,J,K,L,M,N,O,P,Q) [9 >= D] (?,1) 4. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [D >= 10] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f58(A,B,C,D,E,F,G,H,E,F,G,H,1500,S,O,P,Q) [C >= 10] (?,1) 6. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,S,S,Q) [9 >= B] (?,1) 7. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(1 + A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [B >= 10] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,0,D,0,0,0,0,I,J,K,L,M,N,O,P,1000) [A >= 10] (?,1) 9. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(0,B,C,D,E,F,G,H,I,J,K,L,M,N,0,P,Q) True (1,1) 10. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) True (?,1) Signature: {(exitus616,17);(f0,17);(f11,17);(f14,17);(f33,17);(f36,17);(f58,17)} Flow Graph: [0->{6},1->{2,3},2->{2,3,4},3->{2,3,4},4->{1,5,10},5->{},6->{6,7},7->{0,8},8->{1,10},9->{0},10->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | +- p:[0,7,6] c: [0] | | | `- p:[6] c: [6] | `- p:[1,4,2,3] c: [1] | `- p:[2,3] c: [3] | `- p:[2] c: [2] * Step 6: SizeAbstraction WORST_CASE(?,O(1)) + Considered Problem: (Rules: 0. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,0,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= A] (?,1) 1. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,0,E,F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= C] (?,1) 2. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E + S,1 + F,G,H,I,J,K,L,M,N,O,P,Q) [9 >= D && 0 >= 1 + R] (?,1) 3. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f36(A,B,C,1 + D,E,F,G + S,1 + H,I,J,K,L,M,N,O,P,Q) [9 >= D] (?,1) 4. f36(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,1 + C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [D >= 10] (?,1) 5. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f58(A,B,C,D,E,F,G,H,E,F,G,H,1500,S,O,P,Q) [C >= 10] (?,1) 6. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f14(A,1 + B,C,D,E,F,G,H,I,J,K,L,M,N,S,S,Q) [9 >= B] (?,1) 7. f14(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(1 + A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) [B >= 10] (?,1) 8. f11(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f33(A,B,0,D,0,0,0,0,I,J,K,L,M,N,O,P,1000) [A >= 10] (?,1) 9. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> f11(0,B,C,D,E,F,G,H,I,J,K,L,M,N,0,P,Q) True (1,1) 10. f33(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q) True (?,1) Signature: {(exitus616,17);(f0,17);(f11,17);(f14,17);(f33,17);(f36,17);(f58,17)} Flow Graph: [0->{6},1->{2,3},2->{2,3,4},3->{2,3,4},4->{1,5,10},5->{},6->{6,7},7->{0,8},8->{1,10},9->{0},10->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | +- p:[0,7,6] c: [0] | | | `- p:[6] c: [6] | `- p:[1,4,2,3] c: [1] | `- p:[2,3] c: [3] | `- p:[2] c: [2]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,0.0,0.0.0,0.1,0.1.0,0.1.0.0] f11 ~> f14 [A <= A, B <= 0*K, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f33 ~> f36 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= K + D, E <= unknown, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= unknown, H <= K + H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f36 ~> f33 [A <= A, B <= B, C <= K + C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f33 ~> f58 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= E, J <= F, K <= G, L <= H, M <= 1500*K, N <= unknown, O <= O, P <= P, Q <= Q] f14 ~> f14 [A <= A, B <= K + B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= unknown, P <= unknown, Q <= Q] f14 ~> f11 [A <= K + A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f11 ~> f33 [A <= A, B <= B, C <= 0*K, D <= D, E <= 0*K, F <= 0*K, G <= 0*K, H <= 0*K, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= 1000*K] f0 ~> f11 [A <= 0*K, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= 0*K, P <= P, Q <= Q] f33 ~> 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, M <= M, N <= N, O <= O, P <= P, Q <= Q] + Loop: [0.0 <= 10*K + A] f11 ~> f14 [A <= A, B <= 0*K, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f14 ~> f11 [A <= K + A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f14 ~> f14 [A <= A, B <= K + B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= unknown, P <= unknown, Q <= Q] + Loop: [0.0.0 <= 10*K + B] f14 ~> f14 [A <= A, B <= K + B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= unknown, P <= unknown, Q <= Q] + Loop: [0.1 <= 10*K + C] f33 ~> f36 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f36 ~> f33 [A <= A, B <= B, C <= K + C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= K + D, E <= unknown, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= unknown, H <= K + H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] + Loop: [0.1.0 <= 10*K + D] f36 ~> f36 [A <= A, B <= B, C <= C, D <= K + D, E <= unknown, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= unknown, H <= K + H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] + Loop: [0.1.0.0 <= 10*K + D] f36 ~> f36 [A <= A, B <= B, C <= C, D <= K + D, E <= unknown, F <= K + F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L, M <= M, N <= N, O <= O, P <= P, Q <= Q] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,0.0,0.0.0,0.1,0.1.0,0.1.0.0] f11 ~> f14 [K ~=> B] f33 ~> f36 [K ~=> D] f36 ~> f36 [huge ~=> E,D ~+> D,F ~+> F,K ~+> D,K ~+> F] f36 ~> f36 [huge ~=> G,D ~+> D,H ~+> H,K ~+> D,K ~+> H] f36 ~> f33 [C ~+> C,K ~+> C] f33 ~> f58 [E ~=> I,F ~=> J,G ~=> K,H ~=> L,K ~=> M,huge ~=> N] f14 ~> f14 [huge ~=> O,huge ~=> P,B ~+> B,K ~+> B] f14 ~> f11 [A ~+> A,K ~+> A] f11 ~> f33 [K ~=> C,K ~=> E,K ~=> F,K ~=> G,K ~=> H,K ~=> Q] f0 ~> f11 [K ~=> A,K ~=> O] f33 ~> exitus616 [] + Loop: [A ~+> 0.0,K ~*> 0.0] f11 ~> f14 [K ~=> B] f14 ~> f11 [A ~+> A,K ~+> A] f14 ~> f14 [huge ~=> O,huge ~=> P,B ~+> B,K ~+> B] + Loop: [B ~+> 0.0.0,K ~*> 0.0.0] f14 ~> f14 [huge ~=> O,huge ~=> P,B ~+> B,K ~+> B] + Loop: [C ~+> 0.1,K ~*> 0.1] f33 ~> f36 [K ~=> D] f36 ~> f33 [C ~+> C,K ~+> C] f36 ~> f36 [huge ~=> E,D ~+> D,F ~+> F,K ~+> D,K ~+> F] f36 ~> f36 [huge ~=> G,D ~+> D,H ~+> H,K ~+> D,K ~+> H] + Loop: [D ~+> 0.1.0,K ~*> 0.1.0] f36 ~> f36 [huge ~=> E,D ~+> D,F ~+> F,K ~+> D,K ~+> F] f36 ~> f36 [huge ~=> G,D ~+> D,H ~+> H,K ~+> D,K ~+> H] + Loop: [D ~+> 0.1.0.0,K ~*> 0.1.0.0] f36 ~> f36 [huge ~=> E,D ~+> D,F ~+> F,K ~+> D,K ~+> F] + Applied Processor: LareProcessor + Details: f0 ~> f58 [K ~=> A ,K ~=> B ,K ~=> C ,K ~=> D ,K ~=> E ,K ~=> F ,K ~=> G ,K ~=> H ,K ~=> I ,K ~=> J ,K ~=> K ,K ~=> L ,K ~=> M ,K ~=> O ,K ~=> Q ,huge ~=> E ,huge ~=> G ,huge ~=> I ,huge ~=> K ,huge ~=> N ,huge ~=> O ,huge ~=> P ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> C ,K ~+> D ,K ~+> F ,K ~+> H ,K ~+> J ,K ~+> L ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.1.0.0 ,K ~+> tick ,K ~*> A ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> F ,K ~*> H ,K ~*> J ,K ~*> L ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> 0.1.0.0 ,K ~*> tick ,K ~^> B ,K ~^> D ,K ~^> F ,K ~^> H ,K ~^> J ,K ~^> L ,K ~^> 0.1.0 ,K ~^> 0.1.0.0 ,K ~^> tick] f0 ~> exitus616 [K ~=> A ,K ~=> B ,K ~=> C ,K ~=> D ,K ~=> E ,K ~=> F ,K ~=> G ,K ~=> H ,K ~=> O ,K ~=> Q ,huge ~=> E ,huge ~=> G ,huge ~=> O ,huge ~=> P ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> C ,K ~+> D ,K ~+> F ,K ~+> H ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.1.0.0 ,K ~+> tick ,K ~*> A ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> F ,K ~*> H ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> 0.1.0.0 ,K ~*> tick ,K ~^> B ,K ~^> D ,K ~^> F ,K ~^> H ,K ~^> 0.1.0 ,K ~^> 0.1.0.0 ,K ~^> tick] + f11> [K ~=> B ,huge ~=> O ,huge ~=> P ,A ~+> A ,A ~+> 0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> tick ,K ~*> A ,K ~*> B ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> B ,K ~^> B] + f14> [huge ~=> O ,huge ~=> P ,B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,B ~*> B ,K ~*> B ,K ~*> 0.0.0 ,K ~*> tick] + f33> [K ~=> D ,huge ~=> E ,huge ~=> G ,C ~+> C ,C ~+> 0.1 ,C ~+> tick ,F ~+> F ,H ~+> H ,tick ~+> tick ,K ~+> C ,K ~+> D ,K ~+> F ,K ~+> H ,K ~+> 0.1.0 ,K ~+> 0.1.0.0 ,K ~+> tick ,C ~*> C ,C ~*> D ,C ~*> F ,C ~*> H ,C ~*> tick ,K ~*> C ,K ~*> D ,K ~*> F ,K ~*> H ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> 0.1.0.0 ,K ~*> tick ,C ~^> D ,K ~^> D ,K ~^> F ,K ~^> H ,K ~^> 0.1.0 ,K ~^> 0.1.0.0 ,K ~^> tick] + f36> [huge ~=> E ,huge ~=> G ,D ~+> D ,D ~+> 0.1.0 ,D ~+> 0.1.0.0 ,D ~+> tick ,F ~+> F ,H ~+> H ,tick ~+> tick ,K ~+> D ,K ~+> F ,K ~+> H ,K ~+> 0.1.0.0 ,K ~+> tick ,D ~*> D ,D ~*> F ,D ~*> H ,D ~*> 0.1.0.0 ,D ~*> tick ,K ~*> D ,K ~*> F ,K ~*> H ,K ~*> 0.1.0 ,K ~*> 0.1.0.0 ,K ~*> tick ,D ~^> D ,K ~^> D] + f36> [huge ~=> E ,D ~+> D ,D ~+> 0.1.0.0 ,D ~+> tick ,F ~+> F ,tick ~+> tick ,K ~+> D ,K ~+> F ,D ~*> D ,D ~*> F ,K ~*> D ,K ~*> F ,K ~*> 0.1.0.0 ,K ~*> tick] YES(?,O(1))