MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f3(0,0,C,D,E) True (1,1) 1. f3(A,B,C,D,E) -> f3(A,B,-1 + C,F,E) [-1*B >= 0 (?,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && F >= 1] 2. f3(A,B,C,D,E) -> f3(A,B,-2 + C,F,E) [-1*B >= 0 (?,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && 0 >= F] 3. f3(A,B,C,D,E) -> f6(A,B,C,D,F) [-1*B >= 0 (?,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 0 >= C] 4. f6(A,B,C,D,E) -> f6(1,B,C,D,F) [-1*C >= 0 (?,1) && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && E >= 1] 5. f6(A,B,C,D,E) -> f6(0,B,C,D,F) [-1*C >= 0 (?,1) && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= E] Signature: {(f0,5);(f3,5);(f6,5)} Flow Graph: [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{4,5},4->{4,5},5->{4,5}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: PolyRank MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f3(0,0,C,D,E) True (1,1) 1. f3(A,B,C,D,E) -> f3(A,B,-1 + C,F,E) [-1*B >= 0 (?,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && F >= 1] 2. f3(A,B,C,D,E) -> f3(A,B,-2 + C,F,E) [-1*B >= 0 (?,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && 0 >= F] 3. f3(A,B,C,D,E) -> f6(A,B,C,D,F) [-1*B >= 0 (1,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 0 >= C] 4. f6(A,B,C,D,E) -> f6(1,B,C,D,F) [-1*C >= 0 (?,1) && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && E >= 1] 5. f6(A,B,C,D,E) -> f6(0,B,C,D,F) [-1*C >= 0 (?,1) && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= E] Signature: {(f0,5);(f3,5);(f6,5)} Flow Graph: [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{4,5},4->{4,5},5->{4,5}] + Applied Processor: PolyRank {useFarkas = True, withSizebounds = [], shape = Linear} + Details: We apply a polynomial interpretation of shape linear: p(f0) = x3 p(f3) = x3 p(f6) = x3 Following rules are strictly oriented: [-1*B >= 0 ==> && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && 0 >= F] f3(A,B,C,D,E) = C > -2 + C = f3(A,B,-2 + C,F,E) Following rules are weakly oriented: True ==> f0(A,B,C,D,E) = C >= C = f3(0,0,C,D,E) [-1*B >= 0 ==> && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && F >= 1] f3(A,B,C,D,E) = C >= -1 + C = f3(A,B,-1 + C,F,E) [-1*B >= 0 ==> && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 0 >= C] f3(A,B,C,D,E) = C >= C = f6(A,B,C,D,F) [-1*C >= 0 ==> && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && E >= 1] f6(A,B,C,D,E) = C >= C = f6(1,B,C,D,F) [-1*C >= 0 ==> && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= E] f6(A,B,C,D,E) = C >= C = f6(0,B,C,D,F) * Step 3: PolyRank MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f3(0,0,C,D,E) True (1,1) 1. f3(A,B,C,D,E) -> f3(A,B,-1 + C,F,E) [-1*B >= 0 (?,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && F >= 1] 2. f3(A,B,C,D,E) -> f3(A,B,-2 + C,F,E) [-1*B >= 0 (C,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && 0 >= F] 3. f3(A,B,C,D,E) -> f6(A,B,C,D,F) [-1*B >= 0 (1,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 0 >= C] 4. f6(A,B,C,D,E) -> f6(1,B,C,D,F) [-1*C >= 0 (?,1) && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && E >= 1] 5. f6(A,B,C,D,E) -> f6(0,B,C,D,F) [-1*C >= 0 (?,1) && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= E] Signature: {(f0,5);(f3,5);(f6,5)} Flow Graph: [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{4,5},4->{4,5},5->{4,5}] + Applied Processor: PolyRank {useFarkas = True, withSizebounds = [], shape = Linear} + Details: We apply a polynomial interpretation of shape linear: p(f0) = x3 p(f3) = x3 p(f6) = x3 Following rules are strictly oriented: [-1*B >= 0 ==> && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && F >= 1] f3(A,B,C,D,E) = C > -1 + C = f3(A,B,-1 + C,F,E) [-1*B >= 0 ==> && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && 0 >= F] f3(A,B,C,D,E) = C > -2 + C = f3(A,B,-2 + C,F,E) Following rules are weakly oriented: True ==> f0(A,B,C,D,E) = C >= C = f3(0,0,C,D,E) [-1*B >= 0 ==> && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 0 >= C] f3(A,B,C,D,E) = C >= C = f6(A,B,C,D,F) [-1*C >= 0 ==> && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && E >= 1] f6(A,B,C,D,E) = C >= C = f6(1,B,C,D,F) [-1*C >= 0 ==> && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= E] f6(A,B,C,D,E) = C >= C = f6(0,B,C,D,F) * Step 4: Failure MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f3(0,0,C,D,E) True (1,1) 1. f3(A,B,C,D,E) -> f3(A,B,-1 + C,F,E) [-1*B >= 0 (C,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && F >= 1] 2. f3(A,B,C,D,E) -> f3(A,B,-2 + C,F,E) [-1*B >= 0 (C,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && C >= 1 && 0 >= F] 3. f3(A,B,C,D,E) -> f6(A,B,C,D,F) [-1*B >= 0 (1,1) && A + -1*B >= 0 && -1*A + -1*B >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && -1*A >= 0 && A >= 0 && 0 >= C] 4. f6(A,B,C,D,E) -> f6(1,B,C,D,F) [-1*C >= 0 (?,1) && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && E >= 1] 5. f6(A,B,C,D,E) -> f6(0,B,C,D,F) [-1*C >= 0 (?,1) && B + -1*C >= 0 && -1*B + -1*C >= 0 && A + -1*C >= 0 && -1*B >= 0 && A + -1*B >= 0 && B >= 0 && A + B >= 0 && A >= 0 && 0 >= E] Signature: {(f0,5);(f3,5);(f6,5)} Flow Graph: [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{4,5},4->{4,5},5->{4,5}] + Applied Processor: Failing "Open problems left." + Details: Open problems left. MAYBE