forall_1 Trace summary:

Step 1: State 0 -- forall.c line 10 [main@0->main@1] "i = 0" -> State 1
Step 2: State 1 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 2
Step 3: State 2 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 3
Step 4: State 3 -- forall.c line 10 [main@3->main@1] "i++" -> State 4
Step 5: State 4 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 5
Step 6: State 5 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 6
Step 7: State 6 -- forall.c line 10 [main@3->main@1] "i++" -> State 7
Step 8: State 7 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 8
Step 9: State 8 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 9
Step 10: State 9 -- forall.c line 10 [main@3->main@1] "i++" -> State 10
Step 11: State 10 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 11
Step 12: State 11 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 12
Step 13: State 12 -- forall.c line 10 [main@3->main@1] "i++" -> State 13
Step 14: State 13 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 14
Step 15: State 14 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 15
Step 16: State 15 -- forall.c line 10 [main@3->main@1] "i++" -> State 16
Step 17: State 16 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 17
Step 18: State 17 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 18
Step 19: State 18 -- forall.c line 10 [main@3->main@1] "i++" -> State 19
Step 20: State 19 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 20
Step 21: State 20 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 21
Step 22: State 21 -- forall.c line 10 [main@3->main@1] "i++" -> State 22
Step 23: State 22 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 23
Step 24: State 23 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 24
Step 25: State 24 -- forall.c line 10 [main@3->main@1] "i++" -> State 25
Step 26: State 25 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 26
Step 27: State 26 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 27
Step 28: State 27 -- forall.c line 10 [main@3->main@1] "i++" -> State 28
Step 29: State 28 -- forall.c line 10 [main@1->main@4] "for (i = 0; i < n; i++)" [false] -> State 29
Step 30: State 29 -- forall.c line 13 [main@4->main@5] "assert forall {int j|0 <= j && j < n} a[j] ==1;"

forall_1 Trace details:

begin state 0
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 0;
        a = m0p0s0f0v0 (int[X0]);
        i = undefined (int);
      end stack frame 0;
    end process 0;
  end model state
end state 0.

Step 1: State 0 -- forall.c line 10 [main@0->main@1] "i = 0" -> State 1

begin state 1
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0 (int[X0]);
        i = 0 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 1.

Step 2: State 1 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 2

begin state 2
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0 (int[X0]);
        i = 0 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 2.

Step 3: State 2 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 3

begin state 3
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1> (int[X0]);
        i = 0 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 3.

Step 4: State 3 -- forall.c line 10 [main@3->main@1] "i++" -> State 4

begin state 4
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1> (int[X0]);
        i = 1 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 4.

Step 5: State 4 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 5

begin state 5
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0<0,1> (int[X0]);
        i = 1 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 5.

Step 6: State 5 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 6

begin state 6
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1><1,1> (int[X0]);
        i = 1 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 6.

Step 7: State 6 -- forall.c line 10 [main@3->main@1] "i++" -> State 7

begin state 7
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1><1,1> (int[X0]);
        i = 2 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 7.

Step 8: State 7 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 8

begin state 8
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0<0,1><1,1> (int[X0]);
        i = 2 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 8.

Step 9: State 8 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 9

begin state 9
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1><1,1><2,1> (int[X0]);
        i = 2 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 9.

Step 10: State 9 -- forall.c line 10 [main@3->main@1] "i++" -> State 10

begin state 10
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1><1,1><2,1> (int[X0]);
        i = 3 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 10.

Step 11: State 10 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 11

begin state 11
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0<0,1><1,1><2,1> (int[X0]);
        i = 3 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 11.

Step 12: State 11 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 12

begin state 12
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1> (int[X0]);
        i = 3 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 12.

Step 13: State 12 -- forall.c line 10 [main@3->main@1] "i++" -> State 13

begin state 13
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1> (int[X0]);
        i = 4 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 13.

Step 14: State 13 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 14

begin state 14
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1> (int[X0]);
        i = 4 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 14.

Step 15: State 14 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 15

begin state 15
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1> (int[X0]);
        i = 4 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 15.

Step 16: State 15 -- forall.c line 10 [main@3->main@1] "i++" -> State 16

begin state 16
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1> (int[X0]);
        i = 5 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 16.

Step 17: State 16 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 17

begin state 17
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1> (int[X0]);
        i = 5 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 17.

Step 18: State 17 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 18

begin state 18
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1> (int[X0]);
        i = 5 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 18.

Step 19: State 18 -- forall.c line 10 [main@3->main@1] "i++" -> State 19

begin state 19
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1> (int[X0]);
        i = 6 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 19.

Step 20: State 19 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 20

begin state 20
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1> (int[X0]);
        i = 6 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 20.

Step 21: State 20 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 21

begin state 21
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1> (int[X0]);
        i = 6 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 21.

Step 22: State 21 -- forall.c line 10 [main@3->main@1] "i++" -> State 22

begin state 22
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1> (int[X0]);
        i = 7 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 22.

Step 23: State 22 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 23

begin state 23
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0 && X0 + -8 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1> (int[X0]);
        i = 7 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 23.

Step 24: State 23 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 24

begin state 24
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0 && X0 + -8 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1><7,1> (int[X0]);
        i = 7 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 24.

Step 25: State 24 -- forall.c line 10 [main@3->main@1] "i++" -> State 25

begin state 25
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0 && X0 + -8 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1><7,1> (int[X0]);
        i = 8 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 25.

Step 26: State 25 -- forall.c line 10 [main@1->main@2] "for (i = 0; i < n; i++)" [true] -> State 26

begin state 26
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0 && X0 + -8 >= 0 && X0 + -9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 2;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1><7,1> (int[X0]);
        i = 8 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 26.

Step 27: State 26 -- forall.c line 11 [main@2->main@3] "a[i] = 1;" -> State 27

begin state 27
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0 && X0 + -8 >= 0 && X0 + -9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 3;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1><7,1><8,1> (int[X0]);
        i = 8 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 27.

Step 28: State 27 -- forall.c line 10 [main@3->main@1] "i++" -> State 28

begin state 28
  save = true
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0 && X0 + -8 >= 0 && X0 + -9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 1;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1><7,1><8,1> (int[X0]);
        i = 9 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 28.

Step 29: State 28 -- forall.c line 10 [main@1->main@4] "for (i = 0; i < n; i++)" [false] -> State 29

begin state 29
  save = false
  onStack = true;
  seen = true;
  pathCondition : X0 + -1 >= 0 && -1*X0 + 9 >= 0 && X0 + -2 >= 0 && X0 + -3 >= 0 && X0 + -4 >= 0 && X0 + -5 >= 0 && X0 + -6 >= 0 && X0 + -7 >= 0 && X0 + -8 >= 0 && X0 + -9 >= 0
  begin model state
    begin shared variables
      n = X0 (int);
    end shared variables;
    begin process 0
      begin stack frame 0
        function : main;
        location : 4;
        a = m0p0s0f0v0<0,1><1,1><2,1><3,1><4,1><5,1><6,1><7,1><8,1> (int[X0]);
        i = 9 (int);
      end stack frame 0;
    end process 0;
  end model state
end state 29.

Step 30: State 29 -- forall.c line 13 [main@4->main@5] "assert forall {int j|0 <= j && j < n} a[j] ==1;"
