[guided]The order property says that one formula can encode arbitrarily long finite linear orders. [Morley's order-spectrum theorem](/page/Morley%20Order-Spectrum%20Theorem) upgrades this finite coding into models built over arbitrary linear orders, and its preservation clause says that the oriented cut spectrum of the indexing order is recoverable from the resulting $T$-model up to isomorphism.
Fix an uncountable cardinal $\kappa$ and a formula $\varphi(x;y)$ witnessing the order property. For a linear order $L$, a cut is a decomposition $(A,B)$ where $A \cup B=L$, every element of $A$ is less than every element of $B$, and $A$ is an initial segment. We include endpoint cuts. The invariant is
\begin{align*}
\operatorname{Cuts}(L) := \{(\operatorname{cf}_L(A),\operatorname{ci}_L(B)) : (A,B) \text{ is a cut of } L\},
\end{align*}
where $\operatorname{cf}_L(A)$ is the least size of a cofinal subset of $A$, $\operatorname{ci}_L(B)$ is the least size of a coinitial subset of $B$, and the value is $0$ for the empty side.
The hypotheses of Morley's order-spectrum theorem are satisfied: $T$ is complete and countable by assumption, and $\varphi(x;y)$ has the order property by choice of $\varphi$. Therefore, for each linear order $I$, the theorem gives a model $M_I \models T$ and a map
\begin{align*}
s_I: I &\to M_I^{|x|} \times M_I^{|y|} \\
i &\mapsto (a_i,b_i),
\end{align*}
where $a_i$ is a tuple from $M_I^{|x|}$ and $b_i$ is a tuple from $M_I^{|y|}$. The sequence is order-indiscernible, and $\varphi$ reads the indexing order:
\begin{align*}
M_I \models \varphi(a_i;b_j) \quad \Longleftrightarrow \quad i <_I j.
\end{align*}
The theorem also gives $|M_I|=|I|+\aleph_0$ and the preservation clause: if $M_I \cong M_J$ as $T$-models, then
\begin{align*}
\operatorname{Cuts}(I)=\operatorname{Cuts}(J).
\end{align*}
This is the key point: an arbitrary isomorphism need not carry the chosen skeleton of one EM model to the chosen skeleton of the other, so the cut-spectrum preservation is a genuine theorem, not a consequence of elementwise preservation of $\varphi$ alone.
Now choose $I=\kappa$ with its usual well-order and choose $J=\kappa^*$ with the reverse order. Both have cardinality $\kappa$, so the size clause gives
\begin{align*}
|M_I|=|M_J|=\kappa+\aleph_0=\kappa.
\end{align*}
For $I=\kappa$, every cut is determined by an ordinal $\alpha \leq \kappa$:
\begin{align*}
A_\alpha &= \{\beta < \kappa : \beta < \alpha\}, & B_\alpha &= \{\beta < \kappa : \alpha \leq \beta\}.
\end{align*}
If $\alpha<\kappa$, then $B_\alpha$ has least element $\alpha$, so $\operatorname{ci}_I(B_\alpha)=1$; if $\alpha=\kappa$, then $B_\kappa=\varnothing$ and $\operatorname{cf}_I(A_\kappa)=\operatorname{cf}(\kappa)$. Hence
\begin{align*}
(\operatorname{cf}(\kappa),0) \in \operatorname{Cuts}(I).
\end{align*}
For $J=\kappa^*$, every nonempty initial segment has a greatest element in the order $J$: it is of the form $\{\beta<\kappa: \alpha \leq \beta\}$ for some $\alpha<\kappa$, and $\alpha$ is greatest with respect to $<_J$. Therefore every cut of $J$ with nonempty lower side has first coordinate $1$, while the left endpoint cut has first coordinate $0$. Thus the first coordinate of every pair in $\operatorname{Cuts}(J)$ is either $0$ or $1$. Since $\kappa$ is uncountable, $\operatorname{cf}(\kappa)>1$, so
\begin{align*}
(\operatorname{cf}(\kappa),0) \notin \operatorname{Cuts}(J).
\end{align*}
Therefore $\operatorname{Cuts}(I) \neq \operatorname{Cuts}(J)$.
If there were an isomorphism $F:M_I\to M_J$, Morley's preservation clause would imply $\operatorname{Cuts}(I)=\operatorname{Cuts}(J)$, contradicting the computation above. Hence $M_I$ and $M_J$ are non-isomorphic models of $T$ of cardinality $\kappa$. Since $\kappa$ was arbitrary, every uncountable cardinal supports at least two non-isomorphic models of $T$.[/guided]