Start: evalDis2start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: evalDis2bb1in, evalDis2bb2in, evalDis2bb3in, evalDis2bbin, evalDis2entryin, evalDis2returnin, evalDis2start, evalDis2stop
Transitions:
6:evalDis2bb1in(Arg_0,Arg_1,Arg_2) -> evalDis2bb3in(Arg_0,Arg_1,Arg_2+1)
7:evalDis2bb2in(Arg_0,Arg_1,Arg_2) -> evalDis2bb3in(Arg_0,Arg_1+1,Arg_2)
2:evalDis2bb3in(Arg_0,Arg_1,Arg_2) -> evalDis2bbin(Arg_0,Arg_1,Arg_2):|:Arg_2+1<=Arg_0
3:evalDis2bb3in(Arg_0,Arg_1,Arg_2) -> evalDis2returnin(Arg_0,Arg_1,Arg_2):|:Arg_0<=Arg_2
4:evalDis2bbin(Arg_0,Arg_1,Arg_2) -> evalDis2bb1in(Arg_0,Arg_1,Arg_2):|:Arg_2+1<=Arg_1
5:evalDis2bbin(Arg_0,Arg_1,Arg_2) -> evalDis2bb2in(Arg_0,Arg_1,Arg_2):|:Arg_1<=Arg_2
1:evalDis2entryin(Arg_0,Arg_1,Arg_2) -> evalDis2bb3in(Arg_1,Arg_2,Arg_0)
8:evalDis2returnin(Arg_0,Arg_1,Arg_2) -> evalDis2stop(Arg_0,Arg_1,Arg_2)
0:evalDis2start(Arg_0,Arg_1,Arg_2) -> evalDis2entryin(Arg_0,Arg_1,Arg_2)
Found invariant 1+Arg_2<=Arg_0 && Arg_1<=Arg_2 && 1+Arg_1<=Arg_0 for location evalDis2bb2in
Found invariant 1+Arg_2<=Arg_0 for location evalDis2bbin
Found invariant 1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 for location evalDis2bb1in
Found invariant Arg_0<=Arg_2 for location evalDis2stop
Found invariant Arg_0<=Arg_2 for location evalDis2returnin
Start: evalDis2start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: evalDis2bb1in, evalDis2bb2in, evalDis2bb3in, evalDis2bbin, evalDis2entryin, evalDis2returnin, evalDis2start, evalDis2stop
Transitions:
6:evalDis2bb1in(Arg_0,Arg_1,Arg_2) -> evalDis2bb3in(Arg_0,Arg_1,Arg_2+1):|:1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0
7:evalDis2bb2in(Arg_0,Arg_1,Arg_2) -> evalDis2bb3in(Arg_0,Arg_1+1,Arg_2):|:1+Arg_2<=Arg_0 && Arg_1<=Arg_2 && 1+Arg_1<=Arg_0
2:evalDis2bb3in(Arg_0,Arg_1,Arg_2) -> evalDis2bbin(Arg_0,Arg_1,Arg_2):|:Arg_2+1<=Arg_0
3:evalDis2bb3in(Arg_0,Arg_1,Arg_2) -> evalDis2returnin(Arg_0,Arg_1,Arg_2):|:Arg_0<=Arg_2
4:evalDis2bbin(Arg_0,Arg_1,Arg_2) -> evalDis2bb1in(Arg_0,Arg_1,Arg_2):|:1+Arg_2<=Arg_0 && Arg_2+1<=Arg_1
5:evalDis2bbin(Arg_0,Arg_1,Arg_2) -> evalDis2bb2in(Arg_0,Arg_1,Arg_2):|:1+Arg_2<=Arg_0 && Arg_1<=Arg_2
1:evalDis2entryin(Arg_0,Arg_1,Arg_2) -> evalDis2bb3in(Arg_1,Arg_2,Arg_0)
8:evalDis2returnin(Arg_0,Arg_1,Arg_2) -> evalDis2stop(Arg_0,Arg_1,Arg_2):|:Arg_0<=Arg_2
0:evalDis2start(Arg_0,Arg_1,Arg_2) -> evalDis2entryin(Arg_0,Arg_1,Arg_2)
new bound:
Arg_0+Arg_1 {O(n)}
MPRF:
evalDis2bb3in [Arg_0-Arg_2 ]
evalDis2bb1in [Arg_0-Arg_2 ]
evalDis2bbin [Arg_0-Arg_2 ]
evalDis2bb2in [Arg_0-Arg_2 ]
new bound:
Arg_1+Arg_2 {O(n)}
MPRF:
evalDis2bb3in [Arg_0-Arg_1 ]
evalDis2bb1in [Arg_0-Arg_1 ]
evalDis2bbin [Arg_0-Arg_1 ]
evalDis2bb2in [Arg_0-Arg_1 ]
new bound:
Arg_0+Arg_1 {O(n)}
MPRF:
evalDis2bb3in [Arg_0-Arg_2 ]
evalDis2bb1in [Arg_0-Arg_2-1 ]
evalDis2bbin [Arg_0-Arg_2 ]
evalDis2bb2in [Arg_0-Arg_2 ]
new bound:
Arg_1+Arg_2 {O(n)}
MPRF:
evalDis2bb3in [Arg_0-Arg_1 ]
evalDis2bb1in [Arg_0-Arg_1 ]
evalDis2bbin [Arg_0-Arg_1 ]
evalDis2bb2in [Arg_0-Arg_1-1 ]
knowledge_propagation leads to new time bound 2*Arg_1+Arg_0+Arg_2+1 {O(n)} for transition 2:evalDis2bb3in(Arg_0,Arg_1,Arg_2) -> evalDis2bbin(Arg_0,Arg_1,Arg_2):|:Arg_2+1<=Arg_0
Overall timebound:3*Arg_0+3*Arg_2+6*Arg_1+5 {O(n)}
6: evalDis2bb1in->evalDis2bb3in: Arg_0+Arg_1 {O(n)}
7: evalDis2bb2in->evalDis2bb3in: Arg_1+Arg_2 {O(n)}
2: evalDis2bb3in->evalDis2bbin: 2*Arg_1+Arg_0+Arg_2+1 {O(n)}
3: evalDis2bb3in->evalDis2returnin: 1 {O(1)}
4: evalDis2bbin->evalDis2bb1in: Arg_0+Arg_1 {O(n)}
5: evalDis2bbin->evalDis2bb2in: Arg_1+Arg_2 {O(n)}
1: evalDis2entryin->evalDis2bb3in: 1 {O(1)}
8: evalDis2returnin->evalDis2stop: 1 {O(1)}
0: evalDis2start->evalDis2entryin: 1 {O(1)}
Overall costbound: 3*Arg_0+3*Arg_2+6*Arg_1+5 {O(n)}
6: evalDis2bb1in->evalDis2bb3in: Arg_0+Arg_1 {O(n)}
7: evalDis2bb2in->evalDis2bb3in: Arg_1+Arg_2 {O(n)}
2: evalDis2bb3in->evalDis2bbin: 2*Arg_1+Arg_0+Arg_2+1 {O(n)}
3: evalDis2bb3in->evalDis2returnin: 1 {O(1)}
4: evalDis2bbin->evalDis2bb1in: Arg_0+Arg_1 {O(n)}
5: evalDis2bbin->evalDis2bb2in: Arg_1+Arg_2 {O(n)}
1: evalDis2entryin->evalDis2bb3in: 1 {O(1)}
8: evalDis2returnin->evalDis2stop: 1 {O(1)}
0: evalDis2start->evalDis2entryin: 1 {O(1)}
6: evalDis2bb1in->evalDis2bb3in, Arg_0: Arg_1 {O(n)}
6: evalDis2bb1in->evalDis2bb3in, Arg_1: 2*Arg_2+Arg_1 {O(n)}
6: evalDis2bb1in->evalDis2bb3in, Arg_2: 2*Arg_0+Arg_1 {O(n)}
7: evalDis2bb2in->evalDis2bb3in, Arg_0: Arg_1 {O(n)}
7: evalDis2bb2in->evalDis2bb3in, Arg_1: 2*Arg_2+Arg_1 {O(n)}
7: evalDis2bb2in->evalDis2bb3in, Arg_2: 2*Arg_0+Arg_1 {O(n)}
2: evalDis2bb3in->evalDis2bbin, Arg_0: Arg_1 {O(n)}
2: evalDis2bb3in->evalDis2bbin, Arg_1: 2*Arg_2+Arg_1 {O(n)}
2: evalDis2bb3in->evalDis2bbin, Arg_2: 2*Arg_0+Arg_1 {O(n)}
3: evalDis2bb3in->evalDis2returnin, Arg_0: 2*Arg_1 {O(n)}
3: evalDis2bb3in->evalDis2returnin, Arg_1: 3*Arg_2+Arg_1 {O(n)}
3: evalDis2bb3in->evalDis2returnin, Arg_2: 3*Arg_0+Arg_1 {O(n)}
4: evalDis2bbin->evalDis2bb1in, Arg_0: Arg_1 {O(n)}
4: evalDis2bbin->evalDis2bb1in, Arg_1: 2*Arg_2+Arg_1 {O(n)}
4: evalDis2bbin->evalDis2bb1in, Arg_2: 2*Arg_0+Arg_1 {O(n)}
5: evalDis2bbin->evalDis2bb2in, Arg_0: Arg_1 {O(n)}
5: evalDis2bbin->evalDis2bb2in, Arg_1: 2*Arg_2+Arg_1 {O(n)}
5: evalDis2bbin->evalDis2bb2in, Arg_2: 2*Arg_0+Arg_1 {O(n)}
1: evalDis2entryin->evalDis2bb3in, Arg_0: Arg_1 {O(n)}
1: evalDis2entryin->evalDis2bb3in, Arg_1: Arg_2 {O(n)}
1: evalDis2entryin->evalDis2bb3in, Arg_2: Arg_0 {O(n)}
8: evalDis2returnin->evalDis2stop, Arg_0: 2*Arg_1 {O(n)}
8: evalDis2returnin->evalDis2stop, Arg_1: 3*Arg_2+Arg_1 {O(n)}
8: evalDis2returnin->evalDis2stop, Arg_2: 3*Arg_0+Arg_1 {O(n)}
0: evalDis2start->evalDis2entryin, Arg_0: Arg_0 {O(n)}
0: evalDis2start->evalDis2entryin, Arg_1: Arg_1 {O(n)}
0: evalDis2start->evalDis2entryin, Arg_2: Arg_2 {O(n)}