LTL formulae without temporal logic operators throws an error when checked for satisfiability

[Marc Storm Larsen]

If an LTL formulae phi is defined without any temporal logic operators is checked against a transition system, TS for satisfiability, will an error be thrown. This is because the product of TS and the corresponding NBA A of phi won't contain any states.