Proof using.
unfold advanceCurrentTerm. intros.
break_if; auto.
Qed.

(* Specifications: *)
Theorem handleTimeout_clientCache :
forall h st out st' ps,
handleTimeout h st = (out, st', ps) ->
clientCache st' = clientCache st.
Theorem handleTimeout_stateMachine :
forall h st out st' ps,
handleTimeout h st = (out, st', ps) ->
stateMachine st' = stateMachine st.
Lemma tryToBecomeLeader_same_log :
forall n st out st' ms,
tryToBecomeLeader n st = (out, st', ms) ->
log st' = log st.
Theorem handleTimeout_lastApplied :
forall h st out st' ps,
handleTimeout h st = (out, st', ps) ->
lastApplied st' = lastApplied st.