Goal:
  
  G : t
  invG : invariants G
  acG : acyclic_no_loop G
  x : V.t
  y : V.t
  hx : VSet.In x (V G)
  hy : VSet.In y (V G)
  nxy : Z
  hxy : (lsp G x y <= Some nxy)%nbar
  nx : Z
  eqlspx : lsp G (s G) x = Some nx
  nxpos : 0 <= nx
  eqnx : Z.of_nat (to_label (lsp G (s G) x)) = nx
  ny : Z
  eqlspy : lsp G (s G) y = Some ny
  nypos : 0 <= ny
  eqny : Z.of_nat (to_label (lsp G (s G) y)) = ny
  a : Z
  H : protect_term (lsp G x (s G) = Some a)
  H0 : (Some a + lsp G (s G) y <= lsp G x y)%nbar
  H1 : (lsp G (s G) x + Some a <= lsp G (s G) (s G))%nbar
  ============================
   (Some a + Some (Z.of_nat (Z.to_nat (ny - nx - nxy))) + Some nx <= Some 0)%nbar


DEBUG:Going to execute:
apply : eq_sym ; trivial
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.