Subsumption Trees for On-The-Fly Universality Checking of Finite-State Automata