#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*/ printf(char *);
void IBhelp() {
  printf("SYNOPSIS\n");
  printf("   realpaver [options...] filename\n\n");
  printf("   Where options include:\n");
  printf("      -union            return the list of computed boxes\n");
  printf("      -hull             return the hull of computed boxes\n");
  printf("      -bound            display of intervals: [a,b]\n");
  printf("      -midpoint         display of intervals: m + [-e,+e]\n");
  printf("\n");
  printf("      -precision value  minimum width of divided boxes\n");
  printf("      -nosplit          disable the splitting process\n");
  printf("      -split2           domains split in two parts\n");
  printf("      -split3           domains split in three parts\n");
  printf("      -rr               round-robin splitting strategy\n");
  printf("      -lf               largest-first splitting strategy\n");
  printf("      -mn               maximum narrowing splitting strategy\n");
  printf("      -paving           compute a paving of the solution space\n");
  printf("                        => Breadth-First-Search and largest_first "
         "choice\n");
  printf("      -points           minimum width of divided boxes\n");
  printf("                        => Depth-First-Search\n");
  printf("      -number +oo       compute all possible boxes\n");
  printf("      -number value     maximum number of computed boxes\n");
  printf("\n");
  printf(
      "      -hc3              hull consistency over decomposed constraints\n");
  printf("      -hc4              hull consistency over user' constraints\n");
  printf(
      "      -hc4_newton       hc4 combined with the interval Newton method\n");
  printf("      -bc3              box consistency\n");
  printf(
      "      -bc3_newton       bc3 combined with the interval Newton method\n");
  printf("      -bc4              hc4 combined with bc3\n");
  printf(
      "      -bc5              bc4 combined with the interval Newton method\n");
  printf("      -3B value         3B(value) consistency\n");
  printf("      -weak3B value     weak 3B(value) consistency\n");
  printf("\n   All these options can be parameterized in filename. See\n");
  printf("   the documentation for that.\n");
  printf("\n\nDESCRIPTION\n");
  printf("    RealPaver is a real constraint paver.\n\n");
  printf(
      "    Given a system of nonlinear constraints over the real numbers,\n");
  printf("    it computes a paving of the solution set. A paving is a union\n");
  printf("    of Cartesian product of interval domains (boxes) enclosing\n");
  printf("    the solution set.\n\n");
  printf("    The solving engine of RealPaver implements a branch-and-prune\n");
  printf("    algorithm that alternates reduction steps of variable domains\n");
  printf("    by means of constraint consistency techniques and splitting "
         "steps.\n");
  printf("\n\nINPUT FILE\n");
  printf("    The input file is composed of a nonlinear constraint system\n");
  printf(
      "    (constants, variables and domains, constraints) and flags used\n");
  printf("    to parameterize the resolution.\n\n");
  printf("    See the files benchmarks/abc or benchmarks/circle\n");
  printf("\n\nREFERENCES\n");
  printf(
      "\n    [1] F. Benhamou, F. Goualard, L. Granvilliers and J.-F. Puget.\n");
  printf("        Revising Hull and Box Consistency. Procs. of ICLP'99,\n");
  printf("        Las Cruces, USA, 1999. The MIT Press.\n");
  printf("\n    [2] E. Davis. Constraint Propagation with Interval Labels.\n");
  printf("        Artificial Intelligence, 32:281-331, 1987\n");
  printf("\n    [3] L. Granvilliers. On the Combination of Interval Constraint "
         "Solvers.\n");
  printf("        Reliable Computing, 7(6):467:483, 2001.\n");
  printf("\n    [4] R. B. Kearfott. Some Tests of Generalized Bisection.\n");
  printf("        ACM TOMS, 13(3):197-220, 1987.\n");
  printf("\n    [5] O. Lhomme. Consistency Techniques for Numeric CSPs.\n");
  printf(
      "        Procs. of IJCAI'93, Chambery, France, 1993. Morgan Kaufman\n");
  printf("\n    [6] R. E. Moore. Interval Analysis. Prentice-Hall,\n");
  printf("        Englewood Cliffs, NJ, 1966.\n");
  printf("\n    [7] P. Van Hentenryck, L. Michel and Y. Deville. Numerica:\n");
  printf("        a Modeling Language for Global Optimization. MIT Press, "
         "1997.\n");
  printf("\n");
}


x86 assembly (clang, -O0):
<IBhelp>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xee3(%rip),%rdi
call   1030 <printf@plt>
lea    0xefc(%rip),%rdi
call   1030 <printf@plt>
lea    0xf0b(%rip),%rdi
call   1030 <printf@plt>
lea    0xf3a(%rip),%rdi
call   1030 <printf@plt>
lea    0xf69(%rip),%rdi
call   1030 <printf@plt>
lea    0xf92(%rip),%rdi
call   1030 <printf@plt>
lea    0x17b9(%rip),%rdi
call   1030 <printf@plt>
lea    0xfb5(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe1(%rip),%rdi
call   1030 <printf@plt>
lea    0x100c(%rip),%rdi
call   1030 <printf@plt>
lea    0x1034(%rip),%rdi
call   1030 <printf@plt>
lea    0x105e(%rip),%rdi
call   1030 <printf@plt>
lea    0x108a(%rip),%rdi
call   1030 <printf@plt>
lea    0x10b8(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ea(%rip),%rdi
call   1030 <printf@plt>
lea    0x111e(%rip),%rdi
call   1030 <printf@plt>
lea    0x115c(%rip),%rdi
call   1030 <printf@plt>
lea    0x1188(%rip),%rdi
call   1030 <printf@plt>
lea    0x11ab(%rip),%rdi
call   1030 <printf@plt>
lea    0x11d3(%rip),%rdi
call   1030 <printf@plt>
lea    0x1711(%rip),%rdi
call   1030 <printf@plt>
lea    0x11f5(%rip),%rdi
call   1030 <printf@plt>
lea    0x122f(%rip),%rdi
call   1030 <printf@plt>
lea    0x1264(%rip),%rdi
call   1030 <printf@plt>
lea    0x129e(%rip),%rdi
call   1030 <printf@plt>
lea    0x12bb(%rip),%rdi
call   1030 <printf@plt>
lea    0x12f5(%rip),%rdi
call   1030 <printf@plt>
lea    0x1318(%rip),%rdi
call   1030 <printf@plt>
lea    0x1352(%rip),%rdi
call   1030 <printf@plt>
lea    0x1375(%rip),%rdi
call   1030 <printf@plt>
lea    0x139d(%rip),%rdi
call   1030 <printf@plt>
lea    0x13ce(%rip),%rdi
call   1030 <printf@plt>
lea    0x13e2(%rip),%rdi
call   1030 <printf@plt>
lea    0x13e5(%rip),%rdi
call   1030 <printf@plt>
lea    0x1405(%rip),%rdi
call   1030 <printf@plt>
lea    0x143d(%rip),%rdi
call   1030 <printf@plt>
lea    0x1474(%rip),%rdi
call   1030 <printf@plt>
lea    0x14a8(%rip),%rdi
call   1030 <printf@plt>
lea    0x14b4(%rip),%rdi
call   1030 <printf@plt>
lea    0x14eb(%rip),%rdi
call   1030 <printf@plt>
lea    0x1522(%rip),%rdi
call   1030 <printf@plt>
lea    0x155e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1560(%rip),%rdi
call   1030 <printf@plt>
lea    0x1595(%rip),%rdi
call   1030 <printf@plt>
lea    0x15cd(%rip),%rdi
call   1030 <printf@plt>
lea    0x15e7(%rip),%rdi
call   1030 <printf@plt>
lea    0x1612(%rip),%rdi
call   1030 <printf@plt>
lea    0x1614(%rip),%rdi
call   1030 <printf@plt>
lea    0x164d(%rip),%rdi
call   1030 <printf@plt>
lea    0x1680(%rip),%rdi
call   1030 <printf@plt>
lea    0x16a3(%rip),%rdi
call   1030 <printf@plt>
lea    0x16d8(%rip),%rdi
call   1030 <printf@plt>
lea    0x16ff(%rip),%rdi
call   1030 <printf@plt>
lea    0x1741(%rip),%rdi
call   1030 <printf@plt>
lea    0x1766(%rip),%rdi
call   1030 <printf@plt>
lea    0x1799(%rip),%rdi
call   1030 <printf@plt>
lea    0x17b5(%rip),%rdi
call   1030 <printf@plt>
lea    0x17e7(%rip),%rdi
call   1030 <printf@plt>
lea    0x181f(%rip),%rdi
call   1030 <printf@plt>
lea    0x184c(%rip),%rdi
call   1030 <printf@plt>
lea    0x1865(%rip),%rdi
call   1030 <printf@plt>
lea    0x189a(%rip),%rdi
call   1030 <printf@plt>
lea    0x1519(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<IBhelp>:
push   %rax
lea    0xed8(%rip),%rdi
call   1040 <puts@plt>
lea    0xed5(%rip),%rdi
call   1040 <puts@plt>
lea    0xeed(%rip),%rdi
call   1040 <puts@plt>
lea    0xefb(%rip),%rdi
call   1040 <puts@plt>
lea    0xf29(%rip),%rdi
call   1040 <puts@plt>
lea    0xf57(%rip),%rdi
call   1040 <puts@plt>
lea    0xf7f(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xfa3(%rip),%rdi
call   1040 <puts@plt>
lea    0xfce(%rip),%rdi
call   1040 <puts@plt>
lea    0xff8(%rip),%rdi
call   1040 <puts@plt>
lea    0x101f(%rip),%rdi
call   1040 <puts@plt>
lea    0x1048(%rip),%rdi
call   1040 <puts@plt>
lea    0x1073(%rip),%rdi
call   1040 <puts@plt>
lea    0x10a0(%rip),%rdi
call   1040 <puts@plt>
lea    0x10d1(%rip),%rdi
call   1040 <puts@plt>
lea    0x1104(%rip),%rdi
call   1040 <puts@plt>
lea    0x1141(%rip),%rdi
call   1040 <puts@plt>
lea    0x116c(%rip),%rdi
call   1040 <puts@plt>
lea    0x118e(%rip),%rdi
call   1040 <puts@plt>
lea    0x11b5(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x11d8(%rip),%rdi
call   1040 <puts@plt>
lea    0x1211(%rip),%rdi
call   1040 <puts@plt>
lea    0x1245(%rip),%rdi
call   1040 <puts@plt>
lea    0x127e(%rip),%rdi
call   1040 <puts@plt>
lea    0x129a(%rip),%rdi
call   1040 <puts@plt>
lea    0x12d3(%rip),%rdi
call   1040 <puts@plt>
lea    0x12f5(%rip),%rdi
call   1040 <puts@plt>
lea    0x132e(%rip),%rdi
call   1040 <puts@plt>
lea    0x1350(%rip),%rdi
call   1040 <puts@plt>
lea    0x1377(%rip),%rdi
call   1040 <puts@plt>
lea    0x13a7(%rip),%rdi
call   1040 <puts@plt>
lea    0x13ba(%rip),%rdi
call   1040 <puts@plt>
lea    0x13bc(%rip),%rdi
call   1040 <puts@plt>
lea    0x13db(%rip),%rdi
call   1040 <puts@plt>
lea    0x1412(%rip),%rdi
call   1040 <puts@plt>
lea    0x1448(%rip),%rdi
call   1040 <puts@plt>
lea    0x147b(%rip),%rdi
call   1040 <puts@plt>
lea    0x1486(%rip),%rdi
call   1040 <puts@plt>
lea    0x14bc(%rip),%rdi
call   1040 <puts@plt>
lea    0x14f2(%rip),%rdi
call   1040 <puts@plt>
lea    0x152d(%rip),%rdi
call   1040 <puts@plt>
lea    0x152e(%rip),%rdi
call   1040 <puts@plt>
lea    0x1562(%rip),%rdi
call   1040 <puts@plt>
lea    0x1599(%rip),%rdi
call   1040 <puts@plt>
lea    0x15b2(%rip),%rdi
call   1040 <puts@plt>
lea    0x15dc(%rip),%rdi
call   1040 <puts@plt>
lea    0x15dd(%rip),%rdi
call   1040 <puts@plt>
lea    0x1615(%rip),%rdi
call   1040 <puts@plt>
lea    0x1647(%rip),%rdi
call   1040 <puts@plt>
lea    0x1669(%rip),%rdi
call   1040 <puts@plt>
lea    0x169d(%rip),%rdi
call   1040 <puts@plt>
lea    0x16c3(%rip),%rdi
call   1040 <puts@plt>
lea    0x1704(%rip),%rdi
call   1040 <puts@plt>
lea    0x1728(%rip),%rdi
call   1040 <puts@plt>
lea    0x175a(%rip),%rdi
call   1040 <puts@plt>
lea    0x1775(%rip),%rdi
call   1040 <puts@plt>
lea    0x17a6(%rip),%rdi
call   1040 <puts@plt>
lea    0x17dd(%rip),%rdi
call   1040 <puts@plt>
lea    0x1809(%rip),%rdi
call   1040 <puts@plt>
lea    0x1821(%rip),%rdi
call   1040 <puts@plt>
lea    0x1855(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
pop    %rax
jmp    1030 <putchar@plt>

LLVM IR (-O0):
@.str = [10 x i8] c"SYNOPSIS\0A\00"
@.str.1 = [37 x i8] c" realpaver [options...] filename\0A\0A\00"
@.str.2 = [27 x i8] c" Where options include:\0A\00"
@.str.3 = [59 x i8] c" -union return the list of computed boxes\0A\00"
@.str.4 = [59 x i8] c" -hull return the hull of computed boxes\0A\00"
@.str.5 = [53 x i8] c" -bound display of intervals: [a,b]\0A\00"
@.str.6 = [59 x i8] c" -midpoint display of intervals: m + [-e,+e]\0A\00"
@.str.7 = [2 x i8] c"\0A\00"
@.str.8 = [56 x i8] c" -precision value minimum width of divided boxes\0A\00"
@.str.9 = [55 x i8] c" -nosplit disable the splitting process\0A\00"
@.str.10 = [52 x i8] c" -split2 domains split in two parts\0A\00"
@.str.11 = [54 x i8] c" -split3 domains split in three parts\0A\00"
@.str.12 = [56 x i8] c" -rr round-robin splitting strategy\0A\00"
@.str.13 = [58 x i8] c" -lf largest-first splitting strategy\0A\00"
@.str.14 = [62 x i8] c" -mn maximum narrowing splitting strategy\0A\00"
@.str.15 = [64 x i8] c" -paving compute a paving of the solution space\0A\00"
@.str.16 = [74 x i8] c" => Breadth-First-Search and largest_first choice\0A\00"
@.str.17 = [56 x i8] c" -points minimum width of divided boxes\0A\00"
@.str.18 = [47 x i8] c" => Depth-First-Search\0A\00"
@.str.19 = [52 x i8] c" -number +oo compute all possible boxes\0A\00"
@.str.20 = [58 x i8] c" -number value maximum number of computed boxes\0A\00"
@.str.21 = [70 x i8] c" -hc3 hull consistency over decomposed constraints\0A\00"
@.str.22 = [65 x i8] c" -hc4 hull consistency over user' constraints\0A\00"
@.str.23 = [70 x i8] c" -hc4_newton hc4 combined with the interval Newton method\0A\00"
@.str.24 = [41 x i8] c" -bc3 box consistency\0A\00"
@.str.25 = [70 x i8] c" -bc3_newton bc3 combined with the interval Newton method\0A\00"
@.str.26 = [47 x i8] c" -bc4 hc4 combined with bc3\0A\00"
@.str.27 = [70 x i8] c" -bc5 bc4 combined with the interval Newton method\0A\00"
@.str.28 = [47 x i8] c" -3B value 3B(value) consistency\0A\00"
@.str.29 = [52 x i8] c" -weak3B value weak 3B(value) consistency\0A\00"
@.str.30 = [61 x i8] c"\0A All these options can be parameterized in filename. See\0A\00"
@.str.31 = [32 x i8] c" the documentation for that.\0A\00"
@.str.32 = [15 x i8] c"\0A\0ADESCRIPTION\0A\00"
@.str.33 = [44 x i8] c" RealPaver is a real constraint paver.\0A\0A\00"
@.str.34 = [68 x i8] c" Given a system of nonlinear constraints over the real numbers,\0A\00"
@.str.35 = [67 x i8] c" it computes a paving of the solution set. A paving is a union\0A\00"
@.str.36 = [64 x i8] c" of Cartesian product of interval domains (boxes) enclosing\0A\00"
@.str.37 = [24 x i8] c" the solution set.\0A\0A\00"
@.str.38 = [67 x i8] c" The solving engine of RealPaver implements a branch-and-prune\0A\00"
@.str.39 = [67 x i8] c" algorithm that alternates reduction steps of variable domains\0A\00"
@.str.40 = [72 x i8] c" by means of constraint consistency techniques and splitting steps.\0A\00"
@.str.41 = [14 x i8] c"\0A\0AINPUT FILE\0A\00"
@.str.42 = [65 x i8] c" The input file is composed of a nonlinear constraint system\0A\00"
@.str.43 = [68 x i8] c" (constants, variables and domains, constraints) and flags used\0A\00"
@.str.44 = [38 x i8] c" to parameterize the resolution.\0A\0A\00"
@.str.45 = [55 x i8] c" See the files benchmarks/abc or benchmarks/circle\0A\00"
@.str.46 = [14 x i8] c"\0A\0AREFERENCES\0A\00"
@.str.47 = [69 x i8] c"\0A [1] F. Benhamou, F. Goualard, L. Granvilliers and J.-F. Puget.\0A\00"
@.str.48 = [63 x i8] c" Revising Hull and Box Consistency. Procs. of ICLP'99,\0A\00"
@.str.49 = [47 x i8] c" Las Cruces, USA, 1999. The MIT Press.\0A\00"
@.str.50 = [65 x i8] c"\0A [2] E. Davis. Constraint Propagation with Interval Labels.\0A\00"
@.str.51 = [51 x i8] c" Artificial Intelligence, 32:281-331, 1987\0A\00"
@.str.52 = [78 x i8] c"\0A [3] L. Granvilliers. On the Combination of Interval Constraint Solvers.\0A\00"
@.str.53 = [49 x i8] c" Reliable Computing, 7(6):467:483, 2001.\0A\00"
@.str.54 = [63 x i8] c"\0A [4] R. B. Kearfott. Some Tests of Generalized Bisection.\0A\00"
@.str.55 = [40 x i8] c" ACM TOMS, 13(3):197-220, 1987.\0A\00"
@.str.56 = [62 x i8] c"\0A [5] O. Lhomme. Consistency Techniques for Numeric CSPs.\0A\00"
@.str.57 = [68 x i8] c" Procs. of IJCAI'93, Chambery, France, 1993. Morgan Kaufman\0A\00"
@.str.58 = [57 x i8] c"\0A [6] R. E. Moore. Interval Analysis. Prentice-Hall,\0A\00"
@.str.59 = [37 x i8] c" Englewood Cliffs, NJ, 1966.\0A\00"
@.str.60 = [65 x i8] c"\0A [7] P. Van Hentenryck, L. Michel and Y. Deville. Numerica:\0A\00"
@.str.61 = [71 x i8] c" a Modeling Language for Global Optimization. MIT Press, 1997.\0A\00"
define void @IBhelp() {
%1 = call i32 @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.17, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.18, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.19, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.20, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.7, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.21, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.22, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.23, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.24, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.25, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.26, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.27, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.28, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.29, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.30, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.31, i64 0, i64 0))
%34 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.32, i64 0, i64 0))
%35 = call i32 @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.33, i64 0, i64 0))
%36 = call i32 @printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.34, i64 0, i64 0))
%37 = call i32 @printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.35, i64 0, i64 0))
%38 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.36, i64 0, i64 0))
%39 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.37, i64 0, i64 0))
%40 = call i32 @printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.38, i64 0, i64 0))
%41 = call i32 @printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.39, i64 0, i64 0))
%42 = call i32 @printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.40, i64 0, i64 0))
%43 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.41, i64 0, i64 0))
%44 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.42, i64 0, i64 0))
%45 = call i32 @printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.43, i64 0, i64 0))
%46 = call i32 @printf(i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.44, i64 0, i64 0))
%47 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.45, i64 0, i64 0))
%48 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.46, i64 0, i64 0))
%49 = call i32 @printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.47, i64 0, i64 0))
%50 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.48, i64 0, i64 0))
%51 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.49, i64 0, i64 0))
%52 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.50, i64 0, i64 0))
%53 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.51, i64 0, i64 0))
%54 = call i32 @printf(i8* getelementptr inbounds ([78 x i8], [78 x i8]* @.str.52, i64 0, i64 0))
%55 = call i32 @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.53, i64 0, i64 0))
%56 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.54, i64 0, i64 0))
%57 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.55, i64 0, i64 0))
%58 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.56, i64 0, i64 0))
%59 = call i32 @printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.57, i64 0, i64 0))
%60 = call i32 @printf(i8* getelementptr inbounds ([57 x i8], [57 x i8]* @.str.58, i64 0, i64 0))
%61 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.59, i64 0, i64 0))
%62 = call i32 @printf(i8* getelementptr inbounds ([65 x i8], [65 x i8]* @.str.60, i64 0, i64 0))
%63 = call i32 @printf(i8* getelementptr inbounds ([71 x i8], [71 x i8]* @.str.61, i64 0, i64 0))
%64 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.7, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [9 x i8] c"SYNOPSIS\00"
@str.62 = [36 x i8] c" realpaver [options...] filename\0A\00"
@str.63 = [26 x i8] c" Where options include:\00"
@str.64 = [58 x i8] c" -union return the list of computed boxes\00"
@str.65 = [58 x i8] c" -hull return the hull of computed boxes\00"
@str.66 = [52 x i8] c" -bound display of intervals: [a,b]\00"
@str.67 = [58 x i8] c" -midpoint display of intervals: m + [-e,+e]\00"
@str.68 = [55 x i8] c" -precision value minimum width of divided boxes\00"
@str.69 = [54 x i8] c" -nosplit disable the splitting process\00"
@str.70 = [51 x i8] c" -split2 domains split in two parts\00"
@str.71 = [53 x i8] c" -split3 domains split in three parts\00"
@str.72 = [55 x i8] c" -rr round-robin splitting strategy\00"
@str.73 = [57 x i8] c" -lf largest-first splitting strategy\00"
@str.74 = [61 x i8] c" -mn maximum narrowing splitting strategy\00"
@str.75 = [63 x i8] c" -paving compute a paving of the solution space\00"
@str.76 = [73 x i8] c" => Breadth-First-Search and largest_first choice\00"
@str.77 = [55 x i8] c" -points minimum width of divided boxes\00"
@str.78 = [46 x i8] c" => Depth-First-Search\00"
@str.79 = [51 x i8] c" -number +oo compute all possible boxes\00"
@str.80 = [57 x i8] c" -number value maximum number of computed boxes\00"
@str.81 = [69 x i8] c" -hc3 hull consistency over decomposed constraints\00"
@str.82 = [64 x i8] c" -hc4 hull consistency over user' constraints\00"
@str.83 = [69 x i8] c" -hc4_newton hc4 combined with the interval Newton method\00"
@str.84 = [40 x i8] c" -bc3 box consistency\00"
@str.85 = [69 x i8] c" -bc3_newton bc3 combined with the interval Newton method\00"
@str.86 = [46 x i8] c" -bc4 hc4 combined with bc3\00"
@str.87 = [69 x i8] c" -bc5 bc4 combined with the interval Newton method\00"
@str.88 = [46 x i8] c" -3B value 3B(value) consistency\00"
@str.89 = [51 x i8] c" -weak3B value weak 3B(value) consistency\00"
@str.90 = [60 x i8] c"\0A All these options can be parameterized in filename. See\00"
@str.91 = [31 x i8] c" the documentation for that.\00"
@str.92 = [14 x i8] c"\0A\0ADESCRIPTION\00"
@str.93 = [43 x i8] c" RealPaver is a real constraint paver.\0A\00"
@str.94 = [67 x i8] c" Given a system of nonlinear constraints over the real numbers,\00"
@str.95 = [66 x i8] c" it computes a paving of the solution set. A paving is a union\00"
@str.96 = [63 x i8] c" of Cartesian product of interval domains (boxes) enclosing\00"
@str.97 = [23 x i8] c" the solution set.\0A\00"
@str.98 = [66 x i8] c" The solving engine of RealPaver implements a branch-and-prune\00"
@str.99 = [66 x i8] c" algorithm that alternates reduction steps of variable domains\00"
@str.100 = [71 x i8] c" by means of constraint consistency techniques and splitting steps.\00"
@str.101 = [13 x i8] c"\0A\0AINPUT FILE\00"
@str.102 = [64 x i8] c" The input file is composed of a nonlinear constraint system\00"
@str.103 = [67 x i8] c" (constants, variables and domains, constraints) and flags used\00"
@str.104 = [37 x i8] c" to parameterize the resolution.\0A\00"
@str.105 = [54 x i8] c" See the files benchmarks/abc or benchmarks/circle\00"
@str.106 = [13 x i8] c"\0A\0AREFERENCES\00"
@str.107 = [68 x i8] c"\0A [1] F. Benhamou, F. Goualard, L. Granvilliers and J.-F. Puget.\00"
@str.108 = [62 x i8] c" Revising Hull and Box Consistency. Procs. of ICLP'99,\00"
@str.109 = [46 x i8] c" Las Cruces, USA, 1999. The MIT Press.\00"
@str.110 = [64 x i8] c"\0A [2] E. Davis. Constraint Propagation with Interval Labels.\00"
@str.111 = [50 x i8] c" Artificial Intelligence, 32:281-331, 1987\00"
@str.112 = [77 x i8] c"\0A [3] L. Granvilliers. On the Combination of Interval Constraint Solvers.\00"
@str.113 = [48 x i8] c" Reliable Computing, 7(6):467:483, 2001.\00"
@str.114 = [62 x i8] c"\0A [4] R. B. Kearfott. Some Tests of Generalized Bisection.\00"
@str.115 = [39 x i8] c" ACM TOMS, 13(3):197-220, 1987.\00"
@str.116 = [61 x i8] c"\0A [5] O. Lhomme. Consistency Techniques for Numeric CSPs.\00"
@str.117 = [67 x i8] c" Procs. of IJCAI'93, Chambery, France, 1993. Morgan Kaufman\00"
@str.118 = [56 x i8] c"\0A [6] R. E. Moore. Interval Analysis. Prentice-Hall,\00"
@str.119 = [36 x i8] c" Englewood Cliffs, NJ, 1966.\00"
@str.120 = [64 x i8] c"\0A [7] P. Van Hentenryck, L. Michel and Y. Deville. Numerica:\00"
@str.121 = [70 x i8] c" a Modeling Language for Global Optimization. MIT Press, 1997.\00"
define void @IBhelp() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.62, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.63, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.64, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.65, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.66, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.67, i64 0, i64 0))
%8 = tail call i32 @putchar(i32 10)
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.68, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.69, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.70, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @str.71, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.72, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.73, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.74, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.75, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.76, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.77, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.78, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.79, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.80, i64 0, i64 0))
%22 = tail call i32 @putchar(i32 10)
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([69 x i8], [69 x i8]* @str.81, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.82, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([69 x i8], [69 x i8]* @str.83, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.84, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([69 x i8], [69 x i8]* @str.85, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.86, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([69 x i8], [69 x i8]* @str.87, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.88, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.89, i64 0, i64 0))
%32 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.90, i64 0, i64 0))
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.91, i64 0, i64 0))
%34 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str.92, i64 0, i64 0))
%35 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.93, i64 0, i64 0))
%36 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([67 x i8], [67 x i8]* @str.94, i64 0, i64 0))
%37 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([66 x i8], [66 x i8]* @str.95, i64 0, i64 0))
%38 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.96, i64 0, i64 0))
%39 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.97, i64 0, i64 0))
%40 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([66 x i8], [66 x i8]* @str.98, i64 0, i64 0))
%41 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([66 x i8], [66 x i8]* @str.99, i64 0, i64 0))
%42 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([71 x i8], [71 x i8]* @str.100, i64 0, i64 0))
%43 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.101, i64 0, i64 0))
%44 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.102, i64 0, i64 0))
%45 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([67 x i8], [67 x i8]* @str.103, i64 0, i64 0))
%46 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([37 x i8], [37 x i8]* @str.104, i64 0, i64 0))
%47 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.105, i64 0, i64 0))
%48 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.106, i64 0, i64 0))
%49 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([68 x i8], [68 x i8]* @str.107, i64 0, i64 0))
%50 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.108, i64 0, i64 0))
%51 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.109, i64 0, i64 0))
%52 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.110, i64 0, i64 0))
%53 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.111, i64 0, i64 0))
%54 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([77 x i8], [77 x i8]* @str.112, i64 0, i64 0))
%55 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.113, i64 0, i64 0))
%56 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.114, i64 0, i64 0))
%57 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.115, i64 0, i64 0))
%58 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.116, i64 0, i64 0))
%59 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([67 x i8], [67 x i8]* @str.117, i64 0, i64 0))
%60 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([56 x i8], [56 x i8]* @str.118, i64 0, i64 0))
%61 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.119, i64 0, i64 0))
%62 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([64 x i8], [64 x i8]* @str.120, i64 0, i64 0))
%63 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([70 x i8], [70 x i8]* @str.121, i64 0, i64 0))
%64 = tail call i32 @putchar(i32 10)
ret void
}