Initial Problem

Start: n_f1
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f1, n_f2___2, n_f2___3, n_f2___4, n_f3___1
Transitions:
0:n_f1(Arg_0,Arg_1) -> n_f2___4(Arg_0,Arg_1):|:1<=Arg_0 && 1+Arg_0+Arg_1<=0
1:n_f2___2(Arg_0,Arg_1) -> n_f2___2(Arg_0-Arg_1,Arg_1):|:0<=Arg_0+Arg_1 && 0<=Arg_0
2:n_f2___2(Arg_0,Arg_1) -> n_f3___1(Arg_0,Arg_1):|:0<=Arg_0+Arg_1 && 1+Arg_0<=0
3:n_f2___3(Arg_0,Arg_1) -> n_f2___2(Arg_0-Arg_1,Arg_1):|:0<=Arg_0 && 0<=Arg_0 && 0<=Arg_0+Arg_1 && 0<=Arg_0
4:n_f2___4(Arg_0,Arg_1) -> n_f2___3(Arg_0-Arg_1,Arg_1):|:0<=Arg_0 && 1<=Arg_0 && 1+Arg_0+Arg_1<=0 && 0<=Arg_0 && 0<=Arg_0

Preprocessing

Found invariant 2+Arg_1<=0 && 7+Arg_1<=Arg_0 && 3<=Arg_0+Arg_1 && 5<=Arg_0 for location n_f2___2

Found invariant 2+Arg_1<=0 && 3+Arg_1<=Arg_0 && 1+Arg_0+Arg_1<=0 && 1<=Arg_0 for location n_f2___4

Found invariant 1<=0 for location n_f3___1

Found invariant 2+Arg_1<=0 && 5+Arg_1<=Arg_0 && 1<=Arg_0+Arg_1 && 3<=Arg_0 for location n_f2___3

Cut unsatisfiable transition 2: n_f2___2->n_f3___1

Cut unreachable locations [n_f3___1] from the program graph

Problem after Preprocessing

Start: n_f1
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f1, n_f2___2, n_f2___3, n_f2___4
Transitions:
0:n_f1(Arg_0,Arg_1) -> n_f2___4(Arg_0,Arg_1):|:1<=Arg_0 && 1+Arg_0+Arg_1<=0
1:n_f2___2(Arg_0,Arg_1) -> n_f2___2(Arg_0-Arg_1,Arg_1):|:2+Arg_1<=0 && 7+Arg_1<=Arg_0 && 3<=Arg_0+Arg_1 && 5<=Arg_0 && 0<=Arg_0+Arg_1 && 0<=Arg_0
3:n_f2___3(Arg_0,Arg_1) -> n_f2___2(Arg_0-Arg_1,Arg_1):|:2+Arg_1<=0 && 5+Arg_1<=Arg_0 && 1<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_0 && 0<=Arg_0 && 0<=Arg_0+Arg_1 && 0<=Arg_0
4:n_f2___4(Arg_0,Arg_1) -> n_f2___3(Arg_0-Arg_1,Arg_1):|:2+Arg_1<=0 && 3+Arg_1<=Arg_0 && 1+Arg_0+Arg_1<=0 && 1<=Arg_0 && 0<=Arg_0 && 1<=Arg_0 && 1+Arg_0+Arg_1<=0 && 0<=Arg_0 && 0<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: n_f1->n_f2___4: 1 {O(1)}
1: n_f2___2->n_f2___2: inf {Infinity}
3: n_f2___3->n_f2___2: 1 {O(1)}
4: n_f2___4->n_f2___3: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
0: n_f1->n_f2___4: 1 {O(1)}
1: n_f2___2->n_f2___2: inf {Infinity}
3: n_f2___3->n_f2___2: 1 {O(1)}
4: n_f2___4->n_f2___3: 1 {O(1)}

Sizebounds

0: n_f1->n_f2___4, Arg_0: Arg_0 {O(n)}
0: n_f1->n_f2___4, Arg_1: Arg_1 {O(n)}
1: n_f2___2->n_f2___2, Arg_1: Arg_1 {O(n)}
3: n_f2___3->n_f2___2, Arg_0: 4*Arg_1 {O(n)}
3: n_f2___3->n_f2___2, Arg_1: Arg_1 {O(n)}
4: n_f2___4->n_f2___3, Arg_0: 2*Arg_1 {O(n)}
4: n_f2___4->n_f2___3, Arg_1: Arg_1 {O(n)}