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