YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. evalEx1start(A,B,C,D) -> evalEx1entryin(A,B,C,D) True (1,1) 1. evalEx1entryin(A,B,C,D) -> evalEx1bb6in(0,A,C,D) True (?,1) 2. evalEx1bb6in(A,B,C,D) -> evalEx1bbin(A,B,C,D) [A >= 0 && B >= 1 + A] (?,1) 3. evalEx1bb6in(A,B,C,D) -> evalEx1returnin(A,B,C,D) [A >= 0 && A >= B] (?,1) 4. evalEx1bbin(A,B,C,D) -> evalEx1bb4in(A,B,1 + A,B) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalEx1bb4in(A,B,C,D) -> evalEx1bb1in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1 + C] 6. evalEx1bb4in(A,B,C,D) -> evalEx1bb5in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= D] 7. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + E] 8. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= 1] 9. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,1 + C,D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalEx1bb5in(A,B,C,D) -> evalEx1bb6in(1 + A,D,C,D) [C + -1*D >= 0 (?,1) && B + -1*D >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] 11. evalEx1returnin(A,B,C,D) -> evalEx1stop(A,B,C,D) [A + -1*B >= 0 && A >= 0] (?,1) Signature: {(evalEx1bb1in,4) ;(evalEx1bb4in,4) ;(evalEx1bb5in,4) ;(evalEx1bb6in,4) ;(evalEx1bbin,4) ;(evalEx1entryin,4) ;(evalEx1returnin,4) ;(evalEx1start,4) ;(evalEx1stop,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{5,6},5->{7,8,9},6->{10},7->{5,6},8->{5,6},9->{5,6},10->{2,3},11->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: Looptree YES + Considered Problem: Rules: 0. evalEx1start(A,B,C,D) -> evalEx1entryin(A,B,C,D) True (1,1) 1. evalEx1entryin(A,B,C,D) -> evalEx1bb6in(0,A,C,D) True (1,1) 2. evalEx1bb6in(A,B,C,D) -> evalEx1bbin(A,B,C,D) [A >= 0 && B >= 1 + A] (?,1) 3. evalEx1bb6in(A,B,C,D) -> evalEx1returnin(A,B,C,D) [A >= 0 && A >= B] (1,1) 4. evalEx1bbin(A,B,C,D) -> evalEx1bb4in(A,B,1 + A,B) [-1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalEx1bb4in(A,B,C,D) -> evalEx1bb1in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && D >= 1 + C] 6. evalEx1bb4in(A,B,C,D) -> evalEx1bb5in(A,B,C,D) [B + -1*D >= 0 (?,1) && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0 && C >= D] 7. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && 0 >= 1 + E] 8. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,C,-1 + D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= 1] 9. evalEx1bb1in(A,B,C,D) -> evalEx1bb4in(A,B,1 + C,D) [B + -1*D >= 0 (?,1) && -2 + D >= 0 && -3 + C + D >= 0 && -1 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + A + D >= 0 && -2 + -1*A + D >= 0 && -1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalEx1bb5in(A,B,C,D) -> evalEx1bb6in(1 + A,D,C,D) [C + -1*D >= 0 (?,1) && B + -1*D >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -1*C + D >= 0 && -2 + B + D >= 0 && -1 + A + D >= 0 && -1 + -1*A + D >= 0 && B + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0 && -1 + A + B >= 0 && -1 + -1*A + B >= 0 && A >= 0] 11. evalEx1returnin(A,B,C,D) -> evalEx1stop(A,B,C,D) [A + -1*B >= 0 && A >= 0] (1,1) Signature: {(evalEx1bb1in,4) ;(evalEx1bb4in,4) ;(evalEx1bb5in,4) ;(evalEx1bb6in,4) ;(evalEx1bbin,4) ;(evalEx1entryin,4) ;(evalEx1returnin,4) ;(evalEx1start,4) ;(evalEx1stop,4)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{11},4->{5,6},5->{7,8,9},6->{10},7->{5,6},8->{5,6},9->{5,6},10->{2,3},11->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | `- p:[2,10,6,4,7,5,8,9] c: [10] | `- p:[5,7,8,9] c: [9] | `- p:[5,7,8] c: [8] | `- p:[5,7] c: [7] YES