YES(?,PRIMREC) * Step 1: ArgumentFilter MAYBE + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H) -> f0(A,B,C,D,E,F,G,H) True (1,1) 1. f0(A,B,C,D,E,F,G,H) -> f58(A,B,C,D,E,F,G,H) [B >= A] (?,1) 2. f0(A,B,C,D,E,F,G,H) -> f12(A,B,0,B,E,F,G,H) [A >= 1 + B] (?,1) 3. f12(A,B,C,D,E,F,G,H) -> f35(A,B,C,B,E,F,G,H) [-1 + A + -1*B >= 0 && E >= 1 + A && B = D] (?,1) 4. f12(A,B,C,D,E,F,G,H) -> f12(A,B,J,E,1 + E,I,K,H) [-1 + A + -1*B >= 0 && A >= E && I >= 1 + K] (?,1) 5. f12(A,B,C,D,E,F,G,H) -> f12(A,B,C,D,1 + E,J,I,H) [-1 + A + -1*B >= 0 && A >= E && I >= J] (?,1) 6. f35(A,B,C,D,E,F,G,H) -> f0(A,1 + B,0,D,E,F,G,H) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C = 0] (?,1) 7. f35(A,B,C,D,E,F,G,H) -> f37(A,B,C,D,E,F,G,H) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C >= 1] (?,1) 8. f35(A,B,C,D,E,F,G,H) -> f37(A,B,C,D,E,F,G,H) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && 0 >= 1 + C] (?,1) 9. f12(A,B,C,D,E,F,G,H) -> f22(A,B,C,D,E,F,G,H) [-1 + A + -1*B >= 0 && D >= 1 + B && E >= 1 + A] (?,1) 10. f12(A,B,C,D,E,F,G,H) -> f22(A,B,C,D,E,F,G,H) [-1 + A + -1*B >= 0 && B >= 1 + D && E >= 1 + A] (?,1) 11. f22(A,B,C,D,E,F,G,H) -> f29(A,B,C,D,E,F,G,H) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] (?,1) 12. f37(A,B,C,D,E,F,G,H) -> f0(A,1 + B,C,D,E,F,G,H) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && D >= 1 + A] (?,1) 13. f37(A,B,C,D,E,F,G,H) -> f37(A,B,C,1 + D,E,F,G,0) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D] (?,1) 14. f37(A,B,C,D,E,F,G,H) -> f43(A,B,C,D,E,F,G,J) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && I >= 1] (?,1) 15. f37(A,B,C,D,E,F,G,H) -> f43(A,B,C,D,E,F,G,J) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && 0 >= 1 + I] (?,1) 16. f29(A,B,C,D,E,F,G,H) -> f35(A,B,C,D,E,F,G,H) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] (?,1) 17. f43(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [-1 + -1*D + E >= 0 (?,1) && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] 18. f48(A,B,C,D,E,F,G,H) -> f37(A,B,C,1 + D,E,F,G,H) [-1 + -1*D + E >= 0 (?,1) && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] Signature: {(f0,8);(f12,8);(f22,8);(f29,8);(f35,8);(f37,8);(f43,8);(f48,8);(f58,8);(start,8)} Flow Graph: [0->{1,2},1->{},2->{3,4,5,9,10},3->{6,7,8},4->{3,4,5,9,10},5->{3,4,5,9,10},6->{1,2},7->{12,13,14,15} ,8->{12,13,14,15},9->{11},10->{11},11->{16},12->{1,2},13->{12,13,14,15},14->{17},15->{17},16->{6,7,8} ,17->{18},18->{12,13,14,15}] + Applied Processor: ArgumentFilter [5,6,7] + Details: We remove following argument positions: [5,6,7]. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. start(A,B,C,D,E) -> f0(A,B,C,D,E) True (1,1) 1. f0(A,B,C,D,E) -> f58(A,B,C,D,E) [B >= A] (?,1) 2. f0(A,B,C,D,E) -> f12(A,B,0,B,E) [A >= 1 + B] (?,1) 3. f12(A,B,C,D,E) -> f35(A,B,C,B,E) [-1 + A + -1*B >= 0 && E >= 1 + A && B = D] (?,1) 4. f12(A,B,C,D,E) -> f12(A,B,J,E,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= 1 + K] (?,1) 5. f12(A,B,C,D,E) -> f12(A,B,C,D,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= J] (?,1) 6. f35(A,B,C,D,E) -> f0(A,1 + B,0,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C = 0] (?,1) 7. f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C >= 1] (?,1) 8. f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && 0 >= 1 + C] (?,1) 9. f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && D >= 1 + B && E >= 1 + A] (?,1) 10. f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && B >= 1 + D && E >= 1 + A] (?,1) 11. f22(A,B,C,D,E) -> f29(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] (?,1) 12. f37(A,B,C,D,E) -> f0(A,1 + B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && D >= 1 + A] (?,1) 13. f37(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D] (?,1) 14. f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && I >= 1] (?,1) 15. f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && 0 >= 1 + I] (?,1) 16. f29(A,B,C,D,E) -> f35(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] (?,1) 17. f43(A,B,C,D,E) -> f48(A,B,C,D,E) [-1 + -1*D + E >= 0 (?,1) && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] 18. f48(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-1 + -1*D + E >= 0 (?,1) && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] Signature: {(f0,8);(f12,8);(f22,8);(f29,8);(f35,8);(f37,8);(f43,8);(f48,8);(f58,8);(start,8)} Flow Graph: [0->{1,2},1->{},2->{3,4,5,9,10},3->{6,7,8},4->{3,4,5,9,10},5->{3,4,5,9,10},6->{1,2},7->{12,13,14,15} ,8->{12,13,14,15},9->{11},10->{11},11->{16},12->{1,2},13->{12,13,14,15},14->{17},15->{17},16->{6,7,8} ,17->{18},18->{12,13,14,15}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,9),(2,10),(4,3),(4,10)] * Step 3: FromIts MAYBE + Considered Problem: Rules: 0. start(A,B,C,D,E) -> f0(A,B,C,D,E) True (1,1) 1. f0(A,B,C,D,E) -> f58(A,B,C,D,E) [B >= A] (?,1) 2. f0(A,B,C,D,E) -> f12(A,B,0,B,E) [A >= 1 + B] (?,1) 3. f12(A,B,C,D,E) -> f35(A,B,C,B,E) [-1 + A + -1*B >= 0 && E >= 1 + A && B = D] (?,1) 4. f12(A,B,C,D,E) -> f12(A,B,J,E,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= 1 + K] (?,1) 5. f12(A,B,C,D,E) -> f12(A,B,C,D,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= J] (?,1) 6. f35(A,B,C,D,E) -> f0(A,1 + B,0,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C = 0] (?,1) 7. f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C >= 1] (?,1) 8. f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && 0 >= 1 + C] (?,1) 9. f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && D >= 1 + B && E >= 1 + A] (?,1) 10. f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && B >= 1 + D && E >= 1 + A] (?,1) 11. f22(A,B,C,D,E) -> f29(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] (?,1) 12. f37(A,B,C,D,E) -> f0(A,1 + B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && D >= 1 + A] (?,1) 13. f37(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D] (?,1) 14. f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && I >= 1] (?,1) 15. f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && 0 >= 1 + I] (?,1) 16. f29(A,B,C,D,E) -> f35(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] (?,1) 17. f43(A,B,C,D,E) -> f48(A,B,C,D,E) [-1 + -1*D + E >= 0 (?,1) && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] 18. f48(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-1 + -1*D + E >= 0 (?,1) && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] Signature: {(f0,8);(f12,8);(f22,8);(f29,8);(f35,8);(f37,8);(f43,8);(f48,8);(f58,8);(start,8)} Flow Graph: [0->{1,2},1->{},2->{3,4,5},3->{6,7,8},4->{4,5,9},5->{3,4,5,9,10},6->{1,2},7->{12,13,14,15},8->{12,13,14 ,15},9->{11},10->{11},11->{16},12->{1,2},13->{12,13,14,15},14->{17},15->{17},16->{6,7,8},17->{18},18->{12,13 ,14,15}] + Applied Processor: FromIts + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: start(A,B,C,D,E) -> f0(A,B,C,D,E) True f0(A,B,C,D,E) -> f58(A,B,C,D,E) [B >= A] f0(A,B,C,D,E) -> f12(A,B,0,B,E) [A >= 1 + B] f12(A,B,C,D,E) -> f35(A,B,C,B,E) [-1 + A + -1*B >= 0 && E >= 1 + A && B = D] f12(A,B,C,D,E) -> f12(A,B,J,E,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= 1 + K] f12(A,B,C,D,E) -> f12(A,B,C,D,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= J] f35(A,B,C,D,E) -> f0(A,1 + B,0,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C = 0] f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C >= 1] f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && 0 >= 1 + C] f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && D >= 1 + B && E >= 1 + A] f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && B >= 1 + D && E >= 1 + A] f22(A,B,C,D,E) -> f29(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f37(A,B,C,D,E) -> f0(A,1 + B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && D >= 1 + A] f37(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D] f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && I >= 1] f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && 0 >= 1 + I] f29(A,B,C,D,E) -> f35(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f43(A,B,C,D,E) -> f48(A,B,C,D,E) [-1 + -1*D + E >= 0 && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f48(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-1 + -1*D + E >= 0 && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] Signature: {(f0,8);(f12,8);(f22,8);(f29,8);(f35,8);(f37,8);(f43,8);(f48,8);(f58,8);(start,8)} Rule Graph: [0->{1,2},1->{},2->{3,4,5},3->{6,7,8},4->{4,5,9},5->{3,4,5,9,10},6->{1,2},7->{12,13,14,15},8->{12,13,14 ,15},9->{11},10->{11},11->{16},12->{1,2},13->{12,13,14,15},14->{17},15->{17},16->{6,7,8},17->{18},18->{12,13 ,14,15}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose MAYBE + Considered Problem: Rules: start(A,B,C,D,E) -> f0(A,B,C,D,E) True f0(A,B,C,D,E) -> f58(A,B,C,D,E) [B >= A] f0(A,B,C,D,E) -> f12(A,B,0,B,E) [A >= 1 + B] f12(A,B,C,D,E) -> f35(A,B,C,B,E) [-1 + A + -1*B >= 0 && E >= 1 + A && B = D] f12(A,B,C,D,E) -> f12(A,B,J,E,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= 1 + K] f12(A,B,C,D,E) -> f12(A,B,C,D,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= J] f35(A,B,C,D,E) -> f0(A,1 + B,0,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C = 0] f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C >= 1] f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && 0 >= 1 + C] f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && D >= 1 + B && E >= 1 + A] f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && B >= 1 + D && E >= 1 + A] f22(A,B,C,D,E) -> f29(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f37(A,B,C,D,E) -> f0(A,1 + B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && D >= 1 + A] f37(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D] f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && I >= 1] f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && 0 >= 1 + I] f29(A,B,C,D,E) -> f35(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f43(A,B,C,D,E) -> f48(A,B,C,D,E) [-1 + -1*D + E >= 0 && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f48(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-1 + -1*D + E >= 0 && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f58(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(exitus616,5);(f0,8);(f12,8);(f22,8);(f29,8);(f35,8);(f37,8);(f43,8);(f48,8);(f58,8);(start,8)} Rule Graph: [0->{1,2},1->{19},2->{3,4,5},3->{6,7,8},4->{4,5,9},5->{3,4,5,9,10},6->{1,2},7->{12,13,14,15},8->{12,13,14 ,15},9->{11},10->{11},11->{16},12->{1,2},13->{12,13,14,15},14->{17},15->{17},16->{6,7,8},17->{18},18->{12,13 ,14,15}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19] | `- p:[2,6,3,5,4,16,11,9,10,12,7,8,13,18,17,14,15] c: [2,3,4,5,6,7,8,9,10,11,12,16] | `- p:[13,18,17,14,15] c: [13,14,15,17,18] * Step 6: AbstractSize MAYBE + Considered Problem: (Rules: start(A,B,C,D,E) -> f0(A,B,C,D,E) True f0(A,B,C,D,E) -> f58(A,B,C,D,E) [B >= A] f0(A,B,C,D,E) -> f12(A,B,0,B,E) [A >= 1 + B] f12(A,B,C,D,E) -> f35(A,B,C,B,E) [-1 + A + -1*B >= 0 && E >= 1 + A && B = D] f12(A,B,C,D,E) -> f12(A,B,J,E,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= 1 + K] f12(A,B,C,D,E) -> f12(A,B,C,D,1 + E) [-1 + A + -1*B >= 0 && A >= E && I >= J] f35(A,B,C,D,E) -> f0(A,1 + B,0,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C = 0] f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && C >= 1] f35(A,B,C,D,E) -> f37(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && 0 >= 1 + C] f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && D >= 1 + B && E >= 1 + A] f12(A,B,C,D,E) -> f22(A,B,C,D,E) [-1 + A + -1*B >= 0 && B >= 1 + D && E >= 1 + A] f22(A,B,C,D,E) -> f29(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f37(A,B,C,D,E) -> f0(A,1 + B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && D >= 1 + A] f37(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D] f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && I >= 1] f37(A,B,C,D,E) -> f43(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && A >= D && 0 >= 1 + I] f29(A,B,C,D,E) -> f35(A,B,C,D,E) [-2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f43(A,B,C,D,E) -> f48(A,B,C,D,E) [-1 + -1*D + E >= 0 && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f48(A,B,C,D,E) -> f37(A,B,C,1 + D,E) [-1 + -1*D + E >= 0 && -2 + -1*B + E >= 0 && -1 + -1*A + E >= 0 && A + -1*D >= 0 && -1 + A + -1*B >= 0 && E >= 1 + A] f58(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(exitus616,5);(f0,8);(f12,8);(f22,8);(f29,8);(f35,8);(f37,8);(f43,8);(f48,8);(f58,8);(start,8)} Rule Graph: [0->{1,2},1->{19},2->{3,4,5},3->{6,7,8},4->{4,5,9},5->{3,4,5,9,10},6->{1,2},7->{12,13,14,15},8->{12,13,14 ,15},9->{11},10->{11},11->{16},12->{1,2},13->{12,13,14,15},14->{17},15->{17},16->{6,7,8},17->{18},18->{12,13 ,14,15}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19] | `- p:[2,6,3,5,4,16,11,9,10,12,7,8,13,18,17,14,15] c: [2,3,4,5,6,7,8,9,10,11,12,16] | `- p:[13,18,17,14,15] c: [13,14,15,17,18]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,0.0,0.0.0] start ~> f0 [A <= A, B <= B, C <= C, D <= D, E <= E] f0 ~> f58 [A <= A, B <= B, C <= C, D <= D, E <= E] f0 ~> f12 [A <= A, B <= B, C <= 0*K, D <= B, E <= E] f12 ~> f35 [A <= A, B <= B, C <= C, D <= B, E <= E] f12 ~> f12 [A <= A, B <= B, C <= unknown, D <= E, E <= K + E] f12 ~> f12 [A <= A, B <= B, C <= C, D <= D, E <= K + E] f35 ~> f0 [A <= A, B <= B + E, C <= 0*K, D <= D, E <= E] f35 ~> f37 [A <= A, B <= B, C <= C, D <= D, E <= E] f35 ~> f37 [A <= A, B <= B, C <= C, D <= D, E <= E] f12 ~> f22 [A <= A, B <= B, C <= C, D <= D, E <= E] f12 ~> f22 [A <= A, B <= B, C <= C, D <= D, E <= E] f22 ~> f29 [A <= A, B <= B, C <= C, D <= D, E <= E] f37 ~> f0 [A <= A, B <= A + B, C <= C, D <= D, E <= E] f37 ~> f37 [A <= A, B <= B, C <= C, D <= D + E, E <= E] f37 ~> f43 [A <= A, B <= B, C <= C, D <= D, E <= E] f37 ~> f43 [A <= A, B <= B, C <= C, D <= D, E <= E] f29 ~> f35 [A <= A, B <= B, C <= C, D <= D, E <= E] f43 ~> f48 [A <= A, B <= B, C <= C, D <= D, E <= E] f48 ~> f37 [A <= A, B <= B, C <= C, D <= D + E, E <= E] f58 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0 <= K + A + B + E] f0 ~> f12 [A <= A, B <= B, C <= 0*K, D <= B, E <= E] f35 ~> f0 [A <= A, B <= B + E, C <= 0*K, D <= D, E <= E] f12 ~> f35 [A <= A, B <= B, C <= C, D <= B, E <= E] f12 ~> f12 [A <= A, B <= B, C <= C, D <= D, E <= K + E] f12 ~> f12 [A <= A, B <= B, C <= unknown, D <= E, E <= K + E] f29 ~> f35 [A <= A, B <= B, C <= C, D <= D, E <= E] f22 ~> f29 [A <= A, B <= B, C <= C, D <= D, E <= E] f12 ~> f22 [A <= A, B <= B, C <= C, D <= D, E <= E] f12 ~> f22 [A <= A, B <= B, C <= C, D <= D, E <= E] f37 ~> f0 [A <= A, B <= A + B, C <= C, D <= D, E <= E] f35 ~> f37 [A <= A, B <= B, C <= C, D <= D, E <= E] f35 ~> f37 [A <= A, B <= B, C <= C, D <= D, E <= E] f37 ~> f37 [A <= A, B <= B, C <= C, D <= D + E, E <= E] f48 ~> f37 [A <= A, B <= B, C <= C, D <= D + E, E <= E] f43 ~> f48 [A <= A, B <= B, C <= C, D <= D, E <= E] f37 ~> f43 [A <= A, B <= B, C <= C, D <= D, E <= E] f37 ~> f43 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0.0 <= A + D] f37 ~> f37 [A <= A, B <= B, C <= C, D <= D + E, E <= E] f48 ~> f37 [A <= A, B <= B, C <= C, D <= D + E, E <= E] f43 ~> f48 [A <= A, B <= B, C <= C, D <= D, E <= E] f37 ~> f43 [A <= A, B <= B, C <= C, D <= D, E <= E] f37 ~> f43 [A <= A, B <= B, C <= C, D <= D, E <= E] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0,0.0.0] start ~> f0 [] f0 ~> f58 [] f0 ~> f12 [B ~=> D,K ~=> C] f12 ~> f35 [B ~=> D] f12 ~> f12 [E ~=> D,huge ~=> C,E ~+> E,K ~+> E] f12 ~> f12 [E ~+> E,K ~+> E] f35 ~> f0 [K ~=> C,B ~+> B,E ~+> B] f35 ~> f37 [] f35 ~> f37 [] f12 ~> f22 [] f12 ~> f22 [] f22 ~> f29 [] f37 ~> f0 [A ~+> B,B ~+> B] f37 ~> f37 [D ~+> D,E ~+> D] f37 ~> f43 [] f37 ~> f43 [] f29 ~> f35 [] f43 ~> f48 [] f48 ~> f37 [D ~+> D,E ~+> D] f58 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,E ~+> 0.0,K ~+> 0.0] f0 ~> f12 [B ~=> D,K ~=> C] f35 ~> f0 [K ~=> C,B ~+> B,E ~+> B] f12 ~> f35 [B ~=> D] f12 ~> f12 [E ~+> E,K ~+> E] f12 ~> f12 [E ~=> D,huge ~=> C,E ~+> E,K ~+> E] f29 ~> f35 [] f22 ~> f29 [] f12 ~> f22 [] f12 ~> f22 [] f37 ~> f0 [A ~+> B,B ~+> B] f35 ~> f37 [] f35 ~> f37 [] f37 ~> f37 [D ~+> D,E ~+> D] f48 ~> f37 [D ~+> D,E ~+> D] f43 ~> f48 [] f37 ~> f43 [] f37 ~> f43 [] + Loop: [A ~+> 0.0.0,D ~+> 0.0.0] f37 ~> f37 [D ~+> D,E ~+> D] f48 ~> f37 [D ~+> D,E ~+> D] f43 ~> f48 [] f37 ~> f43 [] f37 ~> f43 [] + Applied Processor: Lare + Details: start ~> exitus616 [B ~=> D ,E ~=> D ,K ~=> C ,huge ~=> C ,A ~+> B ,A ~+> D ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> D ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> tick ,D ~+> D ,D ~+> 0.0.0 ,D ~+> tick ,E ~+> B ,E ~+> D ,E ~+> E ,E ~+> 0.0 ,E ~+> 0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> B ,A ~*> D ,A ~*> E ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> B ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> tick ,D ~*> D ,D ~*> 0.0.0 ,D ~*> tick ,E ~*> B ,E ~*> D ,E ~*> E ,E ~*> 0.0.0 ,E ~*> tick ,K ~*> B ,K ~*> D ,K ~*> E ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> D ,A ~^> 0.0.0 ,A ~^> tick ,B ~^> D ,B ~^> 0.0.0 ,B ~^> tick ,E ~^> D ,E ~^> 0.0.0 ,E ~^> tick ,K ~^> D ,K ~^> 0.0.0 ,K ~^> tick] + f0> [B ~=> D ,E ~=> D ,K ~=> C ,huge ~=> C ,A ~+> B ,A ~+> D ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> D ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> tick ,D ~+> D ,D ~+> 0.0.0 ,D ~+> tick ,E ~+> B ,E ~+> D ,E ~+> E ,E ~+> 0.0 ,E ~+> 0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> B ,A ~*> D ,A ~*> E ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> B ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> tick ,D ~*> D ,D ~*> 0.0.0 ,D ~*> tick ,E ~*> B ,E ~*> D ,E ~*> E ,E ~*> 0.0.0 ,E ~*> tick ,K ~*> B ,K ~*> D ,K ~*> E ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> D ,A ~^> 0.0.0 ,A ~^> tick ,B ~^> D ,B ~^> 0.0.0 ,B ~^> tick ,E ~^> D ,E ~^> 0.0.0 ,E ~^> tick ,K ~^> D ,K ~^> 0.0.0 ,K ~^> tick] + f37> [A ~+> 0.0.0 ,A ~+> tick ,D ~+> D ,D ~+> 0.0.0 ,D ~+> tick ,E ~+> D ,tick ~+> tick ,A ~*> D ,D ~*> D ,E ~*> D] YES(?,PRIMREC)