Proof using.
unfold reachable.
intros. eauto.
Qed.

(* Specifications: *)
Lemma locks_correct_locked_invariant :
forall st p,
reachable step_async step_async_init st ->
In p (nwPackets st) ->
locks_correct_locked (nwState st) p.
Lemma locks_correct_locked_invariant :
forall st p,
reachable step_async step_async_init st ->
In p (nwPackets st) ->
locks_correct_locked (nwState st) p.