Some properties of elementary embeddability in the model theory

It is known that isomorphism implies elementary embeddability, and elementary embeddability implies elementary equivalence. Both converse statements are wrong. These three relationships in the class of models of some theory $T$ of a countable language $L$ of first order are considered.