Start: start
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, start
Transitions:
0:f0(Arg_0,Arg_1) -> f0(Arg_0,Arg_0):|:Arg_0+1<=0 && Arg_1<=0 && 0<=Arg_1
1:f0(Arg_0,Arg_1) -> f0(Arg_0,Arg_0):|:1<=Arg_0 && Arg_1<=0 && 0<=Arg_1
2:start(Arg_0,Arg_1) -> f0(Arg_0,Arg_1)
Start: start
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, start
Transitions:
0:f0(Arg_0,Arg_1) -> f0(Arg_0,Arg_0):|:Arg_0+1<=0 && Arg_1<=0 && 0<=Arg_1
1:f0(Arg_0,Arg_1) -> f0(Arg_0,Arg_0):|:1<=Arg_0 && Arg_1<=0 && 0<=Arg_1
2:start(Arg_0,Arg_1) -> f0(Arg_0,Arg_1)
knowledge_propagation leads to new time bound 1 {O(1)} for transition 0:f0(Arg_0,Arg_1) -> f0(Arg_0,Arg_0):|:Arg_0+1<=0 && Arg_1<=0 && 0<=Arg_1
knowledge_propagation leads to new time bound 1 {O(1)} for transition 1:f0(Arg_0,Arg_1) -> f0(Arg_0,Arg_0):|:1<=Arg_0 && Arg_1<=0 && 0<=Arg_1
Overall timebound:3 {O(1)}
0: f0->f0: 1 {O(1)}
1: f0->f0: 1 {O(1)}
2: start->f0: 1 {O(1)}
Overall costbound: 3 {O(1)}
0: f0->f0: 1 {O(1)}
1: f0->f0: 1 {O(1)}
2: start->f0: 1 {O(1)}
0: f0->f0, Arg_0: Arg_0 {O(n)}
0: f0->f0, Arg_1: Arg_0 {O(n)}
1: f0->f0, Arg_0: Arg_0 {O(n)}
1: f0->f0, Arg_1: Arg_0 {O(n)}
2: start->f0, Arg_0: Arg_0 {O(n)}
2: start->f0, Arg_1: Arg_1 {O(n)}