Seol mar théacs é seo: The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata