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(2*Arg_0,3*Arg_1):|:Arg_0<=4*Arg_1 && Arg_1<=Arg_0 && 1<=Arg_0 && 1<=Arg_1

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(2*Arg_0,3*Arg_1):|:Arg_0<=4*Arg_1 && Arg_1<=Arg_0 && 1<=Arg_0 && 1<=Arg_1

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

new bound:

189*Arg_1+81*Arg_0+55 {O(n)}

MPRF:

l1 [Arg_0+1-4*Arg_1 ; Arg_0+1-2*Arg_1 ; Arg_0-Arg_1 ]

All Bounds

Timebounds

Overall timebound:189*Arg_1+81*Arg_0+56 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 189*Arg_1+81*Arg_0+55 {O(n)}

Costbounds

Overall costbound: 189*Arg_1+81*Arg_0+56 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 189*Arg_1+81*Arg_0+55 {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: 2^(189*Arg_1+81*Arg_0+55)*Arg_0 {O(EXP)}
1: l1->l1, Arg_1: 3^(189*Arg_1+81*Arg_0+55)*Arg_1 {O(EXP)}