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