Simplicity conjecture for extremal automata

Let an extremal automaton be a synchronizing automaton attaining equality in the Černý bound. Simplicity conjecture. Every extremal automaton is simple.

The conjecture is motivated by the fact that the known examples of extremal automata, including the Černý automata and several sporadic examples, are simple. The supplied text does not establish the conjecture.