NO * Step 1: UnsatPaths NO + Considered Problem: Rules: 0. evalspeedpldi3start(A,B,C,D) -> evalspeedpldi3entryin(A,B,C,D) True (1,1) 1. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [0 >= A] (?,1) 2. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [A >= B] (?,1) 3. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 4. evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3bb2in(A,B,C,D) [B >= 1 + D] (?,1) 5. evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [D >= B] (?,1) 6. evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb3in(A,B,C,D) [A >= 1 + C] (?,1) 7. evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb4in(A,B,C,D) [C >= A] (?,1) 8. evalspeedpldi3bb3in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,1 + C,D) True (?,1) 9. evalspeedpldi3bb4in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,1 + D) True (?,1) 10. evalspeedpldi3returnin(A,B,C,D) -> evalspeedpldi3stop(A,B,C,D) True (?,1) Signature: {(evalspeedpldi3bb2in,4) ;(evalspeedpldi3bb3in,4) ;(evalspeedpldi3bb4in,4) ;(evalspeedpldi3bb5in,4) ;(evalspeedpldi3entryin,4) ;(evalspeedpldi3returnin,4) ;(evalspeedpldi3start,4) ;(evalspeedpldi3stop,4)} Flow Graph: [0->{1,2,3},1->{10},2->{10},3->{4,5},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,5)] * Step 2: FromIts NO + Considered Problem: Rules: 0. evalspeedpldi3start(A,B,C,D) -> evalspeedpldi3entryin(A,B,C,D) True (1,1) 1. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [0 >= A] (?,1) 2. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [A >= B] (?,1) 3. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 4. evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3bb2in(A,B,C,D) [B >= 1 + D] (?,1) 5. evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [D >= B] (?,1) 6. evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb3in(A,B,C,D) [A >= 1 + C] (?,1) 7. evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb4in(A,B,C,D) [C >= A] (?,1) 8. evalspeedpldi3bb3in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,1 + C,D) True (?,1) 9. evalspeedpldi3bb4in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,1 + D) True (?,1) 10. evalspeedpldi3returnin(A,B,C,D) -> evalspeedpldi3stop(A,B,C,D) True (?,1) Signature: {(evalspeedpldi3bb2in,4) ;(evalspeedpldi3bb3in,4) ;(evalspeedpldi3bb4in,4) ;(evalspeedpldi3bb5in,4) ;(evalspeedpldi3entryin,4) ;(evalspeedpldi3returnin,4) ;(evalspeedpldi3start,4) ;(evalspeedpldi3stop,4)} Flow Graph: [0->{1,2,3},1->{10},2->{10},3->{4},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: FromIts + Details: () * Step 3: CloseWith NO + Considered Problem: Rules: evalspeedpldi3start(A,B,C,D) -> evalspeedpldi3entryin(A,B,C,D) True evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [0 >= A] evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [A >= B] evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,0) [A >= 1 && B >= 1 + A] evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3bb2in(A,B,C,D) [B >= 1 + D] evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [D >= B] evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb3in(A,B,C,D) [A >= 1 + C] evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb4in(A,B,C,D) [C >= A] evalspeedpldi3bb3in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,1 + C,D) True evalspeedpldi3bb4in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,1 + D) True evalspeedpldi3returnin(A,B,C,D) -> evalspeedpldi3stop(A,B,C,D) True Signature: {(evalspeedpldi3bb2in,4) ;(evalspeedpldi3bb3in,4) ;(evalspeedpldi3bb4in,4) ;(evalspeedpldi3bb5in,4) ;(evalspeedpldi3entryin,4) ;(evalspeedpldi3returnin,4) ;(evalspeedpldi3start,4) ;(evalspeedpldi3stop,4)} Rule Graph: [0->{1,2,3},1->{10},2->{10},3->{4},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: CloseWith False + Details: () NO