1. A pessimistic tx originating on A acquires a lock on key K primary owned by A
2. Node B joins and becomes primary owner of key K
3. state transfer causes the tx to be sent to B and a backup lock is acquired on B
3. The tx commits and unlocks K on B
4. Another tx on A tries to lock key K but fails with TimeoutException because it still appears to be locked.
5. If another Tx on B tries to lock K it succeeds.
NumOwners=1
1. A pessimistic tx originating on A acquires a lock on key K primary owned by A
2. Node B joins and becomes primary owner of key K
3. state transfer causes the tx to be sent to B and a backup lock is acquired on B
3. The tx commits and unlocks K on B
4. Another tx on A tries to lock key K but fails with TimeoutException because it still appears to be locked.
5. If another Tx on B tries to lock K it succeeds.