In this talk we will show 4 different issues that make OO verification uniquely challenging. Those issues are very subtle and they may go unnoticed at first. Those are about termination, leaky partial verification, ill founded contracts and inevitable reduction to primitive operations. This talk will show concrete code examples that can be easily adapted to be run in many different OO verifiers, so that we can use them as a benchmark against well known forms of unsoundness.