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

Given the code below, this method call:

Stisk.stiar();

...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 Stisk {
    private int mamos;
    private Moiad qar;
    private Moiad la;

    Stisk(int mamos) {
        this.mamos = mamos;
    }

    public void setQar(Moiad qar) {
        this.qar = qar;
    }

    public void setLa(Moiad la) {
        this.la = la;
    }

    public static void telme(int noro, Moiad riw) {
    }

    public static void tard(Stisk mece, Moiad to, Moiad eii) {
        to.mabest(mece, new Moiad(720));
        eii.setPsa(mece);
        eii.ruent(to, new Moiad(877));
    }

    public static void stiar() {
        Stisk.tard(new Stisk(87), new Moiad(244), new Moiad(252));
    }

    public static void nicig(Moiad virn) {
        Moiad na = new Moiad(883);
        HERE;
        na.atac(na, virn);
    }
}

public class Moiad {
    private int spi;
    private Stisk iss;
    private Stisk psa;

    Moiad(int spi) {
        this.spi = spi;
    }

    public void setIss(Stisk iss) {
        this.iss = iss;
    }

    public void setPsa(Stisk psa) {
        this.psa = psa;
    }

    public static void nerSpinen(Moiad ad, Moiad sust) {
        int voel = 90;
        new Moiad(863).ondi();
        Stisk.nicig(new Moiad(500));
        Stisk.telme(voel, ad);
    }

    public void ondi() {
        int ji = 69;
    }

    public void mabest(Stisk thal, Moiad hii) {
    }

    public void ruent(Moiad mion, Moiad bi) {
        Moiad.nerSpinen(bi, this);
    }

    public void atac(Moiad re, Moiad pto) {
    }
}

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: