Goal:
  
  G : t
  HI : invariants G
  HG : acyclic_no_loop G
  n : Z
  x : V.t
  y : VSet.elt
  Vy : VSet.In y (V G)
  ly : Z
  lx : Z
  K : Z
  G' := G' (s G) x K : t
  Vx : VSet.In x (V G)
  Hly : lsp G (s G) y = Some ly
  Hpos : 0 <= ly
  Hlab : Z.of_nat (to_label (lsp G (s G) y)) = ly
  Hlx : lsp G (s G) x = Some lx
  poskx : 0 <= lx
  Hlab' : Z.of_nat (to_label (lsp G (s G) x)) = lx
  xs : lsp G x (s G) = None
  HI' : invariants G'
  HG' : acyclic_no_loop G'
  kx' : Z
  Hkx' : lsp G' (s G) x = Some kx'
  kx'pos : 0 <= kx'
  zofx' : Z.of_nat (to_label (lsp G' (s G) x)) = kx'
  XX : K <= kx'
  ky' : Z
  Hky' : lsp G' (s G) y = Some ky'
  ky'pos : 0 <= ky'
  zofy' : Z.of_nat (to_label (lsp G' (s G) y)) = ky'
  Hle : kx' + n <= ky'
  heq_K : K =
          (if n <=? 0 then Z.max lx (Z.succ ly - n) else Z.max lx (Z.succ ly))
  cstr : 0 <= Z.of_nat (to_label (lsp G' (s G) y))
  cstr0 : 0 <= Z.of_nat (to_label (lsp G (s G) x))
  cstr1 : 0 <= Z.of_nat (to_label (lsp G (s G) y))
  cstr2 : 0 <= Z.of_nat (to_label (lsp G' (s G) x))
  ============================
   (K + n <= ky')


DEBUG:Going to execute:
Zify.zify_convert_to_euclidean_division_equations_flag