Start: evalaxstart
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: evalaxbb1in, evalaxbb2in, evalaxbb3in, evalaxbbin, evalaxentryin, evalaxreturnin, evalaxstart, evalaxstop
Transitions:
5:evalaxbb1in(Arg_0,Arg_1,Arg_2) -> evalaxbb2in(Arg_0,Arg_1+1,Arg_2)
3:evalaxbb2in(Arg_0,Arg_1,Arg_2) -> evalaxbb1in(Arg_0,Arg_1,Arg_2):|:2+Arg_1<=Arg_2
4:evalaxbb2in(Arg_0,Arg_1,Arg_2) -> evalaxbb3in(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_1+1
6:evalaxbb3in(Arg_0,Arg_1,Arg_2) -> evalaxbbin(Arg_0+1,Arg_1,Arg_2):|:Arg_2<=Arg_1+1 && 3+Arg_0<=Arg_2
7:evalaxbb3in(Arg_0,Arg_1,Arg_2) -> evalaxreturnin(Arg_0,Arg_1,Arg_2):|:2+Arg_1<=Arg_2
8:evalaxbb3in(Arg_0,Arg_1,Arg_2) -> evalaxreturnin(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_0+2
2:evalaxbbin(Arg_0,Arg_1,Arg_2) -> evalaxbb2in(Arg_0,0,Arg_2)
1:evalaxentryin(Arg_0,Arg_1,Arg_2) -> evalaxbbin(0,Arg_1,Arg_2)
9:evalaxreturnin(Arg_0,Arg_1,Arg_2) -> evalaxstop(Arg_0,Arg_1,Arg_2)
0:evalaxstart(Arg_0,Arg_1,Arg_2) -> evalaxentryin(Arg_0,Arg_1,Arg_2)
Cut unsatisfiable transition 7: evalaxbb3in->evalaxreturnin
Found invariant 2<=Arg_2 && 2<=Arg_1+Arg_2 && 2+Arg_1<=Arg_2 && 2<=Arg_0+Arg_2 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 for location evalaxbb1in
Found invariant Arg_2<=1+Arg_1 && Arg_2<=2+Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 for location evalaxstop
Found invariant Arg_2<=1+Arg_1 && Arg_2<=2+Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 for location evalaxreturnin
Found invariant 0<=Arg_0 for location evalaxbbin
Found invariant 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 for location evalaxbb2in
Found invariant Arg_2<=1+Arg_1 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 for location evalaxbb3in
Start: evalaxstart
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: evalaxbb1in, evalaxbb2in, evalaxbb3in, evalaxbbin, evalaxentryin, evalaxreturnin, evalaxstart, evalaxstop
Transitions:
5:evalaxbb1in(Arg_0,Arg_1,Arg_2) -> evalaxbb2in(Arg_0,Arg_1+1,Arg_2):|:2<=Arg_2 && 2<=Arg_1+Arg_2 && 2+Arg_1<=Arg_2 && 2<=Arg_0+Arg_2 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0
3:evalaxbb2in(Arg_0,Arg_1,Arg_2) -> evalaxbb1in(Arg_0,Arg_1,Arg_2):|:0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 && 2+Arg_1<=Arg_2
4:evalaxbb2in(Arg_0,Arg_1,Arg_2) -> evalaxbb3in(Arg_0,Arg_1,Arg_2):|:0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 && Arg_2<=Arg_1+1
6:evalaxbb3in(Arg_0,Arg_1,Arg_2) -> evalaxbbin(Arg_0+1,Arg_1,Arg_2):|:Arg_2<=1+Arg_1 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 && Arg_2<=Arg_1+1 && 3+Arg_0<=Arg_2
8:evalaxbb3in(Arg_0,Arg_1,Arg_2) -> evalaxreturnin(Arg_0,Arg_1,Arg_2):|:Arg_2<=1+Arg_1 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 && Arg_2<=Arg_0+2
2:evalaxbbin(Arg_0,Arg_1,Arg_2) -> evalaxbb2in(Arg_0,0,Arg_2):|:0<=Arg_0
1:evalaxentryin(Arg_0,Arg_1,Arg_2) -> evalaxbbin(0,Arg_1,Arg_2)
9:evalaxreturnin(Arg_0,Arg_1,Arg_2) -> evalaxstop(Arg_0,Arg_1,Arg_2):|:Arg_2<=1+Arg_1 && Arg_2<=2+Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0
0:evalaxstart(Arg_0,Arg_1,Arg_2) -> evalaxentryin(Arg_0,Arg_1,Arg_2)
new bound:
Arg_2+2 {O(n)}
MPRF:
evalaxbb1in [Arg_2-Arg_0-2 ]
evalaxbb3in [Arg_2-Arg_0-2 ]
evalaxbbin [Arg_2-Arg_0-2 ]
evalaxbb2in [Arg_2-Arg_0-2 ]
knowledge_propagation leads to new time bound Arg_2+3 {O(n)} for transition 2:evalaxbbin(Arg_0,Arg_1,Arg_2) -> evalaxbb2in(Arg_0,0,Arg_2):|:0<=Arg_0
new bound:
Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
MPRF:
evalaxbb1in [Arg_2-Arg_1-1 ]
evalaxbb2in [Arg_2-Arg_1-1 ]
evalaxbb3in [Arg_2-Arg_1-1 ]
evalaxbbin [Arg_2-Arg_1-1 ]
new bound:
Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
MPRF:
evalaxbb1in [Arg_2-Arg_1-2 ]
evalaxbb2in [Arg_2-Arg_1-1 ]
evalaxbb3in [Arg_2-Arg_1-1 ]
evalaxbbin [Arg_2-Arg_1-1 ]
new bound:
Arg_2+3 {O(n)}
MPRF:
evalaxbb1in [1 ]
evalaxbb2in [1 ]
evalaxbb3in [0 ]
evalaxbbin [1-Arg_0 ]
Overall timebound:2*Arg_2*Arg_2+11*Arg_2+18 {O(n^2)}
5: evalaxbb1in->evalaxbb2in: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
3: evalaxbb2in->evalaxbb1in: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
4: evalaxbb2in->evalaxbb3in: Arg_2+3 {O(n)}
6: evalaxbb3in->evalaxbbin: Arg_2+2 {O(n)}
8: evalaxbb3in->evalaxreturnin: 1 {O(1)}
2: evalaxbbin->evalaxbb2in: Arg_2+3 {O(n)}
1: evalaxentryin->evalaxbbin: 1 {O(1)}
9: evalaxreturnin->evalaxstop: 1 {O(1)}
0: evalaxstart->evalaxentryin: 1 {O(1)}
Overall costbound: 2*Arg_2*Arg_2+11*Arg_2+18 {O(n^2)}
5: evalaxbb1in->evalaxbb2in: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
3: evalaxbb2in->evalaxbb1in: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
4: evalaxbb2in->evalaxbb3in: Arg_2+3 {O(n)}
6: evalaxbb3in->evalaxbbin: Arg_2+2 {O(n)}
8: evalaxbb3in->evalaxreturnin: 1 {O(1)}
2: evalaxbbin->evalaxbb2in: Arg_2+3 {O(n)}
1: evalaxentryin->evalaxbbin: 1 {O(1)}
9: evalaxreturnin->evalaxstop: 1 {O(1)}
0: evalaxstart->evalaxentryin: 1 {O(1)}
5: evalaxbb1in->evalaxbb2in, Arg_0: Arg_2+2 {O(n)}
5: evalaxbb1in->evalaxbb2in, Arg_1: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
5: evalaxbb1in->evalaxbb2in, Arg_2: Arg_2 {O(n)}
3: evalaxbb2in->evalaxbb1in, Arg_0: Arg_2+2 {O(n)}
3: evalaxbb2in->evalaxbb1in, Arg_1: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
3: evalaxbb2in->evalaxbb1in, Arg_2: Arg_2 {O(n)}
4: evalaxbb2in->evalaxbb3in, Arg_0: Arg_2+2 {O(n)}
4: evalaxbb2in->evalaxbb3in, Arg_1: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
4: evalaxbb2in->evalaxbb3in, Arg_2: Arg_2 {O(n)}
6: evalaxbb3in->evalaxbbin, Arg_0: Arg_2+2 {O(n)}
6: evalaxbb3in->evalaxbbin, Arg_1: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
6: evalaxbb3in->evalaxbbin, Arg_2: Arg_2 {O(n)}
8: evalaxbb3in->evalaxreturnin, Arg_0: Arg_2+2 {O(n)}
8: evalaxbb3in->evalaxreturnin, Arg_1: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
8: evalaxbb3in->evalaxreturnin, Arg_2: Arg_2 {O(n)}
2: evalaxbbin->evalaxbb2in, Arg_0: Arg_2+2 {O(n)}
2: evalaxbbin->evalaxbb2in, Arg_1: 0 {O(1)}
2: evalaxbbin->evalaxbb2in, Arg_2: Arg_2 {O(n)}
1: evalaxentryin->evalaxbbin, Arg_0: 0 {O(1)}
1: evalaxentryin->evalaxbbin, Arg_1: Arg_1 {O(n)}
1: evalaxentryin->evalaxbbin, Arg_2: Arg_2 {O(n)}
9: evalaxreturnin->evalaxstop, Arg_0: Arg_2+2 {O(n)}
9: evalaxreturnin->evalaxstop, Arg_1: Arg_2*Arg_2+4*Arg_2+3 {O(n^2)}
9: evalaxreturnin->evalaxstop, Arg_2: Arg_2 {O(n)}
0: evalaxstart->evalaxentryin, Arg_0: Arg_0 {O(n)}
0: evalaxstart->evalaxentryin, Arg_1: Arg_1 {O(n)}
0: evalaxstart->evalaxentryin, Arg_2: Arg_2 {O(n)}