Initial Problem

Start: evalwcet1start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: evalwcet1bb1in, evalwcet1bb4in, evalwcet1bb5in, evalwcet1bb6in, evalwcet1bbin, evalwcet1entryin, evalwcet1returnin, evalwcet1start, evalwcet1stop
Transitions:
6:evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,0):|:Arg_0<=Arg_1+1
7:evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_1+1):|:Arg_1+2<=Arg_0
8:evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=1
9:evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_1-1):|:2<=Arg_1
10:evalwcet1bb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,0)
11:evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bbin(Arg_0,Arg_3,Arg_2-1,Arg_3):|:2<=Arg_2
12:evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=1
3:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:E+1<=0
4:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=E
5:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3)
1:evalwcet1entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bbin(Arg_0,0,Arg_0,Arg_3):|:1<=Arg_0
2:evalwcet1entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=0
13:evalwcet1returnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalwcet1start(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1entryin(Arg_0,Arg_1,Arg_2,Arg_3)

Preprocessing

Found invariant Arg_3<=1+Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 1<=Arg_2+Arg_3 && 0<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 for location evalwcet1bb6in

Found invariant Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 for location evalwcet1bb4in

Found invariant Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 2<=Arg_0+Arg_2 && Arg_1<=1 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 for location evalwcet1bb5in

Found invariant Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 for location evalwcet1bb1in

Found invariant Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 for location evalwcet1bbin

Problem after Preprocessing

Start: evalwcet1start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: evalwcet1bb1in, evalwcet1bb4in, evalwcet1bb5in, evalwcet1bb6in, evalwcet1bbin, evalwcet1entryin, evalwcet1returnin, evalwcet1start, evalwcet1stop
Transitions:
6:evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,0):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && Arg_0<=Arg_1+1
7:evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_1+1):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && Arg_1+2<=Arg_0
8:evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && Arg_1<=1
9:evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_1-1):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && 2<=Arg_1
10:evalwcet1bb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,0):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 2<=Arg_0+Arg_2 && Arg_1<=1 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0
11:evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bbin(Arg_0,Arg_3,Arg_2-1,Arg_3):|:Arg_3<=1+Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 1<=Arg_2+Arg_3 && 0<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && 2<=Arg_2
12:evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=1+Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 1<=Arg_2+Arg_3 && 0<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && Arg_2<=1
3:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && E+1<=0
4:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && 1<=E
5:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0
1:evalwcet1entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bbin(Arg_0,0,Arg_0,Arg_3):|:1<=Arg_0
2:evalwcet1entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=0
13:evalwcet1returnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalwcet1start(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1entryin(Arg_0,Arg_1,Arg_2,Arg_3)

MPRF for transition 6:evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,0):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && Arg_0<=Arg_1+1 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2 ]
evalwcet1bb6in [Arg_2-1 ]
evalwcet1bb1in [Arg_2 ]
evalwcet1bbin [Arg_2 ]
evalwcet1bb4in [Arg_2 ]

MPRF for transition 7:evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_1+1):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && Arg_1+2<=Arg_0 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2 ]
evalwcet1bb6in [Arg_2-1 ]
evalwcet1bb1in [Arg_2 ]
evalwcet1bbin [Arg_2 ]
evalwcet1bb4in [Arg_2 ]

MPRF for transition 8:evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && Arg_1<=1 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2-1 ]
evalwcet1bb6in [Arg_2-1 ]
evalwcet1bb1in [Arg_2 ]
evalwcet1bbin [Arg_2 ]
evalwcet1bb4in [Arg_2 ]

MPRF for transition 9:evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_1-1):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && 2<=Arg_1 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2-1 ]
evalwcet1bb6in [Arg_2+Arg_3-1 ]
evalwcet1bb1in [Arg_1+Arg_2 ]
evalwcet1bbin [Arg_1+Arg_2 ]
evalwcet1bb4in [Arg_1+Arg_2 ]

MPRF for transition 10:evalwcet1bb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb6in(Arg_0,Arg_1,Arg_2,0):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 2<=Arg_0+Arg_2 && Arg_1<=1 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2+1 ]
evalwcet1bb6in [Arg_2 ]
evalwcet1bb1in [Arg_2 ]
evalwcet1bbin [Arg_2+1 ]
evalwcet1bb4in [Arg_2+1 ]

MPRF for transition 11:evalwcet1bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bbin(Arg_0,Arg_3,Arg_2-1,Arg_3):|:Arg_3<=1+Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 1<=Arg_2+Arg_3 && 0<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && 2<=Arg_2 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2-1 ]
evalwcet1bb6in [Arg_2-1 ]
evalwcet1bb1in [Arg_2-1 ]
evalwcet1bbin [Arg_2-1 ]
evalwcet1bb4in [Arg_2-1 ]

MPRF for transition 3:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && E+1<=0 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2 ]
evalwcet1bb6in [Arg_2-1 ]
evalwcet1bb1in [Arg_2-1 ]
evalwcet1bbin [Arg_2 ]
evalwcet1bb4in [Arg_2 ]

MPRF for transition 4:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 && 1<=E of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2 ]
evalwcet1bb6in [Arg_2-1 ]
evalwcet1bb1in [Arg_2-1 ]
evalwcet1bbin [Arg_2 ]
evalwcet1bb4in [Arg_2 ]

MPRF for transition 5:evalwcet1bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalwcet1bb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_0+Arg_1 && 1<=Arg_0 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalwcet1bb5in [Arg_2-1 ]
evalwcet1bb6in [Arg_2-1 ]
evalwcet1bb1in [Arg_2-1 ]
evalwcet1bbin [Arg_2 ]
evalwcet1bb4in [Arg_2-1 ]

All Bounds

Timebounds

Overall timebound:9*Arg_0+7 {O(n)}
6: evalwcet1bb1in->evalwcet1bb6in: Arg_0 {O(n)}
7: evalwcet1bb1in->evalwcet1bb6in: Arg_0 {O(n)}
8: evalwcet1bb4in->evalwcet1bb5in: Arg_0 {O(n)}
9: evalwcet1bb4in->evalwcet1bb6in: Arg_0 {O(n)}
10: evalwcet1bb5in->evalwcet1bb6in: Arg_0+1 {O(n)}
11: evalwcet1bb6in->evalwcet1bbin: Arg_0+1 {O(n)}
12: evalwcet1bb6in->evalwcet1returnin: 1 {O(1)}
3: evalwcet1bbin->evalwcet1bb1in: Arg_0 {O(n)}
4: evalwcet1bbin->evalwcet1bb1in: Arg_0 {O(n)}
5: evalwcet1bbin->evalwcet1bb4in: Arg_0 {O(n)}
1: evalwcet1entryin->evalwcet1bbin: 1 {O(1)}
2: evalwcet1entryin->evalwcet1returnin: 1 {O(1)}
13: evalwcet1returnin->evalwcet1stop: 1 {O(1)}
0: evalwcet1start->evalwcet1entryin: 1 {O(1)}

Costbounds

Overall costbound: 9*Arg_0+7 {O(n)}
6: evalwcet1bb1in->evalwcet1bb6in: Arg_0 {O(n)}
7: evalwcet1bb1in->evalwcet1bb6in: Arg_0 {O(n)}
8: evalwcet1bb4in->evalwcet1bb5in: Arg_0 {O(n)}
9: evalwcet1bb4in->evalwcet1bb6in: Arg_0 {O(n)}
10: evalwcet1bb5in->evalwcet1bb6in: Arg_0+1 {O(n)}
11: evalwcet1bb6in->evalwcet1bbin: Arg_0+1 {O(n)}
12: evalwcet1bb6in->evalwcet1returnin: 1 {O(1)}
3: evalwcet1bbin->evalwcet1bb1in: Arg_0 {O(n)}
4: evalwcet1bbin->evalwcet1bb1in: Arg_0 {O(n)}
5: evalwcet1bbin->evalwcet1bb4in: Arg_0 {O(n)}
1: evalwcet1entryin->evalwcet1bbin: 1 {O(1)}
2: evalwcet1entryin->evalwcet1returnin: 1 {O(1)}
13: evalwcet1returnin->evalwcet1stop: 1 {O(1)}
0: evalwcet1start->evalwcet1entryin: 1 {O(1)}

Sizebounds

6: evalwcet1bb1in->evalwcet1bb6in, Arg_0: 3*Arg_0 {O(n)}
6: evalwcet1bb1in->evalwcet1bb6in, Arg_1: Arg_0+2 {O(n)}
6: evalwcet1bb1in->evalwcet1bb6in, Arg_2: 3*Arg_0 {O(n)}
6: evalwcet1bb1in->evalwcet1bb6in, Arg_3: 0 {O(1)}
7: evalwcet1bb1in->evalwcet1bb6in, Arg_0: 3*Arg_0 {O(n)}
7: evalwcet1bb1in->evalwcet1bb6in, Arg_1: Arg_0+2 {O(n)}
7: evalwcet1bb1in->evalwcet1bb6in, Arg_2: 3*Arg_0 {O(n)}
7: evalwcet1bb1in->evalwcet1bb6in, Arg_3: 2*Arg_0+6 {O(n)}
8: evalwcet1bb4in->evalwcet1bb5in, Arg_0: 3*Arg_0 {O(n)}
8: evalwcet1bb4in->evalwcet1bb5in, Arg_1: 1 {O(1)}
8: evalwcet1bb4in->evalwcet1bb5in, Arg_2: 3*Arg_0 {O(n)}
8: evalwcet1bb4in->evalwcet1bb5in, Arg_3: 3*Arg_0+Arg_3+8 {O(n)}
9: evalwcet1bb4in->evalwcet1bb6in, Arg_0: 3*Arg_0 {O(n)}
9: evalwcet1bb4in->evalwcet1bb6in, Arg_1: Arg_0+2 {O(n)}
9: evalwcet1bb4in->evalwcet1bb6in, Arg_2: 3*Arg_0 {O(n)}
9: evalwcet1bb4in->evalwcet1bb6in, Arg_3: Arg_0+2 {O(n)}
10: evalwcet1bb5in->evalwcet1bb6in, Arg_0: 3*Arg_0 {O(n)}
10: evalwcet1bb5in->evalwcet1bb6in, Arg_1: 1 {O(1)}
10: evalwcet1bb5in->evalwcet1bb6in, Arg_2: 3*Arg_0 {O(n)}
10: evalwcet1bb5in->evalwcet1bb6in, Arg_3: 0 {O(1)}
11: evalwcet1bb6in->evalwcet1bbin, Arg_0: 3*Arg_0 {O(n)}
11: evalwcet1bb6in->evalwcet1bbin, Arg_1: Arg_0+2 {O(n)}
11: evalwcet1bb6in->evalwcet1bbin, Arg_2: 3*Arg_0 {O(n)}
11: evalwcet1bb6in->evalwcet1bbin, Arg_3: 3*Arg_0+8 {O(n)}
12: evalwcet1bb6in->evalwcet1returnin, Arg_0: 12*Arg_0 {O(n)}
12: evalwcet1bb6in->evalwcet1returnin, Arg_1: 3*Arg_0+7 {O(n)}
12: evalwcet1bb6in->evalwcet1returnin, Arg_2: 1 {O(1)}
12: evalwcet1bb6in->evalwcet1returnin, Arg_3: 3*Arg_0+8 {O(n)}
3: evalwcet1bbin->evalwcet1bb1in, Arg_0: 3*Arg_0 {O(n)}
3: evalwcet1bbin->evalwcet1bb1in, Arg_1: Arg_0+2 {O(n)}
3: evalwcet1bbin->evalwcet1bb1in, Arg_2: 3*Arg_0 {O(n)}
3: evalwcet1bbin->evalwcet1bb1in, Arg_3: 3*Arg_0+Arg_3+8 {O(n)}
4: evalwcet1bbin->evalwcet1bb1in, Arg_0: 3*Arg_0 {O(n)}
4: evalwcet1bbin->evalwcet1bb1in, Arg_1: Arg_0+2 {O(n)}
4: evalwcet1bbin->evalwcet1bb1in, Arg_2: 3*Arg_0 {O(n)}
4: evalwcet1bbin->evalwcet1bb1in, Arg_3: 3*Arg_0+Arg_3+8 {O(n)}
5: evalwcet1bbin->evalwcet1bb4in, Arg_0: 3*Arg_0 {O(n)}
5: evalwcet1bbin->evalwcet1bb4in, Arg_1: Arg_0+2 {O(n)}
5: evalwcet1bbin->evalwcet1bb4in, Arg_2: 3*Arg_0 {O(n)}
5: evalwcet1bbin->evalwcet1bb4in, Arg_3: 3*Arg_0+Arg_3+8 {O(n)}
1: evalwcet1entryin->evalwcet1bbin, Arg_0: Arg_0 {O(n)}
1: evalwcet1entryin->evalwcet1bbin, Arg_1: 0 {O(1)}
1: evalwcet1entryin->evalwcet1bbin, Arg_2: Arg_0 {O(n)}
1: evalwcet1entryin->evalwcet1bbin, Arg_3: Arg_3 {O(n)}
2: evalwcet1entryin->evalwcet1returnin, Arg_0: Arg_0 {O(n)}
2: evalwcet1entryin->evalwcet1returnin, Arg_1: Arg_1 {O(n)}
2: evalwcet1entryin->evalwcet1returnin, Arg_2: Arg_2 {O(n)}
2: evalwcet1entryin->evalwcet1returnin, Arg_3: Arg_3 {O(n)}
13: evalwcet1returnin->evalwcet1stop, Arg_0: 13*Arg_0 {O(n)}
13: evalwcet1returnin->evalwcet1stop, Arg_1: 3*Arg_0+Arg_1+7 {O(n)}
13: evalwcet1returnin->evalwcet1stop, Arg_2: Arg_2+1 {O(n)}
13: evalwcet1returnin->evalwcet1stop, Arg_3: 3*Arg_0+Arg_3+8 {O(n)}
0: evalwcet1start->evalwcet1entryin, Arg_0: Arg_0 {O(n)}
0: evalwcet1start->evalwcet1entryin, Arg_1: Arg_1 {O(n)}
0: evalwcet1start->evalwcet1entryin, Arg_2: Arg_2 {O(n)}
0: evalwcet1start->evalwcet1entryin, Arg_3: Arg_3 {O(n)}