The generalized $k$-connectivity ${\kappa }_k(G)$ of graph $G$ is defined as the maximum number of internally disjoint Steiner trees in $G$, which is a generalization of classical connectivity $\kappa (G)$ of $G$ just for $k=2$. Conditional recursive networks (CRNs) form a new family of composite networks constructed from complete graphs. In this paper, we determine the generalized $k$-connectivity of CRNs for $k=4$.