Initial Problem

Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars: F
Locations: f0, f1, f2
Transitions:
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(F,1,0,Arg_3,Arg_4)
1:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,Arg_2,Arg_3,Arg_4):|:1<=Arg_1 && 101<=Arg_0
2:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,Arg_2,Arg_3,Arg_4):|:1<=Arg_1 && Arg_0<=100
3:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,1,Arg_0,Arg_1):|:101<=Arg_0 && Arg_2<=0 && 1<=Arg_1
4:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,1,Arg_0,Arg_1):|:Arg_0<=100 && Arg_2<=0 && 1<=Arg_1
5:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_0<=Arg_3 && 1<=Arg_2 && Arg_4<=Arg_1

Preprocessing

Found invariant Arg_4<=Arg_1 && Arg_0<=Arg_3 && Arg_2<=1 && Arg_2<=1+Arg_1 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 0<=Arg_1 for location f2

Found invariant Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 for location f1

Problem after Preprocessing

Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars: F
Locations: f0, f1, f2
Transitions:
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(F,1,0,Arg_3,Arg_4)
1:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,Arg_2,Arg_3,Arg_4):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && 1<=Arg_1 && 101<=Arg_0
2:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,Arg_2,Arg_3,Arg_4):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && 1<=Arg_1 && Arg_0<=100
3:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,1,Arg_0,Arg_1):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && 101<=Arg_0 && Arg_2<=0 && 1<=Arg_1
4:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,1,Arg_0,Arg_1):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && Arg_0<=100 && Arg_2<=0 && 1<=Arg_1
5:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && Arg_0<=Arg_3 && 1<=Arg_2 && Arg_4<=Arg_1

MPRF for transition 3:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0-10,Arg_1-1,1,Arg_0,Arg_1):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && 101<=Arg_0 && Arg_2<=0 && 1<=Arg_1 of depth 1:

new bound:

1 {O(1)}

MPRF:

f1 [1-Arg_2 ]

MPRF for transition 4:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f1(Arg_0+11,Arg_1+1,1,Arg_0,Arg_1):|:Arg_2<=1 && Arg_2<=1+Arg_1 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_1 && Arg_0<=100 && Arg_2<=0 && 1<=Arg_1 of depth 1:

new bound:

1 {O(1)}

MPRF:

f1 [1-Arg_2 ]

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: f0->f1: 1 {O(1)}
1: f1->f1: inf {Infinity}
2: f1->f1: inf {Infinity}
3: f1->f1: 1 {O(1)}
4: f1->f1: 1 {O(1)}
5: f1->f2: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
0: f0->f1: 1 {O(1)}
1: f1->f1: inf {Infinity}
2: f1->f1: inf {Infinity}
3: f1->f1: 1 {O(1)}
4: f1->f1: 1 {O(1)}
5: f1->f2: 1 {O(1)}

Sizebounds

0: f0->f1, Arg_1: 1 {O(1)}
0: f0->f1, Arg_2: 0 {O(1)}
0: f0->f1, Arg_3: Arg_3 {O(n)}
0: f0->f1, Arg_4: Arg_4 {O(n)}
1: f1->f1, Arg_2: 1 {O(1)}
2: f1->f1, Arg_2: 1 {O(1)}
3: f1->f1, Arg_2: 1 {O(1)}
4: f1->f1, Arg_2: 1 {O(1)}
5: f1->f2, Arg_2: 1 {O(1)}