#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ exit(int);
int /*<<< orphan*/ fprintf(int /*<<< orphan*/, char *);
int /*<<< orphan*/ stderr;
int tr_build_usage() {
  fprintf(stderr, "\n");
  fprintf(stderr, "Usage  : treebest nj [options] <input_file>\n");
  fprintf(stderr, "\n");
  fprintf(stderr,
          "Options: -c FILE    constrained tree(s) in NH format [null]\n");
  fprintf(stderr, "         -m FILE    tree to be compared [null]\n");
  fprintf(
      stderr,
      "         -s FILE    species tree in NH format [default taxa tree]\n");
  fprintf(stderr, "         -l FILE    ingroup list file [null]\n");
  fprintf(stderr, "         -t TYPE    codon NT: ntmm, dn, ds, dm; AA: mm, "
                  "jtt, kimura [mm]\n");
  fprintf(stderr, "                    ntmm    p-distance (codon alignment)\n");
  fprintf(stderr, "                    dn      non-synonymous distance\n");
  fprintf(stderr, "                    ds      synonymous distance\n");
  fprintf(stderr, "                    dm      dn-ds merge (tree merge)\n");
  fprintf(stderr,
          "                    mm      p-distance (amino acid alignment)\n");
  fprintf(stderr,
          "                    jtt     JTT model (maximum likelihood)\n");
  fprintf(stderr, "                    kimura  mm + Kimura's correction\n");
  fprintf(stderr, "         -T NUM     time limit in seconds [no limit]\n");
  fprintf(stderr, "         -b NUM     bootstrapping times [100]\n");
  fprintf(stderr, "         -F NUM     quality cut-off [15]\n");
  fprintf(stderr,
          "         -o STR     outgroup for tree cutting [Bilateria]\n");
  fprintf(stderr, "         -S         treat the first constrained tree as the "
                  "original tree\n");
  fprintf(
      stderr,
      "         -C         use the leaves of constrained trees as ingroup\n");
  fprintf(stderr, "         -M         do not apply alignment mask\n");
  fprintf(stderr, "         -N         do not mask poorly aligned segments\n");
  fprintf(stderr, "         -g         collapse alternative splicing\n");
  fprintf(stderr, "         -R         do not apply leaf-reordering\n");
  fprintf(stderr, "         -p         the root node is a putative node\n");
  fprintf(
      stderr,
      "         -a         branch mode that is used by most tree-builder\n");
  fprintf(stderr,
          "         -A         the input alignment is stored in ALN format\n");
  fprintf(
      stderr,
      "         -W         wipe out root (SDI information will be lost!)\n");
  fprintf(stderr, "         -I         copy the branch support tags from the "
                  "constrained tree\n");
  fprintf(stderr, "         -v         verbose output\n");
  fprintf(stderr, "         -h         help\n\n");
  exit(1);
}


x86 assembly (clang, -O0):
<tr_build_usage>:
push   %rbp
mov    %rsp,%rbp
mov    0x2eb5(%rip),%rax
mov    (%rax),%edi
lea    0x1556(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2ea0(%rip),%rax
mov    (%rax),%edi
lea    0xeb7(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e8b(%rip),%rax
mov    (%rax),%edi
lea    0x152c(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e76(%rip),%rax
mov    (%rax),%edi
lea    0xeba(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e61(%rip),%rax
mov    (%rax),%edi
lea    0xee2(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e4c(%rip),%rax
mov    (%rax),%edi
lea    0xefd(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e37(%rip),%rax
mov    (%rax),%edi
lea    0xf2b(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e22(%rip),%rax
mov    (%rax),%edi
lea    0xf44(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2e0d(%rip),%rax
mov    (%rax),%edi
lea    0xf79(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2df8(%rip),%rax
mov    (%rax),%edi
lea    0xf9e(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2de3(%rip),%rax
mov    (%rax),%edi
lea    0xfbe(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2dce(%rip),%rax
mov    (%rax),%edi
lea    0xfda(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2db9(%rip),%rax
mov    (%rax),%edi
lea    0xffb(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2da4(%rip),%rax
mov    (%rax),%edi
lea    0x1025(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2d8f(%rip),%rax
mov    (%rax),%edi
lea    0x104c(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2d7a(%rip),%rax
mov    (%rax),%edi
lea    0x106d(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2d65(%rip),%rax
mov    (%rax),%edi
lea    0x108e(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2d50(%rip),%rax
mov    (%rax),%edi
lea    0x10a8(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2d3b(%rip),%rax
mov    (%rax),%edi
lea    0x10bd(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2d26(%rip),%rax
mov    (%rax),%edi
lea    0x10e3(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2d11(%rip),%rax
mov    (%rax),%edi
lea    0x1119(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2cfc(%rip),%rax
mov    (%rax),%edi
lea    0x1148(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2ce7(%rip),%rax
mov    (%rax),%edi
lea    0x1164(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2cd2(%rip),%rax
mov    (%rax),%edi
lea    0x1188(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2cbd(%rip),%rax
mov    (%rax),%edi
lea    0x11a6(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2ca8(%rip),%rax
mov    (%rax),%edi
lea    0x11c3(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2c93(%rip),%rax
mov    (%rax),%edi
lea    0x11e4(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2c7e(%rip),%rax
mov    (%rax),%edi
lea    0x1212(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2c69(%rip),%rax
mov    (%rax),%edi
lea    0x123e(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2c54(%rip),%rax
mov    (%rax),%edi
lea    0x126c(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2c3f(%rip),%rax
mov    (%rax),%edi
lea    0x12a3(%rip),%rsi
call   1030 <fprintf@plt>
mov    0x2c2a(%rip),%rax
mov    (%rax),%edi
lea    0x12b2(%rip),%rsi
call   1030 <fprintf@plt>
mov    $0x1,%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<tr_build_usage>:
push   %r14
push   %rbx
push   %rax
mov    0x2eb5(%rip),%rbx
mov    (%rbx),%edi
lea    0x1556(%rip),%r14
mov    %r14,%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xebb(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
mov    %r14,%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xed0(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xeff(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf21(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf56(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xf76(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xfb2(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0xfde(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1005(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1028(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1050(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1081(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x10af(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x10d7(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x10ff(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1120(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x113c(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1169(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x11a6(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x11dc(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x11ff(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x122a(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x124f(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1273(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x129b(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x12d0(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1303(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1338(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x1376(%rip),%rsi
call   1030 <fprintf@plt>
mov    (%rbx),%edi
lea    0x138c(%rip),%rsi
call   1030 <fprintf@plt>
mov    $0x1,%edi
call   1040 <exit@plt>

LLVM IR (-O0):
@stderr = global i32 0
@.str = [2 x i8] c"\0A\00"
@.str.1 = [45 x i8] c"Usage : treebest nj [options] <input_file>\0A\00"
@.str.2 = [61 x i8] c"Options: -c FILE constrained tree(s) in NH format [null]\0A\00"
@.str.3 = [48 x i8] c" -m FILE tree to be compared [null]\0A\00"
@.str.4 = [67 x i8] c" -s FILE species tree in NH format [default taxa tree]\0A\00"
@.str.5 = [46 x i8] c" -l FILE ingroup list file [null]\0A\00"
@.str.6 = [74 x i8] c" -t TYPE codon NT: ntmm, dn, ds, dm; AA: mm, jtt, kimura [mm]\0A\00"
@.str.7 = [58 x i8] c" ntmm p-distance (codon alignment)\0A\00"
@.str.8 = [53 x i8] c" dn non-synonymous distance\0A\00"
@.str.9 = [49 x i8] c" ds synonymous distance\0A\00"
@.str.10 = [54 x i8] c" dm dn-ds merge (tree merge)\0A\00"
@.str.11 = [63 x i8] c" mm p-distance (amino acid alignment)\0A\00"
@.str.12 = [60 x i8] c" jtt JTT model (maximum likelihood)\0A\00"
@.str.13 = [54 x i8] c" kimura mm + Kimura's correction\0A\00"
@.str.14 = [54 x i8] c" -T NUM time limit in seconds [no limit]\0A\00"
@.str.15 = [47 x i8] c" -b NUM bootstrapping times [100]\0A\00"
@.str.16 = [42 x i8] c" -F NUM quality cut-off [15]\0A\00"
@.str.17 = [59 x i8] c" -o STR outgroup for tree cutting [Bilateria]\0A\00"
@.str.18 = [75 x i8] c" -S treat the first constrained tree as the original tree\0A\00"
@.str.19 = [68 x i8] c" -C use the leaves of constrained trees as ingroup\0A\00"
@.str.20 = [49 x i8] c" -M do not apply alignment mask\0A\00"
@.str.21 = [57 x i8] c" -N do not mask poorly aligned segments\0A\00"
@.str.22 = [51 x i8] c" -g collapse alternative splicing\0A\00"
@.str.23 = [50 x i8] c" -R do not apply leaf-reordering\0A\00"
@.str.24 = [54 x i8] c" -p the root node is a putative node\0A\00"
@.str.25 = [67 x i8] c" -a branch mode that is used by most tree-builder\0A\00"
@.str.26 = [65 x i8] c" -A the input alignment is stored in ALN format\0A\00"
@.str.27 = [67 x i8] c" -W wipe out root (SDI information will be lost!)\0A\00"
@.str.28 = [76 x i8] c" -I copy the branch support tags from the constrained tree\0A\00"
@.str.29 = [36 x i8] c" -v verbose output\0A\00"
@.str.30 = [27 x i8] c" -h help\0A\0A\00"
define i32 @tr_build_usage() {
%1 = load i32, i32* @stderr
%2 = call i32 @fprintf(i32 %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%3 = load i32, i32* @stderr
%4 = call i32 @fprintf(i32 %3, i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.1, i64 0, i64 0))
%5 = load i32, i32* @stderr
%6 = call i32 @fprintf(i32 %5, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%7 = load i32, i32* @stderr
%8 = call i32 @fprintf(i32 %7, i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.2, i64 0, i64 0))
%9 = load i32, i32* @stderr
%10 = call i32 @fprintf(i32 %9, i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.3, i64 0, i64 0))
%11 = load i32, i32* @stderr
%12 = call i32 @fprintf(i32 %11, i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.4, i64 0, i64 0))
%13 = load i32, i32* @stderr
%14 = call i32 @fprintf(i32 %13, i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.5, i64 0, i64 0))
%15 = load i32, i32* @stderr
%16 = call i32 @fprintf(i32 %15, i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.6, i64 0, i64 0))
%17 = load i32, i32* @stderr
%18 = call i32 @fprintf(i32 %17, i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.7, i64 0, i64 0))
%19 = load i32, i32* @stderr
%20 = call i32 @fprintf(i32 %19, i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.8, i64 0, i64 0))
%21 = load i32, i32* @stderr
%22 = call i32 @fprintf(i32 %21, i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.9, i64 0, i64 0))
%23 = load i32, i32* @stderr
%24 = call i32 @fprintf(i32 %23, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.10, i64 0, i64 0))
%25 = load i32, i32* @stderr
%26 = call i32 @fprintf(i32 %25, i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.11, i64 0, i64 0))
%27 = load i32, i32* @stderr
%28 = call i32 @fprintf(i32 %27, i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.12, i64 0, i64 0))
%29 = load i32, i32* @stderr
%30 = call i32 @fprintf(i32 %29, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.13, i64 0, i64 0))
%31 = load i32, i32* @stderr
%32 = call i32 @fprintf(i32 %31, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.14, i64 0, i64 0))
%33 = load i32, i32* @stderr
%34 = call i32 @fprintf(i32 %33, i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.15, i64 0, i64 0))
%35 = load i32, i32* @stderr
%36 = call i32 @fprintf(i32 %35, i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.16, i64 0, i64 0))
%37 = load i32, i32* @stderr
%38 = call i32 @fprintf(i32 %37, i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.17, i64 0, i64 0))
%39 = load i32, i32* @stderr
%40 = call i32 @fprintf(i32 %39, i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.18, i64 0, i64 0))
%41 = load i32, i32* @stderr
%42 = call i32 @fprintf(i32 %41, i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.19, i64 0, i64 0))
%43 = load i32, i32* @stderr
%44 = call i32 @fprintf(i32 %43, i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.20, i64 0, i64 0))
%45 = load i32, i32* @stderr
%46 = call i32 @fprintf(i32 %45, i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.21, i64 0, i64 0))
%47 = load i32, i32* @stderr
%48 = call i32 @fprintf(i32 %47, i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.22, i64 0, i64 0))
%49 = load i32, i32* @stderr
%50 = call i32 @fprintf(i32 %49, i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.23, i64 0, i64 0))
%51 = load i32, i32* @stderr
%52 = call i32 @fprintf(i32 %51, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.24, i64 0, i64 0))
%53 = load i32, i32* @stderr
%54 = call i32 @fprintf(i32 %53, i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.25, i64 0, i64 0))
%55 = load i32, i32* @stderr
%56 = call i32 @fprintf(i32 %55, i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.26, i64 0, i64 0))
%57 = load i32, i32* @stderr
%58 = call i32 @fprintf(i32 %57, i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.27, i64 0, i64 0))
%59 = load i32, i32* @stderr
%60 = call i32 @fprintf(i32 %59, i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.28, i64 0, i64 0))
%61 = load i32, i32* @stderr
%62 = call i32 @fprintf(i32 %61, i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.29, i64 0, i64 0))
%63 = load i32, i32* @stderr
%64 = call i32 @fprintf(i32 %63, i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.30, i64 0, i64 0))
%65 = call i32 @exit(i32 1)
unreachable
}

LLVM IR (-O2):
@stderr = global i32 0
@.str = [2 x i8] c"\0A\00"
@.str.1 = [45 x i8] c"Usage : treebest nj [options] <input_file>\0A\00"
@.str.2 = [61 x i8] c"Options: -c FILE constrained tree(s) in NH format [null]\0A\00"
@.str.3 = [48 x i8] c" -m FILE tree to be compared [null]\0A\00"
@.str.4 = [67 x i8] c" -s FILE species tree in NH format [default taxa tree]\0A\00"
@.str.5 = [46 x i8] c" -l FILE ingroup list file [null]\0A\00"
@.str.6 = [74 x i8] c" -t TYPE codon NT: ntmm, dn, ds, dm; AA: mm, jtt, kimura [mm]\0A\00"
@.str.7 = [58 x i8] c" ntmm p-distance (codon alignment)\0A\00"
@.str.8 = [53 x i8] c" dn non-synonymous distance\0A\00"
@.str.9 = [49 x i8] c" ds synonymous distance\0A\00"
@.str.10 = [54 x i8] c" dm dn-ds merge (tree merge)\0A\00"
@.str.11 = [63 x i8] c" mm p-distance (amino acid alignment)\0A\00"
@.str.12 = [60 x i8] c" jtt JTT model (maximum likelihood)\0A\00"
@.str.13 = [54 x i8] c" kimura mm + Kimura's correction\0A\00"
@.str.14 = [54 x i8] c" -T NUM time limit in seconds [no limit]\0A\00"
@.str.15 = [47 x i8] c" -b NUM bootstrapping times [100]\0A\00"
@.str.16 = [42 x i8] c" -F NUM quality cut-off [15]\0A\00"
@.str.17 = [59 x i8] c" -o STR outgroup for tree cutting [Bilateria]\0A\00"
@.str.18 = [75 x i8] c" -S treat the first constrained tree as the original tree\0A\00"
@.str.19 = [68 x i8] c" -C use the leaves of constrained trees as ingroup\0A\00"
@.str.20 = [49 x i8] c" -M do not apply alignment mask\0A\00"
@.str.21 = [57 x i8] c" -N do not mask poorly aligned segments\0A\00"
@.str.22 = [51 x i8] c" -g collapse alternative splicing\0A\00"
@.str.23 = [50 x i8] c" -R do not apply leaf-reordering\0A\00"
@.str.24 = [54 x i8] c" -p the root node is a putative node\0A\00"
@.str.25 = [67 x i8] c" -a branch mode that is used by most tree-builder\0A\00"
@.str.26 = [65 x i8] c" -A the input alignment is stored in ALN format\0A\00"
@.str.27 = [67 x i8] c" -W wipe out root (SDI information will be lost!)\0A\00"
@.str.28 = [76 x i8] c" -I copy the branch support tags from the constrained tree\0A\00"
@.str.29 = [36 x i8] c" -v verbose output\0A\00"
@.str.30 = [27 x i8] c" -h help\0A\0A\00"
define i32 @tr_build_usage() {
%1 = load i32, i32* @stderr
%2 = tail call i32 @fprintf(i32 %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%3 = load i32, i32* @stderr
%4 = tail call i32 @fprintf(i32 %3, i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.1, i64 0, i64 0))
%5 = load i32, i32* @stderr
%6 = tail call i32 @fprintf(i32 %5, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%7 = load i32, i32* @stderr
%8 = tail call i32 @fprintf(i32 %7, i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.2, i64 0, i64 0))
%9 = load i32, i32* @stderr
%10 = tail call i32 @fprintf(i32 %9, i8* getelementptr inbounds ([48 x i8], [48 x i8]* @.str.3, i64 0, i64 0))
%11 = load i32, i32* @stderr
%12 = tail call i32 @fprintf(i32 %11, i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.4, i64 0, i64 0))
%13 = load i32, i32* @stderr
%14 = tail call i32 @fprintf(i32 %13, i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.5, i64 0, i64 0))
%15 = load i32, i32* @stderr
%16 = tail call i32 @fprintf(i32 %15, i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.6, i64 0, i64 0))
%17 = load i32, i32* @stderr
%18 = tail call i32 @fprintf(i32 %17, i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.7, i64 0, i64 0))
%19 = load i32, i32* @stderr
%20 = tail call i32 @fprintf(i32 %19, i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.8, i64 0, i64 0))
%21 = load i32, i32* @stderr
%22 = tail call i32 @fprintf(i32 %21, i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.9, i64 0, i64 0))
%23 = load i32, i32* @stderr
%24 = tail call i32 @fprintf(i32 %23, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.10, i64 0, i64 0))
%25 = load i32, i32* @stderr
%26 = tail call i32 @fprintf(i32 %25, i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.11, i64 0, i64 0))
%27 = load i32, i32* @stderr
%28 = tail call i32 @fprintf(i32 %27, i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.12, i64 0, i64 0))
%29 = load i32, i32* @stderr
%30 = tail call i32 @fprintf(i32 %29, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.13, i64 0, i64 0))
%31 = load i32, i32* @stderr
%32 = tail call i32 @fprintf(i32 %31, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.14, i64 0, i64 0))
%33 = load i32, i32* @stderr
%34 = tail call i32 @fprintf(i32 %33, i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.15, i64 0, i64 0))
%35 = load i32, i32* @stderr
%36 = tail call i32 @fprintf(i32 %35, i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.16, i64 0, i64 0))
%37 = load i32, i32* @stderr
%38 = tail call i32 @fprintf(i32 %37, i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.17, i64 0, i64 0))
%39 = load i32, i32* @stderr
%40 = tail call i32 @fprintf(i32 %39, i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.18, i64 0, i64 0))
%41 = load i32, i32* @stderr
%42 = tail call i32 @fprintf(i32 %41, i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.19, i64 0, i64 0))
%43 = load i32, i32* @stderr
%44 = tail call i32 @fprintf(i32 %43, i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.20, i64 0, i64 0))
%45 = load i32, i32* @stderr
%46 = tail call i32 @fprintf(i32 %45, i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.21, i64 0, i64 0))
%47 = load i32, i32* @stderr
%48 = tail call i32 @fprintf(i32 %47, i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.22, i64 0, i64 0))
%49 = load i32, i32* @stderr
%50 = tail call i32 @fprintf(i32 %49, i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.23, i64 0, i64 0))
%51 = load i32, i32* @stderr
%52 = tail call i32 @fprintf(i32 %51, i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.24, i64 0, i64 0))
%53 = load i32, i32* @stderr
%54 = tail call i32 @fprintf(i32 %53, i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.25, i64 0, i64 0))
%55 = load i32, i32* @stderr
%56 = tail call i32 @fprintf(i32 %55, i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.26, i64 0, i64 0))
%57 = load i32, i32* @stderr
%58 = tail call i32 @fprintf(i32 %57, i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.27, i64 0, i64 0))
%59 = load i32, i32* @stderr
%60 = tail call i32 @fprintf(i32 %59, i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.28, i64 0, i64 0))
%61 = load i32, i32* @stderr
%62 = tail call i32 @fprintf(i32 %61, i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.29, i64 0, i64 0))
%63 = load i32, i32* @stderr
%64 = tail call i32 @fprintf(i32 %63, i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.30, i64 0, i64 0))
%65 = tail call i32 @exit(i32 1)
unreachable
}