Output a googol copies of a string I am interested in seeing programs which don't ask for any input, print a googol copies of some nonempty string, no less, no more, and then stop. A googol is defined as \$10^{100}\$, i.e., 1 followed by a hundred 0's in decimal.
Example output:
111111111111111111111111111111111111111111111111111111111111111111111111...

or
Hello world
Hello world
Hello world
Hello world
Hello world
Hello world
...

The string can also be entirely composed of white space or special symbols. The only exception to identical copies of a fixed string is if your language decorates the output in some way that can not be prevented, but could be trivially undone in a wrapper script, like prepending a line number to each line. The wrapper script in such cases need not be provided.
You can assume your computer will never run out of time, but other than that, your program must have a reasonable demand of resources. Also, you must respect any restrictions that the programming language of your choice poses, for example, you can not exceed a maximum value allowed for its integer types, and at no point more than 4 GB of memory must be needed.
In other words, the program should in principle be testable by running it on your computer. But because of the extent of this number you will be expected to prove that the number of copies of the string it outputs is exactly 10^100 and that the program stops afterwards. Stopping can be exiting or halting or even terminating due to an error, but if so, the error must not produce any output that could not easily be separated from the program's output.
This is code-golf,  so the solution with the fewest bytes wins.
Example solution (C, ungolfed, 3768 bytes)
#include &lt;stdio.h&gt;

int main() {
  int a00, a01, a02, a03, ..., a99;
  for(a00 = 0; a00 &lt; 10; a00++)
  for(a01 = 0; a01 &lt; 10; a01++)
  for(a02 = 0; a02 &lt; 10; a02++)
  for(a03 = 0; a03 &lt; 10; a03++)
  ...
  for(a99 = 0; a99 &lt; 10; a99++)
    puts(&quot;1&quot;);
  return 0;
}
Fuzzy Octo Guacamole, 13 12 11 10 bytes
9+ddpp![g] 

Explanation:
9+ddpp![g]
9+           # push 9 and increment, giving 10
  dd         # duplicate, twice. now you have [10,10,10]
    pp       # raise a 10 to the 10th power, then raise that to the 10th again. That ends up being 10^100.
      ![ ]   # for loop, `!` sets the counter to the top of stack
        g    # prints an ASCII art goat. 

Sample of the goat printed:
                  ___.
                 //  \\
                ((   &quot;&quot;
                 \\__,
                /6 (%)\,
               (__/:&quot;;,;\--____----_
                ;; :&quot;;,:&quot;;`;,&quot;;,;&quot;;`,`_
                  ;:,;;&quot;;&quot;;,;&quot;:,&quot;;&quot;;,-Y\
                   ;,;,;&quot;;&quot;;,;&quot;:;&quot;;&quot;; Z/
                   / ;,&quot;;&quot;;,;&quot;;,;&quot;;;&quot;
                  / / |&quot;;/~~~~~\&quot;;;&quot;
                 ( K  | |      || |
                  \_\ | |      || |
                   \Z | |      || |
                      L_|      LL_|
                      LW/      LLW/