How can you state how abstract interpretation gets around Rice's Theorem succinctly?
To be as clear and concise as possible, I'd try saying this


  Abstract interpretation may only over-approximate properties of programs: the most precise abstract value of a program $P$ may be $a$, but any algorithm for computing an abstract value will in general compute some value $a'\geq a$ for $P$ (possibly $\top$ in the worst case).