YES(?,O(1)) * Step 1: ArgumentFilter 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) [A >= 0 && 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) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= C] 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) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D && 0 >= 1 + R] 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) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D] 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) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && D >= 10] 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) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && C >= 10] 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) [B >= 0 && A + B >= 0 && A >= 0 && 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 >= 0 && A + B >= 0 && A >= 0 && 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 >= 0 && 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: ArgumentFilter [4,6,8,9,10,11,12,13,14,15] + Details: We remove following argument positions: [4,6,8,9,10,11,12,13,14,15]. * Step 2: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,F,H,Q) -> f14(A,0,C,D,F,H,Q) [A >= 0 && 9 >= A] (?,1) 1. f33(A,B,C,D,F,H,Q) -> f36(A,B,C,0,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= C] 2. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,1 + F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D && 0 >= 1 + R] 3. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,F,1 + H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D] 4. f36(A,B,C,D,F,H,Q) -> f33(A,B,1 + C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && D >= 10] 5. f33(A,B,C,D,F,H,Q) -> f58(A,B,C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && C >= 10] 6. f14(A,B,C,D,F,H,Q) -> f14(A,1 + B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && 9 >= B] (?,1) 7. f14(A,B,C,D,F,H,Q) -> f11(1 + A,B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && B >= 10] (?,1) 8. f11(A,B,C,D,F,H,Q) -> f33(A,B,0,D,0,0,1000) [A >= 0 && A >= 10] (?,1) 9. f0(A,B,C,D,F,H,Q) -> f11(0,B,C,D,F,H,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 3: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,F,H,Q) -> f14(A,0,C,D,F,H,Q) [A >= 0 && 9 >= A] (?,1) 1. f33(A,B,C,D,F,H,Q) -> f36(A,B,C,0,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= C] 2. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,1 + F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D && 0 >= 1 + R] 3. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,F,1 + H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D] 4. f36(A,B,C,D,F,H,Q) -> f33(A,B,1 + C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && D >= 10] 5. f33(A,B,C,D,F,H,Q) -> f58(A,B,C,D,F,H,Q) [H >= 0 (1,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && C >= 10] 6. f14(A,B,C,D,F,H,Q) -> f14(A,1 + B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && 9 >= B] (?,1) 7. f14(A,B,C,D,F,H,Q) -> f11(1 + A,B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && B >= 10] (?,1) 8. f11(A,B,C,D,F,H,Q) -> f33(A,B,0,D,0,0,1000) [A >= 0 && A >= 10] (1,1) 9. f0(A,B,C,D,F,H,Q) -> f11(0,B,C,D,F,H,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 4: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,F,H,Q) -> f14(A,0,C,D,F,H,Q) [A >= 0 && 9 >= A] (?,1) 1. f33(A,B,C,D,F,H,Q) -> f36(A,B,C,0,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= C] 2. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,1 + F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D && 0 >= 1 + R] 3. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,F,1 + H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D] 4. f36(A,B,C,D,F,H,Q) -> f33(A,B,1 + C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && D >= 10] 5. f33(A,B,C,D,F,H,Q) -> f58(A,B,C,D,F,H,Q) [H >= 0 (1,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && C >= 10] 6. f14(A,B,C,D,F,H,Q) -> f14(A,1 + B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && 9 >= B] (?,1) 7. f14(A,B,C,D,F,H,Q) -> f11(1 + A,B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && B >= 10] (?,1) 8. f11(A,B,C,D,F,H,Q) -> f33(A,B,0,D,0,0,1000) [A >= 0 && A >= 10] (1,1) 9. f0(A,B,C,D,F,H,Q) -> f11(0,B,C,D,F,H,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 5: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,F,H,Q) -> f14(A,0,C,D,F,H,Q) [A >= 0 && 9 >= A] (?,1) 1. f33(A,B,C,D,F,H,Q) -> f36(A,B,C,0,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= C] 2. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,1 + F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D && 0 >= 1 + R] 3. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,F,1 + H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D] 4. f36(A,B,C,D,F,H,Q) -> f33(A,B,1 + C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && D >= 10] 5. f33(A,B,C,D,F,H,Q) -> f58(A,B,C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && C >= 10] 6. f14(A,B,C,D,F,H,Q) -> f14(A,1 + B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && 9 >= B] (?,1) 7. f14(A,B,C,D,F,H,Q) -> f11(1 + A,B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && B >= 10] (?,1) 8. f11(A,B,C,D,F,H,Q) -> f33(A,B,0,D,0,0,1000) [A >= 0 && A >= 10] (?,1) 9. f0(A,B,C,D,F,H,Q) -> f11(0,B,C,D,F,H,Q) True (1,1) 10. f33(A,B,C,D,F,H,Q) -> exitus616(A,B,C,D,F,H,Q) True (?,1) Signature: {(exitus616,7);(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 6: LooptreeTransformer WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,F,H,Q) -> f14(A,0,C,D,F,H,Q) [A >= 0 && 9 >= A] (?,1) 1. f33(A,B,C,D,F,H,Q) -> f36(A,B,C,0,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= C] 2. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,1 + F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D && 0 >= 1 + R] 3. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,F,1 + H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D] 4. f36(A,B,C,D,F,H,Q) -> f33(A,B,1 + C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && D >= 10] 5. f33(A,B,C,D,F,H,Q) -> f58(A,B,C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && C >= 10] 6. f14(A,B,C,D,F,H,Q) -> f14(A,1 + B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && 9 >= B] (?,1) 7. f14(A,B,C,D,F,H,Q) -> f11(1 + A,B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && B >= 10] (?,1) 8. f11(A,B,C,D,F,H,Q) -> f33(A,B,0,D,0,0,1000) [A >= 0 && A >= 10] (?,1) 9. f0(A,B,C,D,F,H,Q) -> f11(0,B,C,D,F,H,Q) True (1,1) 10. f33(A,B,C,D,F,H,Q) -> exitus616(A,B,C,D,F,H,Q) True (?,1) Signature: {(exitus616,7);(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 7: SizeAbstraction WORST_CASE(?,O(1)) + Considered Problem: (Rules: 0. f11(A,B,C,D,F,H,Q) -> f14(A,0,C,D,F,H,Q) [A >= 0 && 9 >= A] (?,1) 1. f33(A,B,C,D,F,H,Q) -> f36(A,B,C,0,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= C] 2. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,1 + F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D && 0 >= 1 + R] 3. f36(A,B,C,D,F,H,Q) -> f36(A,B,C,1 + D,F,1 + H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && 9 >= D] 4. f36(A,B,C,D,F,H,Q) -> f33(A,B,1 + C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && D + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && D + F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && D >= 0 && C + D >= 0 && -1000 + D + Q >= 0 && 1000 + D + -1*Q >= 0 && -10 + A + D >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && D >= 10] 5. f33(A,B,C,D,F,H,Q) -> f58(A,B,C,D,F,H,Q) [H >= 0 (?,1) && F + H >= 0 && C + H >= 0 && -1000 + H + Q >= 0 && 1000 + H + -1*Q >= 0 && -10 + A + H >= 0 && F >= 0 && C + F >= 0 && -1000 + F + Q >= 0 && 1000 + F + -1*Q >= 0 && -10 + A + F >= 0 && C >= 0 && -1000 + C + Q >= 0 && 1000 + C + -1*Q >= 0 && -10 + A + C >= 0 && 1000 + -1*Q >= 0 && 990 + A + -1*Q >= 0 && -1000 + Q >= 0 && -1010 + A + Q >= 0 && -10 + A >= 0 && C >= 10] 6. f14(A,B,C,D,F,H,Q) -> f14(A,1 + B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && 9 >= B] (?,1) 7. f14(A,B,C,D,F,H,Q) -> f11(1 + A,B,C,D,F,H,Q) [B >= 0 && A + B >= 0 && A >= 0 && B >= 10] (?,1) 8. f11(A,B,C,D,F,H,Q) -> f33(A,B,0,D,0,0,1000) [A >= 0 && A >= 10] (?,1) 9. f0(A,B,C,D,F,H,Q) -> f11(0,B,C,D,F,H,Q) True (1,1) 10. f33(A,B,C,D,F,H,Q) -> exitus616(A,B,C,D,F,H,Q) True (?,1) Signature: {(exitus616,7);(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 8: FlowAbstraction WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [A,B,C,D,F,H,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, F <= F, H <= H, Q <= Q] f33 ~> f36 [A <= A, B <= B, C <= C, D <= 0*K, F <= F, H <= H, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 10*K, F <= F + Q, H <= H, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 10*K, F <= F, H <= H + Q, Q <= Q] f36 ~> f33 [A <= A, B <= B, C <= C + Q, D <= D, F <= F, H <= H, Q <= Q] f33 ~> f58 [A <= A, B <= B, C <= C, D <= D, F <= F, H <= H, Q <= Q] f14 ~> f14 [A <= A, B <= 10*K, C <= C, D <= D, F <= F, H <= H, Q <= Q] f14 ~> f11 [A <= A + B, B <= B, C <= C, D <= D, F <= F, H <= H, Q <= Q] f11 ~> f33 [A <= A, B <= B, C <= 0*K, D <= D, F <= 0*K, H <= 0*K, Q <= 1000*K] f0 ~> f11 [A <= 0*K, B <= B, C <= C, D <= D, F <= F, H <= H, Q <= Q] f33 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, F <= F, H <= H, Q <= Q] + Loop: [0.0 <= 10*K + A] f11 ~> f14 [A <= A, B <= 0*K, C <= C, D <= D, F <= F, H <= H, Q <= Q] f14 ~> f11 [A <= A + B, B <= B, C <= C, D <= D, F <= F, H <= H, Q <= Q] f14 ~> f14 [A <= A, B <= 10*K, C <= C, D <= D, F <= F, H <= H, Q <= Q] + Loop: [0.0.0 <= 10*K + B] f14 ~> f14 [A <= A, B <= 10*K, C <= C, D <= D, F <= F, H <= H, Q <= Q] + Loop: [0.1 <= 10*K + C] f33 ~> f36 [A <= A, B <= B, C <= C, D <= 0*K, F <= F, H <= H, Q <= Q] f36 ~> f33 [A <= A, B <= B, C <= C + Q, D <= D, F <= F, H <= H, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 10*K, F <= F + Q, H <= H, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 10*K, F <= F, H <= H + Q, Q <= Q] + Loop: [0.1.0 <= 10*K + D] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 10*K, F <= F + Q, H <= H, Q <= Q] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 10*K, F <= F, H <= H + Q, Q <= Q] + Loop: [0.1.0.0 <= 10*K + D] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 10*K, F <= F + Q, H <= H, Q <= Q] + Applied Processor: FlowAbstraction + Details: () * Step 9: LareProcessor WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,F,H,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 [K ~=> D,F ~+> F,Q ~+> F] f36 ~> f36 [K ~=> D,H ~+> H,Q ~+> H] f36 ~> f33 [C ~+> C,Q ~+> C] f33 ~> f58 [] f14 ~> f14 [K ~=> B] f14 ~> f11 [A ~+> A,B ~+> A] f11 ~> f33 [K ~=> C,K ~=> F,K ~=> H,K ~=> Q] f0 ~> f11 [K ~=> A] f33 ~> exitus616 [] + Loop: [A ~+> 0.0,K ~*> 0.0] f11 ~> f14 [K ~=> B] f14 ~> f11 [A ~+> A,B ~+> A] f14 ~> f14 [K ~=> B] + Loop: [B ~+> 0.0.0,K ~*> 0.0.0] f14 ~> f14 [K ~=> B] + Loop: [C ~+> 0.1,K ~*> 0.1] f33 ~> f36 [K ~=> D] f36 ~> f33 [C ~+> C,Q ~+> C] f36 ~> f36 [K ~=> D,F ~+> F,Q ~+> F] f36 ~> f36 [K ~=> D,H ~+> H,Q ~+> H] + Loop: [D ~+> 0.1.0,K ~*> 0.1.0] f36 ~> f36 [K ~=> D,F ~+> F,Q ~+> F] f36 ~> f36 [K ~=> D,H ~+> H,Q ~+> H] + Loop: [D ~+> 0.1.0.0,K ~*> 0.1.0.0] f36 ~> f36 [K ~=> D,F ~+> F,Q ~+> F] + Applied Processor: LareProcessor + Details: f0 ~> f58 [K ~=> A ,K ~=> B ,K ~=> C ,K ~=> D ,K ~=> F ,K ~=> H ,K ~=> Q ,tick ~+> tick ,K ~+> A ,K ~+> C ,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 ~*> C ,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] f0 ~> exitus616 [K ~=> A ,K ~=> B ,K ~=> C ,K ~=> D ,K ~=> F ,K ~=> H ,K ~=> Q ,tick ~+> tick ,K ~+> A ,K ~+> C ,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 ~*> C ,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] + f11> [K ~=> B ,A ~+> A ,A ~+> 0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> tick ,K ~*> A ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + f14> [K ~=> B,B ~+> 0.0.0,B ~+> tick,tick ~+> tick,K ~*> 0.0.0,K ~*> tick] + f33> [K ~=> D ,C ~+> C ,C ~+> 0.1 ,C ~+> tick ,F ~+> F ,H ~+> H ,Q ~+> C ,Q ~+> F ,Q ~+> H ,tick ~+> tick ,K ~+> 0.1.0 ,K ~+> 0.1.0.0 ,K ~+> tick ,C ~*> C ,C ~*> F ,C ~*> H ,C ~*> tick ,Q ~*> C ,Q ~*> F ,Q ~*> H ,K ~*> C ,K ~*> F ,K ~*> H ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> 0.1.0.0 ,K ~*> tick] + f36> [K ~=> D ,D ~+> 0.1.0 ,D ~+> 0.1.0.0 ,D ~+> tick ,F ~+> F ,H ~+> H ,Q ~+> F ,Q ~+> H ,tick ~+> tick ,K ~+> 0.1.0.0 ,K ~+> tick ,D ~*> F ,D ~*> H ,D ~*> tick ,Q ~*> F ,Q ~*> H ,K ~*> F ,K ~*> H ,K ~*> 0.1.0 ,K ~*> 0.1.0.0 ,K ~*> tick] + f36> [K ~=> D ,D ~+> 0.1.0.0 ,D ~+> tick ,F ~+> F ,Q ~+> F ,tick ~+> tick ,D ~*> F ,Q ~*> F ,K ~*> F ,K ~*> 0.1.0.0 ,K ~*> tick] YES(?,O(1))