int a, f;
char b, g, h;
extern _Bool c[], e[];
extern int d[];
short i, j;
long k, l;
_Bool e[3];
void m() {
for (short n = 0; n < 13; n++) {
for (_Bool o = 0; o < (_Bool)l; o = 1)
for (int p = j % h - 6; p; p += 4)
a = c[2 + n * n];
if ((_Bool)(f ? i > g : g)) {
d[n] = 0;
b = f ?: k;
}
e[n] = 0;
}
for (int q = 3; q; q++)
;
for (int r = 3; r; r++)
;
for (;;)
;
}
Testcase:
Godbolt: https://godbolt.org/z/1T7EWTGEY
Reduced LLVM IR:
Godbolt: https://godbolt.org/z/1Wah8h1W3
Backtrace:
Found via fuzzer.