diff --git a/libmudflap/testsuite/libmudflap.c/fail33-frag.c b/libmudflap/testsuite/libmudflap.c/fail33-frag.c
index 5f33be7a852093347b132f98cfb0fc532cf2e5ca..ac7c617a4ebb72bf828da10ecb4d291e76a43594 100644
--- a/libmudflap/testsuite/libmudflap.c/fail33-frag.c
+++ b/libmudflap/testsuite/libmudflap.c/fail33-frag.c
@@ -7,14 +7,14 @@ char a[SIZE];
 
 int main ()
 {
-  int i, j=0;
+  int i, j=0, k;
   int a_before_b = (& a[0] < & b[0]);
   /* Rather than iterating linearly, which would allow loop unrolling
      and mapping to pointer manipulation, we traverse the "joined"
      arrays in some random order.  */
   for (i=0; i<SIZE*2; i++)
     {
-      k=rand()%(SIZE*2))
+      k = rand() % (SIZE*2);
       j += (a_before_b ? a[k] : b[k]);
     }
   return j;