About critical section problem

See more:

general

I have a question about concurrency processing in operating systems concepts,
Suppose we have two process A,B that running concurrently in a computer.
We have the following algorithm. (This is for A , for B replace a to b)

retry:
flag[a] = false;
if (flag[b] != false ) goto retry;
flag[a] = true;
if (flag[b] != false ) goto retry;
// critical section
flag[a] = false;

As we know each ideal algorithm for critical section accessing must have three constraints : 1.mutual exclusion , 2.progress , 3.bounded waiting
My question is: For this algorithm which constrains are met ?
I believe that the Progress condition did not met by this algorithm. Because at a worse case both of these processes return to 'retry' label at second 'if' and no one can enter the critical section.

Best regards...