Does every regular language contains a strictly locally testable language? Let $L$ be an infinite regular language, then does there exists a strictly locally testable  infinite language $P$ such that $P \subseteq L$?
The answer is no. The argument was suggested by phs, but you have to start with a different language. Take $L = (aa)^*$. Then any regular language $K$ contained in $L$ is of the form
$$
 K = \{(aa)^n \mid n \in U \}
$$
 for some ultimately periodic subset $U$ of $\mathbb{N}$. If $K$ is infinite, then the period $p$ of $U$ is not $0$ and thus $K$ is not star-free (hence not locally testable and not strictly locally testable).