# frama-c -wp [...] [kernel] Parsing axioms.i (no preprocessing) [wp] Running WP plugin... [wp] Warning: Missing RTE guards ------------------------------------------------------------ Function f ------------------------------------------------------------ Goal Post-condition 'P,todo' in 'f': Let a_1 = shift_sint32(t, a). Let x = -a. Let a_2 = havoc(Mint_undef_0, Mint_0, a_1, i - a). Let x_1 = 1 + b. Assume { Type: is_sint32(a) /\ is_sint32(b) /\ is_sint32(i). (* Heap *) Type: (region(t.base) <= 0) /\ linked(Malloc_0). (* Pre-condition *) Have: valid_rw(Malloc_0, a_1, 1 + b - a). (* Pre-condition *) Have: a <= b. (* Invariant 'Index' *) Have: a <= x_1. (* Invariant 'Index' *) Have: (a <= i) /\ (i <= x_1). (* Invariant 'Positive' *) Have: forall i_1 : Z. ((a <= i_1) -> ((i_1 < i) -> (0 < a_2[shift_sint32(t, i_1)]))). (* Else *) Have: b < i. } Prove: P_P(a_2, t, a, b). ------------------------------------------------------------ Goal Post-condition 'Q' in 'f': Let a_1 = shift_sint32(t, a). Let x = -a. Let a_2 = havoc(Mint_undef_0, Mint_0, a_1, i - a). Let x_1 = 1 + b. Assume { Type: is_sint32(a) /\ is_sint32(b) /\ is_sint32(i). (* Heap *) Type: (region(t.base) <= 0) /\ linked(Malloc_0). (* Pre-condition *) Have: valid_rw(Malloc_0, a_1, 1 + b - a). (* Pre-condition *) Have: a <= b. (* Invariant 'Index' *) Have: a <= x_1. (* Invariant 'Index' *) Have: (a <= i) /\ (i <= x_1). (* Invariant 'Positive' *) Have: forall i_1 : Z. ((a <= i_1) -> ((i_1 < i) -> (0 < a_2[shift_sint32(t, i_1)]))). (* Else *) Have: b < i. } Prove: P_Q(Malloc_0, a_2, t, a, b). ------------------------------------------------------------ Goal Preservation of Invariant 'Index' (file axioms.i, line 30): Let a_1 = shift_sint32(t, a). Let x = -a. Let x_1 = 1 + b. Let x_2 = 1 + i. Assume { Type: is_sint32(a) /\ is_sint32(b) /\ is_sint32(i) /\ is_sint32(x_2). (* Heap *) Type: (region(t.base) <= 0) /\ linked(Malloc_0). (* Pre-condition *) Have: valid_rw(Malloc_0, a_1, 1 + b - a). (* Pre-condition *) Have: a <= b. (* Invariant 'Index' *) Have: a <= x_1. (* Invariant 'Index' *) Have: (a <= i) /\ (i <= x_1). (* Invariant 'Positive' *) Have: forall i_1 : Z. ((a <= i_1) -> ((i_1 < i) -> (0 < havoc(Mint_undef_0, Mint_0, a_1, i - a)[shift_sint32(t, i_1)]))). (* Then *) Have: i <= b. } Prove: a <= x_2. ------------------------------------------------------------ Goal Establishment of Invariant 'Index' (file axioms.i, line 30): Assume { Type: is_sint32(a) /\ is_sint32(b). (* Heap *) Type: (region(t.base) <= 0) /\ linked(Malloc_0). (* Pre-condition *) Have: valid_rw(Malloc_0, shift_sint32(t, a), 1 + b - a). (* Pre-condition *) Have: a <= b. } Prove: a <= (1 + b). ------------------------------------------------------------ Goal Preservation of Invariant 'Positive' (file axioms.i, line 31): Let x = 1 + i. Let a_1 = shift_sint32(t, a). Let x_1 = -a. Let a_2 = havoc(Mint_undef_0, Mint_0, a_1, i - a). Let x_2 = 1 + b. Assume { Type: is_sint32(a) /\ is_sint32(b) /\ is_sint32(i) /\ is_sint32(x). (* Heap *) Type: (region(t.base) <= 0) /\ linked(Malloc_0). (* Goal *) When: (a <= i_1) /\ (i_1 <= i). (* Pre-condition *) Have: valid_rw(Malloc_0, a_1, 1 + b - a). (* Pre-condition *) Have: a <= b. (* Invariant 'Index' *) Have: a <= x_2. (* Invariant 'Index' *) Have: (a <= i) /\ (i <= x_2). (* Invariant 'Positive' *) Have: forall i_2 : Z. ((a <= i_2) -> ((i_2 < i) -> (0 < a_2[shift_sint32(t, i_2)]))). (* Then *) Have: i <= b. (* Invariant 'Index' *) Have: a <= x. } Prove: 0 < a_2[shift_sint32(t, i) <- 1][shift_sint32(t, i_1)]. ------------------------------------------------------------ Goal Establishment of Invariant 'Positive' (file axioms.i, line 31): Prove: true. ------------------------------------------------------------ Goal Loop assigns (file axioms.i, line 32) (1/3): Prove: true. ------------------------------------------------------------ Goal Loop assigns (file axioms.i, line 32) (2/3): Effect at line 34 Prove: true. ------------------------------------------------------------ Goal Loop assigns (file axioms.i, line 32) (3/3): Effect at line 34 Let a_1 = shift_sint32(t, a). Let x = -a. Let a_2 = havoc(Mint_undef_0, Mint_0, a_1, i - a). Let a_3 = shift_sint32(t, i). Let x_1 = 1 + i. Let x_2 = 1 + b. Assume { Type: is_sint32(a) /\ is_sint32(b) /\ is_sint32(i) /\ is_sint32(x_1). (* Heap *) Type: (region(t.base) <= 0) /\ linked(Malloc_0). (* Goal *) When: !invalid(Malloc_0, a_3, 1). (* Pre-condition *) Have: valid_rw(Malloc_0, a_1, 1 + b - a). (* Pre-condition *) Have: a <= b. (* Invariant 'Index' *) Have: a <= x_2. (* Invariant 'Index' *) Have: (a <= i) /\ (i <= x_2). (* Invariant 'Positive' *) Have: forall i_1 : Z. ((a <= i_1) -> ((i_1 < i) -> (0 < a_2[shift_sint32(t, i_1)]))). (* Then *) Have: i <= b. (* Invariant 'Index' *) Have: a <= x_1. (* Invariant 'Positive' *) Have: forall i_1 : Z. ((i_1 <= i) -> ((a <= i_1) -> (0 < a_2[a_3 <- 1][shift_sint32(t, i_1)]))). } Prove: included(a_3, 1, a_1, 1 + i - a). ------------------------------------------------------------ Goal Assigns 'todo' in 'f': Effect at line 34 Let x = 1 + b. Let a_1 = shift_sint32(t, a). Let x_1 = -a. Assume { Have: a < i. Have: !invalid(Malloc_0, a_1, i - a). Type: is_sint32(a) /\ is_sint32(b) /\ is_sint32(i). (* Heap *) Type: (region(t.base) <= 0) /\ linked(Malloc_0). (* Pre-condition *) Have: valid_rw(Malloc_0, a_1, 1 + b - a). (* Pre-condition *) Have: a <= b. (* Invariant 'Index' *) Have: a <= x. } Prove: i <= x. ------------------------------------------------------------