Initial Problem

Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1,Arg_2) -> l1(Arg_0,Arg_1,Arg_2)
1:l1(Arg_0,Arg_1,Arg_2) -> l1(Arg_0+Arg_1+Arg_2,-Arg_2-1,Arg_2):|:0<=Arg_0 && 0<=Arg_0+Arg_1

Preprocessing

Problem after Preprocessing

Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1,Arg_2) -> l1(Arg_0,Arg_1,Arg_2)
1:l1(Arg_0,Arg_1,Arg_2) -> l1(Arg_0+Arg_1+Arg_2,-Arg_2-1,Arg_2):|:0<=Arg_0 && 0<=Arg_0+Arg_1

MPRF for transition 1:l1(Arg_0,Arg_1,Arg_2) -> l1(Arg_0+Arg_1+Arg_2,-Arg_2-1,Arg_2):|:0<=Arg_0 && 0<=Arg_0+Arg_1 of depth 1:

new bound:

Arg_0+Arg_1+1 {O(n)}

MPRF:

l1 [Arg_0+Arg_1+1 ]

All Bounds

Timebounds

Overall timebound:Arg_0+Arg_1+2 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: Arg_0+Arg_1+1 {O(n)}

Costbounds

Overall costbound: Arg_0+Arg_1+2 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: Arg_0+Arg_1+1 {O(n)}

Sizebounds

0: l0->l1, Arg_0: Arg_0 {O(n)}
0: l0->l1, Arg_1: Arg_1 {O(n)}
0: l0->l1, Arg_2: Arg_2 {O(n)}
1: l1->l1, Arg_0: 4*Arg_0*Arg_2+4*Arg_1*Arg_2+Arg_0*Arg_1+Arg_1*Arg_1+3*Arg_0+4*Arg_1+8*Arg_2+4 {O(n^2)}
1: l1->l1, Arg_1: 2*Arg_2+2 {O(n)}
1: l1->l1, Arg_2: Arg_2 {O(n)}