Initial Problem

Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f0, n_f10___1, n_f3___2, n_f3___3, n_f3___4
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f3___4(1,Arg_1)
1:n_f3___2(Arg_0,Arg_1) -> n_f10___1(Arg_0,Arg_1):|:Arg_0+Arg_1<=11 && 11<=Arg_0+Arg_1 && Arg_0<=11 && 11<=Arg_0
2:n_f3___2(Arg_0,Arg_1) -> n_f3___2(Arg_0+1,10-Arg_0):|:Arg_0+Arg_1<=11 && 11<=Arg_0+Arg_1 && Arg_0<=11 && Arg_0<=10
3:n_f3___3(Arg_0,Arg_1) -> n_f3___2(Arg_0+1,10-Arg_0):|:Arg_0<=10 && Arg_0<=10 && Arg_0+Arg_1<=11 && 11<=Arg_0+Arg_1 && Arg_0<=11 && Arg_0<=10
4:n_f3___4(Arg_0,Arg_1) -> n_f3___3(Arg_0+1,10-Arg_0):|:Arg_0<=10 && Arg_0<=1 && 1<=Arg_0 && Arg_0<=10 && Arg_0<=10

Preprocessing

Found invariant Arg_1<=8 && Arg_1<=5+Arg_0 && Arg_0+Arg_1<=11 && 0<=Arg_1 && 11<=Arg_0+Arg_1 && Arg_0<=11+Arg_1 && Arg_0<=11 && 3<=Arg_0 for location n_f3___2

Found invariant Arg_0<=1 && 1<=Arg_0 for location n_f3___4

Found invariant Arg_1<=0 && 11+Arg_1<=Arg_0 && Arg_0+Arg_1<=11 && 0<=Arg_1 && 11<=Arg_0+Arg_1 && Arg_0<=11+Arg_1 && Arg_0<=11 && 11<=Arg_0 for location n_f10___1

Found invariant Arg_1<=9 && Arg_1<=7+Arg_0 && Arg_0+Arg_1<=11 && 9<=Arg_1 && 11<=Arg_0+Arg_1 && 7+Arg_0<=Arg_1 && Arg_0<=2 && 2<=Arg_0 for location n_f3___3

Problem after Preprocessing

Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f0, n_f10___1, n_f3___2, n_f3___3, n_f3___4
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f3___4(1,Arg_1)
1:n_f3___2(Arg_0,Arg_1) -> n_f10___1(Arg_0,Arg_1):|:Arg_1<=8 && Arg_1<=5+Arg_0 && Arg_0+Arg_1<=11 && 0<=Arg_1 && 11<=Arg_0+Arg_1 && Arg_0<=11+Arg_1 && Arg_0<=11 && 3<=Arg_0 && Arg_0+Arg_1<=11 && 11<=Arg_0+Arg_1 && Arg_0<=11 && 11<=Arg_0
2:n_f3___2(Arg_0,Arg_1) -> n_f3___2(Arg_0+1,10-Arg_0):|:Arg_1<=8 && Arg_1<=5+Arg_0 && Arg_0+Arg_1<=11 && 0<=Arg_1 && 11<=Arg_0+Arg_1 && Arg_0<=11+Arg_1 && Arg_0<=11 && 3<=Arg_0 && Arg_0+Arg_1<=11 && 11<=Arg_0+Arg_1 && Arg_0<=11 && Arg_0<=10
3:n_f3___3(Arg_0,Arg_1) -> n_f3___2(Arg_0+1,10-Arg_0):|:Arg_1<=9 && Arg_1<=7+Arg_0 && Arg_0+Arg_1<=11 && 9<=Arg_1 && 11<=Arg_0+Arg_1 && 7+Arg_0<=Arg_1 && Arg_0<=2 && 2<=Arg_0 && Arg_0<=10 && Arg_0<=10 && Arg_0+Arg_1<=11 && 11<=Arg_0+Arg_1 && Arg_0<=11 && Arg_0<=10
4:n_f3___4(Arg_0,Arg_1) -> n_f3___3(Arg_0+1,10-Arg_0):|:Arg_0<=1 && 1<=Arg_0 && Arg_0<=10 && Arg_0<=1 && 1<=Arg_0 && Arg_0<=10 && Arg_0<=10

MPRF for transition 2:n_f3___2(Arg_0,Arg_1) -> n_f3___2(Arg_0+1,10-Arg_0):|:Arg_1<=8 && Arg_1<=5+Arg_0 && Arg_0+Arg_1<=11 && 0<=Arg_1 && 11<=Arg_0+Arg_1 && Arg_0<=11+Arg_1 && Arg_0<=11 && 3<=Arg_0 && Arg_0+Arg_1<=11 && 11<=Arg_0+Arg_1 && Arg_0<=11 && Arg_0<=10 of depth 1:

new bound:

15 {O(1)}

MPRF:

n_f3___2 [12-Arg_0 ]

All Bounds

Timebounds

Overall timebound:19 {O(1)}
0: n_f0->n_f3___4: 1 {O(1)}
1: n_f3___2->n_f10___1: 1 {O(1)}
2: n_f3___2->n_f3___2: 15 {O(1)}
3: n_f3___3->n_f3___2: 1 {O(1)}
4: n_f3___4->n_f3___3: 1 {O(1)}

Costbounds

Overall costbound: 19 {O(1)}
0: n_f0->n_f3___4: 1 {O(1)}
1: n_f3___2->n_f10___1: 1 {O(1)}
2: n_f3___2->n_f3___2: 15 {O(1)}
3: n_f3___3->n_f3___2: 1 {O(1)}
4: n_f3___4->n_f3___3: 1 {O(1)}

Sizebounds

0: n_f0->n_f3___4, Arg_0: 1 {O(1)}
0: n_f0->n_f3___4, Arg_1: Arg_1 {O(n)}
1: n_f3___2->n_f10___1, Arg_0: 11 {O(1)}
1: n_f3___2->n_f10___1, Arg_1: 0 {O(1)}
2: n_f3___2->n_f3___2, Arg_0: 11 {O(1)}
2: n_f3___2->n_f3___2, Arg_1: 7 {O(1)}
3: n_f3___3->n_f3___2, Arg_0: 3 {O(1)}
3: n_f3___3->n_f3___2, Arg_1: 8 {O(1)}
4: n_f3___4->n_f3___3, Arg_0: 2 {O(1)}
4: n_f3___4->n_f3___3, Arg_1: 9 {O(1)}