MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D) -> evalfentryin(A,B,C,D) True (1,1) 1. evalfentryin(A,B,C,D) -> evalfbb3in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 2. evalfbb3in(A,B,C,D) -> evalfreturnin(A,B,C,D) [D >= B] (?,1) 3. evalfbb3in(A,B,C,D) -> evalfbb4in(A,B,C,D) [B >= 1 + D] (?,1) 4. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [0 >= 1 + E] (?,1) 5. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [E >= 1] (?,1) 6. evalfbb4in(A,B,C,D) -> evalfreturnin(A,B,C,D) True (?,1) 7. evalfbbin(A,B,C,D) -> evalfbb1in(A,B,C,D) [A >= 1 + C] (?,1) 8. evalfbbin(A,B,C,D) -> evalfbb2in(A,B,C,D) [C >= A] (?,1) 9. evalfbb1in(A,B,C,D) -> evalfbb3in(A,B,1 + C,D) True (?,1) 10. evalfbb2in(A,B,C,D) -> evalfbb3in(A,B,0,1 + D) True (?,1) 11. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D) True (?,1) Signature: {(evalfbb1in,4) ;(evalfbb2in,4) ;(evalfbb3in,4) ;(evalfbb4in,4) ;(evalfbbin,4) ;(evalfentryin,4) ;(evalfreturnin,4) ;(evalfstart,4) ;(evalfstop,4)} Flow Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{2,3},10->{2,3},11->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D) -> evalfentryin(A,B,C,D) True (1,1) 1. evalfentryin(A,B,C,D) -> evalfbb3in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 2. evalfbb3in(A,B,C,D) -> evalfreturnin(A,B,C,D) [D >= B] (?,1) 3. evalfbb3in(A,B,C,D) -> evalfbb4in(A,B,C,D) [B >= 1 + D] (?,1) 4. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [0 >= 1 + E] (?,1) 5. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [E >= 1] (?,1) 6. evalfbb4in(A,B,C,D) -> evalfreturnin(A,B,C,D) True (?,1) 7. evalfbbin(A,B,C,D) -> evalfbb1in(A,B,C,D) [A >= 1 + C] (?,1) 8. evalfbbin(A,B,C,D) -> evalfbb2in(A,B,C,D) [C >= A] (?,1) 9. evalfbb1in(A,B,C,D) -> evalfbb3in(A,B,1 + C,D) True (?,1) 10. evalfbb2in(A,B,C,D) -> evalfbb3in(A,B,0,1 + D) True (?,1) 11. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D) True (?,1) Signature: {(evalfbb1in,4) ;(evalfbb2in,4) ;(evalfbb3in,4) ;(evalfbb4in,4) ;(evalfbbin,4) ;(evalfentryin,4) ;(evalfreturnin,4) ;(evalfstart,4) ;(evalfstop,4)} Flow Graph: [0->{1},1->{3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{2,3},10->{2,3},11->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: evalfstart(A,B,C,D) -> evalfentryin(A,B,C,D) True evalfentryin(A,B,C,D) -> evalfbb3in(A,B,0,0) [A >= 1 && B >= 1 + A] evalfbb3in(A,B,C,D) -> evalfreturnin(A,B,C,D) [D >= B] evalfbb3in(A,B,C,D) -> evalfbb4in(A,B,C,D) [B >= 1 + D] evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [0 >= 1 + E] evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [E >= 1] evalfbb4in(A,B,C,D) -> evalfreturnin(A,B,C,D) True evalfbbin(A,B,C,D) -> evalfbb1in(A,B,C,D) [A >= 1 + C] evalfbbin(A,B,C,D) -> evalfbb2in(A,B,C,D) [C >= A] evalfbb1in(A,B,C,D) -> evalfbb3in(A,B,1 + C,D) True evalfbb2in(A,B,C,D) -> evalfbb3in(A,B,0,1 + D) True evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D) True Signature: {(evalfbb1in,4) ;(evalfbb2in,4) ;(evalfbb3in,4) ;(evalfbb4in,4) ;(evalfbbin,4) ;(evalfentryin,4) ;(evalfreturnin,4) ;(evalfstart,4) ;(evalfstop,4)} Rule Graph: [0->{1},1->{3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{2,3},10->{2,3},11->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: evalfstart.0(A,B,C,D) -> evalfentryin.1(A,B,C,D) True evalfentryin.1(A,B,C,D) -> evalfbb3in.3(A,B,0,0) [A >= 1 && B >= 1 + A] evalfbb3in.2(A,B,C,D) -> evalfreturnin.11(A,B,C,D) [D >= B] evalfbb3in.3(A,B,C,D) -> evalfbb4in.4(A,B,C,D) [B >= 1 + D] evalfbb3in.3(A,B,C,D) -> evalfbb4in.5(A,B,C,D) [B >= 1 + D] evalfbb3in.3(A,B,C,D) -> evalfbb4in.6(A,B,C,D) [B >= 1 + D] evalfbb4in.4(A,B,C,D) -> evalfbbin.7(A,B,C,D) [0 >= 1 + E] evalfbb4in.4(A,B,C,D) -> evalfbbin.8(A,B,C,D) [0 >= 1 + E] evalfbb4in.5(A,B,C,D) -> evalfbbin.7(A,B,C,D) [E >= 1] evalfbb4in.5(A,B,C,D) -> evalfbbin.8(A,B,C,D) [E >= 1] evalfbb4in.6(A,B,C,D) -> evalfreturnin.11(A,B,C,D) True evalfbbin.7(A,B,C,D) -> evalfbb1in.9(A,B,C,D) [A >= 1 + C] evalfbbin.8(A,B,C,D) -> evalfbb2in.10(A,B,C,D) [C >= A] evalfbb1in.9(A,B,C,D) -> evalfbb3in.2(A,B,1 + C,D) True evalfbb1in.9(A,B,C,D) -> evalfbb3in.3(A,B,1 + C,D) True evalfbb2in.10(A,B,C,D) -> evalfbb3in.2(A,B,0,1 + D) True evalfbb2in.10(A,B,C,D) -> evalfbb3in.3(A,B,0,1 + D) True evalfreturnin.11(A,B,C,D) -> evalfstop.12(A,B,C,D) True Signature: {(evalfbb1in.9,4) ;(evalfbb2in.10,4) ;(evalfbb3in.2,4) ;(evalfbb3in.3,4) ;(evalfbb4in.4,4) ;(evalfbb4in.5,4) ;(evalfbb4in.6,4) ;(evalfbbin.7,4) ;(evalfbbin.8,4) ;(evalfentryin.1,4) ;(evalfreturnin.11,4) ;(evalfstart.0,4) ;(evalfstop.12,4)} Rule Graph: [0->{1},1->{3,4,5},2->{17},3->{6,7},4->{8,9},5->{10},6->{11},7->{12},8->{11},9->{12},10->{17},11->{13,14} ,12->{15,16},13->{2},14->{3,4,5},15->{2},16->{3,4,5},17->{}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: evalfstart.0(A,B,C,D) -> evalfentryin.1(A,B,C,D) True evalfentryin.1(A,B,C,D) -> evalfbb3in.3(A,B,0,0) [A >= 1 && B >= 1 + A] evalfbb3in.2(A,B,C,D) -> evalfreturnin.11(A,B,C,D) [D >= B] evalfbb3in.3(A,B,C,D) -> evalfbb4in.4(A,B,C,D) [B >= 1 + D] evalfbb3in.3(A,B,C,D) -> evalfbb4in.5(A,B,C,D) [B >= 1 + D] evalfbb3in.3(A,B,C,D) -> evalfbb4in.6(A,B,C,D) [B >= 1 + D] evalfbb4in.4(A,B,C,D) -> evalfbbin.7(A,B,C,D) [0 >= 1 + E] evalfbb4in.4(A,B,C,D) -> evalfbbin.8(A,B,C,D) [0 >= 1 + E] evalfbb4in.5(A,B,C,D) -> evalfbbin.7(A,B,C,D) [E >= 1] evalfbb4in.5(A,B,C,D) -> evalfbbin.8(A,B,C,D) [E >= 1] evalfbb4in.6(A,B,C,D) -> evalfreturnin.11(A,B,C,D) True evalfbbin.7(A,B,C,D) -> evalfbb1in.9(A,B,C,D) [A >= 1 + C] evalfbbin.8(A,B,C,D) -> evalfbb2in.10(A,B,C,D) [C >= A] evalfbb1in.9(A,B,C,D) -> evalfbb3in.2(A,B,1 + C,D) True evalfbb1in.9(A,B,C,D) -> evalfbb3in.3(A,B,1 + C,D) True evalfbb2in.10(A,B,C,D) -> evalfbb3in.2(A,B,0,1 + D) True evalfbb2in.10(A,B,C,D) -> evalfbb3in.3(A,B,0,1 + D) True evalfreturnin.11(A,B,C,D) -> evalfstop.12(A,B,C,D) True evalfstop.12(A,B,C,D) -> exitus616(A,B,C,D) True evalfstop.12(A,B,C,D) -> exitus616(A,B,C,D) True evalfstop.12(A,B,C,D) -> exitus616(A,B,C,D) True Signature: {(evalfbb1in.9,4) ;(evalfbb2in.10,4) ;(evalfbb3in.2,4) ;(evalfbb3in.3,4) ;(evalfbb4in.4,4) ;(evalfbb4in.5,4) ;(evalfbb4in.6,4) ;(evalfbbin.7,4) ;(evalfbbin.8,4) ;(evalfentryin.1,4) ;(evalfreturnin.11,4) ;(evalfstart.0,4) ;(evalfstop.12,4) ;(exitus616,4)} Rule Graph: [0->{1},1->{3,4,5},2->{17},3->{6,7},4->{8,9},5->{10},6->{11},7->{12},8->{11},9->{12},10->{17},11->{13,14} ,12->{15,16},13->{2},14->{3,4,5},15->{2},16->{3,4,5},17->{18,19,20}] + 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,20] | `- p:[3,14,11,6,8,4,16,12,7,9] c: [] MAYBE