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

Given the code below, this method call:

Espla.mija();

...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 Espla {
    private int thol;
    private Iae ciss;
    private Espla vabo;

    Espla(int thol) {
        this.thol = thol;
    }

    public void setCiss(Iae ciss) {
        this.ciss = ciss;
    }

    public void setVabo(Espla vabo) {
        this.vabo = vabo;
    }

    public static void mija() {
        int acro = 80;
        int eght = 55;
        new Espla(706).benoi(acro, new Espla(191));
        new Iae(631).cucke(acro, new Iae(440), eght);
        Espla.priRociss(eght, acro);
    }

    public void crerl() {
        Iae pla = new Iae(809);
        int deol = 20;
        pla.casSnang();
        pla.setHoud(this);
        pla.epuHemost(this, pla);
    }

    public void benoi(int gru, Espla hac) {
        int ed = 29;
        int oh = 17;
        new Iae(456).pruo(hac);
    }

    public static void priRociss(int qai, int iqe) {
        Espla.nilrir(qai);
    }

    public static void nilrir(int pou) {
        int iral = 63;
        int plun = 10;
    }
}

public class Iae {
    private int seu;
    private Iae riur;
    private Espla houd;

    Iae(int seu) {
        this.seu = seu;
    }

    public void setRiur(Iae riur) {
        this.riur = riur;
    }

    public void setHoud(Espla houd) {
        this.houd = houd;
    }

    public void ceuPhangi(int urm) {
        Espla oc = new Espla(633);
        Iae bu = new Iae(120);
    }

    public void pruo(Espla caer) {
        Espla fidu = new Espla(433);
        Espla mic = new Espla(876);
        Iae dida = new Iae(646);
    }

    public void epuHemost(Espla ooon, Iae niud) {
        int nir = 18;
        HERE;
    }

    public static void esmear(int ep, int goe) {
        int psa = 58;
        Iae whur = new Iae(201);
        Espla sqe = new Espla(931);
        sqe.setCiss(whur);
        new Espla(242).crerl();
    }

    public void cucke(int te, Iae cuc, int bri) {
        cuc.ceuPhangi(40);
        cuc.setRiur(this);
        Iae.esmear(bri, te);
    }

    public void casSnang() {
        int buco = 3;
        int su = 40;
        int sco = 34;
    }
}

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: