Initial Problem

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

Preprocessing

Problem after Preprocessing

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

MPRF for transition 1:l1(Arg_0,Arg_1) -> l1(Arg_0-2*Arg_1,Arg_1+1):|:1<=Arg_0 of depth 2:

new bound:

16*Arg_1+8*Arg_0+9 {O(n)}

MPRF:

l1 [1-2*Arg_1 ; Arg_0 ]

All Bounds

Timebounds

Overall timebound:16*Arg_1+8*Arg_0+10 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 16*Arg_1+8*Arg_0+9 {O(n)}

Costbounds

Overall costbound: 16*Arg_1+8*Arg_0+10 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 16*Arg_1+8*Arg_0+9 {O(n)}

Sizebounds

0: l0->l1, Arg_0: Arg_0 {O(n)}
0: l0->l1, Arg_1: Arg_1 {O(n)}
1: l1->l1, Arg_0: 153*2^(16*Arg_1+8*Arg_0+9)*Arg_0+272*2^(16*Arg_1+8*Arg_0+9)*Arg_0*Arg_1+288*2^(16*Arg_1+8*Arg_0+9)*Arg_1*Arg_1+2^(16*Arg_1+8*Arg_0+9)*324*Arg_1+2^(16*Arg_1+8*Arg_0+9)*64*Arg_0*Arg_0+2^(16*Arg_1+8*Arg_0+9)*90 {O(EXP)}
1: l1->l1, Arg_1: 17*Arg_1+8*Arg_0+9 {O(n)}