Initial Problem

Start: f1
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f1, f2, f3
Transitions:
0:f1(Arg_0,Arg_1) -> f2(Arg_0,Arg_1):|:Arg_0+Arg_1+1<=0 && 1<=Arg_0
1:f2(Arg_0,Arg_1) -> f2(Arg_0-Arg_1,Arg_1):|:0<=Arg_0
2:f2(Arg_0,Arg_1) -> f3(Arg_0,Arg_1):|:Arg_0+1<=0

Preprocessing

Found invariant 1<=0 for location f3

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

Cut unsatisfiable transition 2: f2->f3

Cut unreachable locations [f3] from the program graph

Problem after Preprocessing

Start: f1
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f1, f2
Transitions:
0:f1(Arg_0,Arg_1) -> f2(Arg_0,Arg_1):|:Arg_0+Arg_1+1<=0 && 1<=Arg_0
1:f2(Arg_0,Arg_1) -> f2(Arg_0-Arg_1,Arg_1):|:2+Arg_1<=0 && 3+Arg_1<=Arg_0 && 1<=Arg_0 && 0<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: f1->f2: 1 {O(1)}
1: f2->f2: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
0: f1->f2: 1 {O(1)}
1: f2->f2: inf {Infinity}

Sizebounds

0: f1->f2, Arg_0: Arg_0 {O(n)}
0: f1->f2, Arg_1: Arg_1 {O(n)}
1: f2->f2, Arg_1: Arg_1 {O(n)}