As always with this theorem it's pretty hard to be sure if the kind of non provable statement happen often enough to be a concern in practice

But most code isn't using the features that make Turing complete languages messy, i.e. evolving the executable code as executing progresses. Most real-world code exists in a subset of Turing complete languages where generic theorem proving could probably work.