Initial Problem

Start: n_f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: A_P, B_P
Locations: n_f0, n_f4___1
Transitions:
0:n_f0(Arg_0,Arg_1,Arg_2) -> n_f4___1(A_P,B_P,Arg_1):|:A_P+1<=B_P && B_P<=1+A_P
1:n_f4___1(Arg_0,Arg_1,Arg_2) -> n_f4___1(A_P,B_P,Arg_1):|:1+Arg_0<=Arg_1 && Arg_1<=1+Arg_0 && 1+Arg_0<=Arg_1 && Arg_1<=1+Arg_0 && A_P+1<=B_P && B_P<=1+A_P

Preprocessing

Eliminate variables {Arg_2} that do not contribute to the problem

Found invariant Arg_1<=1+Arg_0 && 1+Arg_0<=Arg_1 for location n_f4___1

Problem after Preprocessing

Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, B_P
Locations: n_f0, n_f4___1
Transitions:
5:n_f0(Arg_0,Arg_1) -> n_f4___1(A_P,B_P):|:A_P+1<=B_P && B_P<=1+A_P
6:n_f4___1(Arg_0,Arg_1) -> n_f4___1(A_P,B_P):|:Arg_1<=1+Arg_0 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && Arg_1<=1+Arg_0 && 1+Arg_0<=Arg_1 && Arg_1<=1+Arg_0 && A_P+1<=B_P && B_P<=1+A_P

All Bounds

Timebounds

Overall timebound:inf {Infinity}
5: n_f0->n_f4___1: 1 {O(1)}
6: n_f4___1->n_f4___1: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
5: n_f0->n_f4___1: 1 {O(1)}
6: n_f4___1->n_f4___1: inf {Infinity}

Sizebounds