In https://dl.acm.org/doi/10.1145/3290316 section 4 (which I believe is a standard reference), the authors claimed that Voevodsky's propositional resizing rule justifies the consistency of an impredicative strict Prop. This is also how it is implemented in Coq. Then, in section 6.5, Agda said the termination checker assumes predicativity and hence it's problematic to be impredicative. I don't understand that. I don't see the relation between termination checking and predicativity.
So, how does that affect predicativity?