I think the idea is that systems with a finite unicity distance can be "unbreakable, in practice" because brute force would take too long, but in theory if you had enough ciphertext and did exhaust the keyspace you could show that only one possible key produces realistic output. When the key has as many degrees of freedom as the plaintext, every possible valid output has a possible key.