I'm studying Hopcroft-Karp algorithm in bipartite graph.

I can understand the theorems about the algorithm, but I want to find a more specific example.

Can I find a bipartite graph that iterates an algorithm more than three times?

I tried to find it, but most of graphs ended in two iterations. (1 BFS + 1 DFS)