Why iterative deepening search is incomplete?

Iterative deepening search (IDS) is generally considered complete for finite state spaces, as it systematically explores all possible depths and will eventually find a solution if one exists. However, it can be seen as incomplete in certain contexts, such as infinite state spaces, where it cannot guarantee termination because it may keep expanding depth without ever finding a solution. Additionally, if there are cycles in the search space without proper cycle detection, IDS may enter an infinite loop, further contributing to its incompleteness in specific scenariOS.