We show how to construct, via forcing, splitting families that are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different, concretely: the 10 (non-dependent) entries in Cichoń’s diagram, $$\mathfrak{m}$$
m
(2-Knaster), $$\mathfrak{p}$$
p
, $$\mathfrak{h}$$
h
, the splitting number $$\mathfrak{s}$$
s
and the reaping number $$\mathfrak{r}$$
r
.