General-purpose correct-by-construction synthesis methods are limited to systems with low dimensionality or simple specifications. In this paper, we consider highly symmetrical counting problems and exploit the symmetry to synthesize provably correct controllers for systems with tens of thousands of states. The key ingredients of the solution are an aggregate abstraction procedure for mildly heterogeneous systems and a formulation of counting constraints as linear inequalities.