It is a very interesting paper. Given a transition system and a temporal logc property, generate a program that search for the proof or counterexample of this property. and then use existing program analysis tools to determine that whether this program terminate with some answer.
All the methods that boost the speed, such as abstraction refinement, will be automatically performed by the program analysis tools.