Background:
If a module $M$ is semisimple then every submodule $N \subseteq M$ is a direct summand.
In other terms, there exists a submodule $H \subseteq M$ such that $N \cap H = \{0\}$ and $N+H = M$.
Given the lattice of submodules $L(M)$ (where the infimum is $\cap$ and the supremum is $+$), we may consider what property can we impose on the module $M$ so that $L(M)$ is complemented (for each $N$ there exists $H$ such that $N \cap H = \{0\}$ and $N+H = M$). In particular, the lattice of submodules of a semisimple module is complemented iff the module is semisimple.
One can further impose the complement to be unique.
Question:
What property do I need on $M$ so that $L(M)$ is uniquely complemented?
Examples:
For instance, $\mathbb{Z}_2 \oplus \mathbb{Z}_2$ has a lattice of submodules given by:
\begin{matrix} && \mathbb{Z}_2 \oplus \mathbb{Z}_2 & \\ &\huge\diagup & \huge| & \huge\diagdown \\ (0,1) && (1,0) && (1,1) \\ &\huge\diagdown & \huge| & \huge\diagup \\ && 0 \end{matrix}
so we don't have the unique complement property. On the other hand, $\mathbb{Z}_2 \oplus \mathbb{Z}_3$ has a lattice of submodules given by:
\begin{matrix} && \mathbb{Z}_2 \oplus \mathbb{Z}_3 & \\ &\huge\diagup && \huge\diagdown \\ (1,0) &&& (0,1) \\ &\huge\diagdown && \huge\diagup \\ && 0 \end{matrix}
which is uniquely complemented.
You need the module to be distributive which, for a semisimple module, amounts to being square-free in terms of simple submodules. (I mean that no two distinct simple submodules are isomorphic.)
If a semisimple module isn't square-free, then you can construct the diamond lattice $M_3$ as you did in your first example, and that makes it nondistributive.
If the semisimple module is square-free, then the simple submodules that make up that square-free factorization actually have to be unique within the module. Since complements are obviously isomorphic, then they must be made up of the same simple submodules, but since those are unique, the complements are actually equal.
You will probably find this paper of Dilworth's very informative.