Minimization of visibly pushdown automata is NP-complete (Logical Methods in Computer Science, 2020)