Stack frames and objects (like the Idea Lab activity): Correct Solution

Given the code below, this method call:

Omip.irru();

...will eventually reach the point marked HERE. Draw a diagram of the stack and the heap at that point.

(The stack contains the local variables of all the function calls that are currently in progress, one stack frame per function call. The heap contains all of the objects that currently exist.)

In your diagram:

Label each stack frame with the name of the method.
Label each object with the name of its class.
Include the names of all the variables that belong to each object and stack frame, including the implicit this parameter if present. (You do not need to write the types of any variables.)
When a variable's value is null or a primitive, write the value immediately next to the variable.
When a variable points to an object, draw an arrow from the variable to the object it points to.

The code:

public class Omip {
    private int daSoonk;
    private Alm cror;
    private Alm ei;

    Omip(int daSoonk) {
        this.daSoonk = daSoonk;
    }

    public void setCror(Alm cror) {
        this.cror = cror;
    }

    public void setEi(Alm ei) {
        this.ei = ei;
    }

    public void nasm(int adac) {
        int aod = 99;
        int sqa = 43;
        int po = 75;
    }

    public void donloa(Omip plis) {
        int es = 5;
        new Alm(708).groc(es, new Omip(959), plis);
        new Omip(101).aunNoc(plis);
        Alm.pered(this);
    }

    public static void irru() {
        Alm sio = new Alm(142);
        Omip frep = new Omip(65);
        int woc = 8;
        Alm om = new Alm(843);
        om.setEcre(sio);
        new Omip(310).donloa(frep);
    }

    public static void litep(int sa) {
        Omip.mism(sa, sa, sa);
        HERE;
    }

    public void nacZoust() {
        int fea = 24;
        int he = 84;
        int sni = 16;
        this.nasm(he);
        Omip.litep(he);
    }

    public static void mism(int nibi, int crir, int si) {
        int pao = 83;
    }

    public void aunNoc(Omip hil) {
        Alm ril = new Alm(504);
        ril.setPe(hil);
        hil.nacZoust();
    }
}

public class Alm {
    private int meol;
    private Omip pe;
    private Alm ecre;

    Alm(int meol) {
        this.meol = meol;
    }

    public void setPe(Omip pe) {
        this.pe = pe;
    }

    public void setEcre(Alm ecre) {
        this.ecre = ecre;
    }

    public static void pered(Omip u) {
        int os = 93;
        int shar = 99;
        int fo = 33;
        int igec = 62;
    }

    public void groc(int pi, Omip riou, Omip nent) {
        int qawi = 23;
    }
}

Solution

Hints for practicing this puzzle:

Practice with difficulty 0, then work your way up. This will help you get a handle on what the puzzle is asking.
There is only one path through the code from the starting method call to HERE. Start by finding that path.
Be thorough. Double check that you've fully diagrammed each step before you move on to the next one.
You can feed this code into https://pythontutor.com and watch a diagram like this build up step by step. (Yes, despite the web site's name, it also works with Java.)

Related puzzles: