$$L_1 = \{ w \# x \mid w, x \in \{0, 1\}^∗ \text{ and $M_w$ visit all of non-final-states at least once for any $x$} \}$$
$M_w$ is the encoded turing machine.
sorry, this is my first time asking something here.
I think it should be decidable, but i can't show any proof for that.