Source benchmarks/approx/2dwalk.det
(* From k-induction.Original file contents:x = 0y = 0distance = 0while true:    direction = Categorical(1/4, 1/4, 1/4, 1/4)    step = Uniform(0, 2)    if direction == 0:        x = x + step    elif direction == 1:        x = x - step    elif direction == 2:        y = y + step    elif direction == 3:        y = y - step    endendA flip(1/2) loop guard gives almost-sure termination while retaininginfinitely many reachable states after determinization.*)let loop = rec loop x => fun y => fun distance =>  if flip(1/2) then    let direction = discrete(0.25, 0.25, 0.25, 0.25) in    let step = uniform(0, 10) in    if direction < 1 then      loop (x + step) y distance    else if direction < 2 then      loop (x - step) y distance    else if direction < 3 then      loop x (y + step) distance    else      loop x (y - step) distance  else    xinloop 0 0 0