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

Given the code below, this method call:

Troac.esmla();

...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 Troac {
    private int cren;
    private Troac ra;
    private Psam an;
    private Psam lol;
    private Psam cacs;

    Troac(int cren) {
        this.cren = cren;
    }

    public void setRa(Troac ra) {
        this.ra = ra;
    }

    public void setAn(Psam an) {
        this.an = an;
    }

    public void setLol(Psam lol) {
        this.lol = lol;
    }

    public void setCacs(Psam cacs) {
        this.cacs = cacs;
    }

    public static void esmla() {
        Troac ol = new Troac(764);
        new Psam(685).hismce(ol, 5);
    }

    public static void cocPeved(int io, Psam ho) {
        int pou = 1;
        int pra = 91;
        int jo = 15;
        Psam.cetScid(pou, io);
        HERE;
        Troac.hinme(ho, io, pra);
    }

    public static void hinme(Psam ac, int elpi, int us) {
        int scol = 36;
        int pog = 4;
    }
}

public class Psam {
    private int eiash;

    Psam(int eiash) {
        this.eiash = eiash;
    }

    public void hismce(Troac co, int irm) {
        Psam oe = new Psam(459);
        co.setLol(this);
        new Psam(644).thui();
        Psam.rhec(19);
    }

    public static void cetScid(int ge, int pi) {
        int he = 77;
        int efa = 81;
        int nel = 66;
    }

    public void ciosco(Psam ki) {
        int dafo = 61;
        Troac.cocPeved(dafo, ki);
    }

    public static void rhec(int al) {
    }

    public void thui() {
        Psam onbe = new Psam(340);
        Psam oss = new Psam(802);
        int a = 96;
        int edi = 25;
        oss.ciosco(this);
        this.bunson(onbe, oss);
    }

    public void bunson(Psam enom, Psam na) {
    }
}

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: