Why this Turing machine can't be an acceptor for the following language?
You are not considering the fact that $M_1(M_2)$ and/or $M_2(M_1)$ might not halt. When this happens your Turing machine for $L$ will be stuck executing step 1.