public void visitNewMultiArrayExpr(final NewMultiArrayExpr expr) {
		// Think of the tree like
		// (NewMultiArrayExpr)
		// / \
		// count1 .
		// / \
		// count2 etc.
		// since multianewarray manipulates the stack like
		// count1, [count1 ...] => ...

		final Expr[] dims = expr.dimensions();
		if (dims.length > 0) {
			dims[0].visit(this);
		}
		if (!found && (exchangeFactor < 2) && (dims.length > 1)) {
			exchangeFactor++; // (count1 won't be wide)
			dims[1].visit(this);
		}
	}