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(2*Arg_0+Arg_1,Arg_1+1,Arg_2):|:0<=Arg_0+Arg_1 && Arg_0<=Arg_2

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(2*Arg_0+Arg_1,Arg_1+1,Arg_2):|:0<=Arg_0+Arg_1 && Arg_0<=Arg_2

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

new bound:

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

MPRF:

l1 [1-Arg_0-Arg_1 ; Arg_2-Arg_0 ]

All Bounds

Timebounds

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

Costbounds

Overall costbound: 16*Arg_0+8*Arg_1+8*Arg_2+10 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 16*Arg_0+8*Arg_1+8*Arg_2+9 {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: 144*2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*Arg_1*Arg_2+152*2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*Arg_2+172*2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*Arg_1+256*2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*Arg_0*Arg_0+256*2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*Arg_0*Arg_2+288*2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*Arg_0*Arg_1+2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*305*Arg_0+2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*64*Arg_2*Arg_2+2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*80*Arg_1*Arg_1+2^(16*Arg_0+8*Arg_1+8*Arg_2+9)*90 {O(EXP)}
1: l1->l1, Arg_1: 16*Arg_0+8*Arg_2+9*Arg_1+9 {O(n)}
1: l1->l1, Arg_2: Arg_2 {O(n)}