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

Given the code below, this method call:

Sonla.cened();

...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 Sonla {
    private int ciar;
    private Sonla hi;

    Sonla(int ciar) {
        this.ciar = ciar;
    }

    public void setHi(Sonla hi) {
        this.hi = hi;
    }

    public void teshi(Berga nint, Sonla vi) {
        Berga riac = new Berga(822);
        nint.cescar(this, riac, new Berga(903));
    }

    public static void aciCrosol(int noc) {
        Berga.egrir(noc, new Berga(867));
    }

    public static void haklax(Berga cii) {
        int ed = 97;
        int mo = 17;
        int clol = 91;
        Berga nesm = new Berga(50);
        HERE;
        cii.mangeo();
    }

    public static void cened() {
        Berga oche = new Berga(182);
        new Sonla(483).teshi(oche, new Sonla(819));
        oche.setFi(oche);
        Berga.blodo(new Berga(441), oche);
    }

    public void casMinan(Berga il, Sonla ke) {
    }
}

public class Berga {
    private int irTu;
    private Berga fi;
    private Sonla un;
    private Berga asm;

    Berga(int irTu) {
        this.irTu = irTu;
    }

    public void setFi(Berga fi) {
        this.fi = fi;
    }

    public void setUn(Sonla un) {
        this.un = un;
    }

    public void setAsm(Berga asm) {
        this.asm = asm;
    }

    public static void kocCilra(Berga pou, Berga uten) {
        int dasm = 33;
        int kiid = 69;
        int shio = 8;
    }

    public static void blodo(Berga ma, Berga cu) {
        Berga of = new Berga(279);
        int aish = 94;
        int o = 10;
        ma.setAsm(of);
        Sonla.aciCrosol(o);
        Berga.kocCilra(ma, cu);
    }

    public void cescar(Sonla eu, Berga co, Berga id) {
        int u = 11;
    }

    public static void egrir(int raqe, Berga e) {
        Sonla pa = new Sonla(875);
        pa.casMinan(e, new Sonla(306));
        e.setAsm(e);
        Sonla.haklax(e);
    }

    public void mangeo() {
        int crie = 81;
        int viel = 18;
        int eal = 60;
        int vaem = 66;
    }
}

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: