(Following question 2269073. See also respective lower bounds.)
Let $q$ and $r$ be coprime integers, $1\le r < q$, and consider the arithmetic progression $$ r, \ r+q, \ r+2q, \ r+3q, \ldots \tag{P} $$
Dirichlet proved that there are infinitely many primes in progression (P).
Let $R(n,q,r)$ be the $n$th record gap between primes in progression (P). For example, with $q=6$ and $r=1$, we have $R(n,6,1)=\mbox{A268925}(n)$; see http://oeis.org/A268925.
Conjecture (see arXiv:1709.05508): Almost all record gaps satisfy $$ R(n,q,r) < \varphi(q) n^2 + (n+2)q\log^2 q. \tag{1} $$
Question 1: Find a counterexample to inequality $(1)$. (You will likely need to write a program and run it long enough. No counterexamples exist for $r<q\le2000$ and $n\le14$.)
For comparison, here is a tighter conjectural bound (also for almost all record gaps): $$ R(n,q,r) < \varphi(q) n^2 + (n+2)\varphi(q)\log^2 q. \tag{2} $$ Here $\varphi(q)$ is Euler's totient function.
A few counterexamples to $(2)$ are known; e.g. for $q=20$, $r=17$.
Question 2: Find more counterexamples to inequality $(2)$.