Initial Problem

Start: f10
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5
Temp_Vars: G, H
Locations: f10, f4, f6, f7, f9
Transitions:
0:f10(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f4(4,0,0,Arg_3,Arg_4,Arg_5)
3:f4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f4(Arg_0,1+Arg_1,G,H,Arg_4,G)
1:f4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f9(Arg_0,Arg_1,Arg_2,Arg_2,Arg_2,Arg_5)
4:f6(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f4(Arg_0,1+Arg_1,G,H,Arg_4,G)
2:f7(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f4(Arg_0,1+Arg_1,G,H,Arg_4,G)

Preprocessing

Cut unreachable locations [f6; f7] from the program graph

Eliminate variables {G,H,Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5} that do not contribute to the problem

Problem after Preprocessing

Start: f10
Program_Vars:
Temp_Vars:
Locations: f10, f4, f9
Transitions:
9:f10 -> f4
11:f4 -> f4
10:f4 -> f9

All Bounds

Timebounds

Overall timebound:inf {Infinity}
9: f10->f4: 1 {O(1)}
10: f4->f9: 1 {O(1)}
11: f4->f4: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
9: f10->f4: 1 {O(1)}
10: f4->f9: 1 {O(1)}
11: f4->f4: inf {Infinity}

Sizebounds