YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f61(5,17,0,0,E,F,G) True (1,1) 1. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + C,E,F,G) [A >= 1 + D && C = D] (?,1) 2. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && C >= 1 + D] (?,1) 3. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && D >= 1 + C] (?,1) 4. f69(A,B,C,D,E,F,G) -> f72(A,B,C,D,0,F,G) [A >= 1 + D] (?,1) 5. f72(A,B,C,D,E,F,G) -> f72(A,B,C,D,1 + E,H,I) [B >= 1 + E] (?,1) 6. f83(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,H,I) [B >= 1 + D] (?,1) 7. f83(A,B,C,D,E,F,G) -> f83(A,B,C,1 + D,E,H,I) [B >= 1 + D] (?,1) 8. f93(A,B,C,D,E,F,G) -> f93(A,B,C,1 + D,E,F,G) [A >= 1 + D] (?,1) 9. f93(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,F,G) [D >= A] (?,1) 10. f83(A,B,C,D,E,F,G) -> f93(A,B,C,0,E,F,G) [D >= B] (?,1) 11. f72(A,B,C,D,E,F,G) -> f69(A,B,C,1 + D,E,F,G) [E >= B] (?,1) 12. f69(A,B,C,D,E,F,G) -> f83(A,B,C,0,E,F,G) [D >= A] (?,1) 13. f61(A,B,C,D,E,F,G) -> f69(A,B,C,0,E,F,G) [D >= A] (?,1) Signature: {(f0,7);(f61,7);(f69,7);(f72,7);(f83,7);(f89,7);(f93,7)} Flow Graph: [0->{1,2,3,13},1->{1,2,3,13},2->{1,2,3,13},3->{1,2,3,13},4->{5,11},5->{5,11},6->{},7->{6,7,10},8->{8,9} ,9->{},10->{8,9},11->{4,12},12->{6,7,10},13->{4,12}] + 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. f0(A,B,C,D,E,F,G) -> f61(5,17,0,0,E,F,G) True (1,1) 1. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + C,E,F,G) [A >= 1 + D && C = D] (?,1) 2. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && C >= 1 + D] (?,1) 3. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && D >= 1 + C] (?,1) 4. f69(A,B,C,D,E,F,G) -> f72(A,B,C,D,0,F,G) [A >= 1 + D] (?,1) 5. f72(A,B,C,D,E,F,G) -> f72(A,B,C,D,1 + E,H,I) [B >= 1 + E] (?,1) 6. f83(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,H,I) [B >= 1 + D] (1,1) 7. f83(A,B,C,D,E,F,G) -> f83(A,B,C,1 + D,E,H,I) [B >= 1 + D] (?,1) 8. f93(A,B,C,D,E,F,G) -> f93(A,B,C,1 + D,E,F,G) [A >= 1 + D] (?,1) 9. f93(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,F,G) [D >= A] (1,1) 10. f83(A,B,C,D,E,F,G) -> f93(A,B,C,0,E,F,G) [D >= B] (1,1) 11. f72(A,B,C,D,E,F,G) -> f69(A,B,C,1 + D,E,F,G) [E >= B] (?,1) 12. f69(A,B,C,D,E,F,G) -> f83(A,B,C,0,E,F,G) [D >= A] (1,1) 13. f61(A,B,C,D,E,F,G) -> f69(A,B,C,0,E,F,G) [D >= A] (1,1) Signature: {(f0,7);(f61,7);(f69,7);(f72,7);(f83,7);(f89,7);(f93,7)} Flow Graph: [0->{1,2,3,13},1->{1,2,3,13},2->{1,2,3,13},3->{1,2,3,13},4->{5,11},5->{5,11},6->{},7->{6,7,10},8->{8,9} ,9->{},10->{8,9},11->{4,12},12->{6,7,10},13->{4,12}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2),(0,3),(0,13),(1,1),(1,2),(2,3),(3,1),(3,2)] * Step 3: UnreachableRules WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f61(5,17,0,0,E,F,G) True (1,1) 1. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + C,E,F,G) [A >= 1 + D && C = D] (?,1) 2. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && C >= 1 + D] (?,1) 3. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && D >= 1 + C] (?,1) 4. f69(A,B,C,D,E,F,G) -> f72(A,B,C,D,0,F,G) [A >= 1 + D] (?,1) 5. f72(A,B,C,D,E,F,G) -> f72(A,B,C,D,1 + E,H,I) [B >= 1 + E] (?,1) 6. f83(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,H,I) [B >= 1 + D] (1,1) 7. f83(A,B,C,D,E,F,G) -> f83(A,B,C,1 + D,E,H,I) [B >= 1 + D] (?,1) 8. f93(A,B,C,D,E,F,G) -> f93(A,B,C,1 + D,E,F,G) [A >= 1 + D] (?,1) 9. f93(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,F,G) [D >= A] (1,1) 10. f83(A,B,C,D,E,F,G) -> f93(A,B,C,0,E,F,G) [D >= B] (1,1) 11. f72(A,B,C,D,E,F,G) -> f69(A,B,C,1 + D,E,F,G) [E >= B] (?,1) 12. f69(A,B,C,D,E,F,G) -> f83(A,B,C,0,E,F,G) [D >= A] (1,1) 13. f61(A,B,C,D,E,F,G) -> f69(A,B,C,0,E,F,G) [D >= A] (1,1) Signature: {(f0,7);(f61,7);(f69,7);(f72,7);(f83,7);(f89,7);(f93,7)} Flow Graph: [0->{1},1->{3,13},2->{1,2,13},3->{3,13},4->{5,11},5->{5,11},6->{},7->{6,7,10},8->{8,9},9->{},10->{8,9} ,11->{4,12},12->{6,7,10},13->{4,12}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [2] * Step 4: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f61(5,17,0,0,E,F,G) True (1,1) 1. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + C,E,F,G) [A >= 1 + D && C = D] (?,1) 3. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && D >= 1 + C] (?,1) 4. f69(A,B,C,D,E,F,G) -> f72(A,B,C,D,0,F,G) [A >= 1 + D] (?,1) 5. f72(A,B,C,D,E,F,G) -> f72(A,B,C,D,1 + E,H,I) [B >= 1 + E] (?,1) 6. f83(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,H,I) [B >= 1 + D] (1,1) 7. f83(A,B,C,D,E,F,G) -> f83(A,B,C,1 + D,E,H,I) [B >= 1 + D] (?,1) 8. f93(A,B,C,D,E,F,G) -> f93(A,B,C,1 + D,E,F,G) [A >= 1 + D] (?,1) 9. f93(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,F,G) [D >= A] (1,1) 10. f83(A,B,C,D,E,F,G) -> f93(A,B,C,0,E,F,G) [D >= B] (1,1) 11. f72(A,B,C,D,E,F,G) -> f69(A,B,C,1 + D,E,F,G) [E >= B] (?,1) 12. f69(A,B,C,D,E,F,G) -> f83(A,B,C,0,E,F,G) [D >= A] (1,1) 13. f61(A,B,C,D,E,F,G) -> f69(A,B,C,0,E,F,G) [D >= A] (1,1) Signature: {(f0,7);(f61,7);(f69,7);(f72,7);(f83,7);(f89,7);(f93,7)} Flow Graph: [0->{1},1->{3,13},3->{3,13},4->{5,11},5->{5,11},6->{},7->{6,7,10},8->{8,9},9->{},10->{8,9},11->{4,12} ,12->{6,7,10},13->{4,12}] + Applied Processor: AddSinks + Details: () * Step 5: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f61(5,17,0,0,E,F,G) True (1,1) 1. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + C,E,F,G) [A >= 1 + D && C = D] (?,1) 3. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && D >= 1 + C] (?,1) 4. f69(A,B,C,D,E,F,G) -> f72(A,B,C,D,0,F,G) [A >= 1 + D] (?,1) 5. f72(A,B,C,D,E,F,G) -> f72(A,B,C,D,1 + E,H,I) [B >= 1 + E] (?,1) 6. f83(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,H,I) [B >= 1 + D] (?,1) 7. f83(A,B,C,D,E,F,G) -> f83(A,B,C,1 + D,E,H,I) [B >= 1 + D] (?,1) 8. f93(A,B,C,D,E,F,G) -> f93(A,B,C,1 + D,E,F,G) [A >= 1 + D] (?,1) 9. f93(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,F,G) [D >= A] (?,1) 10. f83(A,B,C,D,E,F,G) -> f93(A,B,C,0,E,F,G) [D >= B] (?,1) 11. f72(A,B,C,D,E,F,G) -> f69(A,B,C,1 + D,E,F,G) [E >= B] (?,1) 12. f69(A,B,C,D,E,F,G) -> f83(A,B,C,0,E,F,G) [D >= A] (?,1) 13. f61(A,B,C,D,E,F,G) -> f69(A,B,C,0,E,F,G) [D >= A] (?,1) 14. f93(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) 15. f83(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) Signature: {(exitus616,7);(f0,7);(f61,7);(f69,7);(f72,7);(f83,7);(f89,7);(f93,7)} Flow Graph: [0->{1,3,13},1->{1,3,13},3->{1,3,13},4->{5,11},5->{5,11},6->{},7->{6,7,10,15},8->{8,9,14},9->{},10->{8,9 ,14},11->{4,12},12->{6,7,10,15},13->{4,12},14->{},15->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,3),(0,13),(1,1),(3,1)] * Step 6: LooptreeTransformer WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f61(5,17,0,0,E,F,G) True (1,1) 1. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + C,E,F,G) [A >= 1 + D && C = D] (?,1) 3. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && D >= 1 + C] (?,1) 4. f69(A,B,C,D,E,F,G) -> f72(A,B,C,D,0,F,G) [A >= 1 + D] (?,1) 5. f72(A,B,C,D,E,F,G) -> f72(A,B,C,D,1 + E,H,I) [B >= 1 + E] (?,1) 6. f83(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,H,I) [B >= 1 + D] (?,1) 7. f83(A,B,C,D,E,F,G) -> f83(A,B,C,1 + D,E,H,I) [B >= 1 + D] (?,1) 8. f93(A,B,C,D,E,F,G) -> f93(A,B,C,1 + D,E,F,G) [A >= 1 + D] (?,1) 9. f93(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,F,G) [D >= A] (?,1) 10. f83(A,B,C,D,E,F,G) -> f93(A,B,C,0,E,F,G) [D >= B] (?,1) 11. f72(A,B,C,D,E,F,G) -> f69(A,B,C,1 + D,E,F,G) [E >= B] (?,1) 12. f69(A,B,C,D,E,F,G) -> f83(A,B,C,0,E,F,G) [D >= A] (?,1) 13. f61(A,B,C,D,E,F,G) -> f69(A,B,C,0,E,F,G) [D >= A] (?,1) 14. f93(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) 15. f83(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) Signature: {(exitus616,7);(f0,7);(f61,7);(f69,7);(f72,7);(f83,7);(f89,7);(f93,7)} Flow Graph: [0->{1},1->{3,13},3->{3,13},4->{5,11},5->{5,11},6->{},7->{6,7,10,15},8->{8,9,14},9->{},10->{8,9,14},11->{4 ,12},12->{6,7,10,15},13->{4,12},14->{},15->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,3,4,5,6,7,8,9,10,11,12,13,14,15] | +- p:[3] c: [3] | +- p:[4,11,5] c: [4] | | | `- p:[5] c: [5] | +- p:[7] c: [7] | `- p:[8] c: [8] * Step 7: SizeAbstraction WORST_CASE(?,O(1)) + Considered Problem: (Rules: 0. f0(A,B,C,D,E,F,G) -> f61(5,17,0,0,E,F,G) True (1,1) 1. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + C,E,F,G) [A >= 1 + D && C = D] (?,1) 3. f61(A,B,C,D,E,F,G) -> f61(A,B,C,1 + D,E,F,G) [A >= 1 + D && D >= 1 + C] (?,1) 4. f69(A,B,C,D,E,F,G) -> f72(A,B,C,D,0,F,G) [A >= 1 + D] (?,1) 5. f72(A,B,C,D,E,F,G) -> f72(A,B,C,D,1 + E,H,I) [B >= 1 + E] (?,1) 6. f83(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,H,I) [B >= 1 + D] (?,1) 7. f83(A,B,C,D,E,F,G) -> f83(A,B,C,1 + D,E,H,I) [B >= 1 + D] (?,1) 8. f93(A,B,C,D,E,F,G) -> f93(A,B,C,1 + D,E,F,G) [A >= 1 + D] (?,1) 9. f93(A,B,C,D,E,F,G) -> f89(A,B,C,D,E,F,G) [D >= A] (?,1) 10. f83(A,B,C,D,E,F,G) -> f93(A,B,C,0,E,F,G) [D >= B] (?,1) 11. f72(A,B,C,D,E,F,G) -> f69(A,B,C,1 + D,E,F,G) [E >= B] (?,1) 12. f69(A,B,C,D,E,F,G) -> f83(A,B,C,0,E,F,G) [D >= A] (?,1) 13. f61(A,B,C,D,E,F,G) -> f69(A,B,C,0,E,F,G) [D >= A] (?,1) 14. f93(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) 15. f83(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) Signature: {(exitus616,7);(f0,7);(f61,7);(f69,7);(f72,7);(f83,7);(f89,7);(f93,7)} Flow Graph: [0->{1},1->{3,13},3->{3,13},4->{5,11},5->{5,11},6->{},7->{6,7,10,15},8->{8,9,14},9->{},10->{8,9,14},11->{4 ,12},12->{6,7,10,15},13->{4,12},14->{},15->{}] ,We construct a looptree: P: [0,1,3,4,5,6,7,8,9,10,11,12,13,14,15] | +- p:[3] c: [3] | +- p:[4,11,5] c: [4] | | | `- p:[5] c: [5] | +- p:[7] c: [7] | `- p:[8] c: [8]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 8: FlowAbstraction WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,0.0,0.1,0.1.0,0.2,0.3] f0 ~> f61 [A <= 5*K, B <= 17*K, C <= 0*K, D <= 0*K, E <= E, F <= F, G <= G] f61 ~> f61 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= G] f61 ~> f61 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= G] f69 ~> f72 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= G] f72 ~> f72 [A <= A, B <= B, C <= C, D <= D, E <= B + E, F <= unknown, G <= unknown] f83 ~> f89 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= unknown] f83 ~> f83 [A <= A, B <= B, C <= C, D <= B + D, E <= E, F <= unknown, G <= unknown] f93 ~> f93 [A <= A, B <= B, C <= C, D <= A + D, E <= E, F <= F, G <= G] f93 ~> f89 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f83 ~> f93 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= F, G <= G] f72 ~> f69 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= G] f69 ~> f83 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= F, G <= G] f61 ~> f69 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= F, G <= G] f93 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f83 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.0 <= A + D] f61 ~> f61 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= G] + Loop: [0.1 <= 2*K + A + D] f69 ~> f72 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= G] f72 ~> f69 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= G] f72 ~> f72 [A <= A, B <= B, C <= C, D <= D, E <= B + E, F <= unknown, G <= unknown] + Loop: [0.1.0 <= B + E] f72 ~> f72 [A <= A, B <= B, C <= C, D <= D, E <= B + E, F <= unknown, G <= unknown] + Loop: [0.2 <= B + D] f83 ~> f83 [A <= A, B <= B, C <= C, D <= B + D, E <= E, F <= unknown, G <= unknown] + Loop: [0.3 <= A + D] f93 ~> f93 [A <= A, B <= B, C <= C, D <= A + D, E <= E, F <= F, G <= G] + Applied Processor: FlowAbstraction + Details: () * Step 9: LareProcessor WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,0.0,0.1,0.1.0,0.2,0.3] f0 ~> f61 [K ~=> A,K ~=> B,K ~=> C,K ~=> D] f61 ~> f61 [D ~+> D,K ~+> D] f61 ~> f61 [D ~+> D,K ~+> D] f69 ~> f72 [K ~=> E] f72 ~> f72 [huge ~=> F,huge ~=> G,B ~+> E,E ~+> E] f83 ~> f89 [huge ~=> F,huge ~=> G] f83 ~> f83 [huge ~=> F,huge ~=> G,B ~+> D,D ~+> D] f93 ~> f93 [A ~+> D,D ~+> D] f93 ~> f89 [] f83 ~> f93 [K ~=> D] f72 ~> f69 [D ~+> D,K ~+> D] f69 ~> f83 [K ~=> D] f61 ~> f69 [K ~=> D] f93 ~> exitus616 [] f83 ~> exitus616 [] + Loop: [A ~+> 0.0,D ~+> 0.0] f61 ~> f61 [D ~+> D,K ~+> D] + Loop: [A ~+> 0.1,D ~+> 0.1,K ~*> 0.1] f69 ~> f72 [K ~=> E] f72 ~> f69 [D ~+> D,K ~+> D] f72 ~> f72 [huge ~=> F,huge ~=> G,B ~+> E,E ~+> E] + Loop: [B ~+> 0.1.0,E ~+> 0.1.0] f72 ~> f72 [huge ~=> F,huge ~=> G,B ~+> E,E ~+> E] + Loop: [B ~+> 0.2,D ~+> 0.2] f83 ~> f83 [huge ~=> F,huge ~=> G,B ~+> D,D ~+> D] + Loop: [A ~+> 0.3,D ~+> 0.3] f93 ~> f93 [A ~+> D,D ~+> D] + Applied Processor: LareProcessor + Details: f0 ~> f89 [K ~=> A ,K ~=> B ,K ~=> C ,K ~=> D ,K ~=> E ,huge ~=> F ,huge ~=> G ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.2 ,K ~+> 0.3 ,K ~+> tick ,K ~*> D ,K ~*> E ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> 0.2 ,K ~*> 0.3 ,K ~*> tick ,K ~^> E] f0 ~> exitus616 [K ~=> A ,K ~=> B ,K ~=> C ,K ~=> D ,K ~=> E ,huge ~=> F ,huge ~=> G ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.2 ,K ~+> 0.3 ,K ~+> tick ,K ~*> D ,K ~*> E ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> 0.2 ,K ~*> 0.3 ,K ~*> tick ,K ~^> E] + f61> [A ~+> 0.0 ,A ~+> tick ,D ~+> D ,D ~+> 0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,A ~*> D ,D ~*> D ,K ~*> D] + f69> [K ~=> E ,huge ~=> F ,huge ~=> G ,A ~+> 0.1 ,A ~+> tick ,B ~+> E ,B ~+> 0.1.0 ,B ~+> tick ,D ~+> D ,D ~+> 0.1 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> 0.1.0 ,K ~+> tick ,A ~*> D ,A ~*> E ,A ~*> tick ,B ~*> E ,B ~*> 0.1.0 ,B ~*> tick ,D ~*> D ,D ~*> E ,D ~*> tick ,K ~*> D ,K ~*> E ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> tick ,A ~^> E ,D ~^> E ,K ~^> E] + f72> [huge ~=> F ,huge ~=> G ,B ~+> E ,B ~+> 0.1.0 ,B ~+> tick ,E ~+> E ,E ~+> 0.1.0 ,E ~+> tick ,tick ~+> tick ,B ~*> E ,E ~*> E] + f83> [huge ~=> F ,huge ~=> G ,B ~+> D ,B ~+> 0.2 ,B ~+> tick ,D ~+> D ,D ~+> 0.2 ,D ~+> tick ,tick ~+> tick ,B ~*> D ,D ~*> D] + f93> [A ~+> D,A ~+> 0.3,A ~+> tick,D ~+> D,D ~+> 0.3,D ~+> tick,tick ~+> tick,A ~*> D,D ~*> D] YES(?,O(1))