public void visit_iflt(final Instruction inst) {
		// It isn't necessary to saveStack since removing critical edges
		// guarantees that no code will be inserted before the branch
		// since there cannot be more than one predecessor of either of
		// the successor nodes (and hence no phi statements, even in SSAPRE).
		// saveStack();

		final Expr left = stack.pop(Type.INTEGER);
		final Block t = (Block) block.graph().getNode(inst.operand());
		Assert.isTrue(t != null, "No block for " + inst);

		addStmt(new IfZeroStmt(IfStmt.LT, left, t, next));
	}