> Isn't this just an example of the halting problem? As in, you can't prove that a program won't ever halt.

Not really, the HP is about writing a program which automatically proves halting/not-halting for every possible program you feed into it.