#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 ff_usage(void) {
  printf("\nusage of ff:\n");
  printf("\nOPTIONS   DESCRIPTIONS\n\n");
  printf("-p <str>    path for operator and fact file\n");
  printf("-o <str>    operator file name\n");
  printf("-f <str>    fact file name\n\n");
  printf("-i <num>    run-time information level( preset: 1 )\n");
  printf("      0     only times\n");
  printf("      1     problem name, planning process infos\n");
  printf("    101     parsed problem data\n");
  printf("    102     cleaned up ADL problem\n");
  printf("    103     collected string tables\n");
  printf("    104     encoded domain\n");
  printf("    105     predicates inertia info\n");
  printf("    106     splitted initial state\n");
  printf("    107     domain with Wff s normalized\n");
  printf("    108     domain with NOT conds translated\n");
  printf("    109     splitted domain\n");
  printf("    110     cleaned up easy domain\n");
  printf("    111     unaries encoded easy domain\n");
  printf("    112     effects multiplied easy domain\n");
  printf("    113     inertia removed easy domain\n");
  printf("    114     easy action templates\n");
  printf("    115     cleaned up hard domain representation\n");
  printf("    116     mixed hard domain representation\n");
  printf("    117     final hard domain representation\n");
  printf("    118     reachability analysis results\n");
  printf("    119     facts selected as relevant\n");
  printf("    120     final domain and problem representations\n");
  printf("    121     connectivity graph\n");
  printf("    122     fixpoint result on each evaluated state\n");
  printf("    123     1P extracted on each evaluated state\n");
  printf("    124     H set collected for each evaluated state\n");
  printf("    125     False sets of goals <GAM>\n");
  printf("    126     detected ordering constraints leq_h <GAM>\n");
  printf("    127     the Goal Agenda <GAM>\n");
  printf("\n-d <num>    switch on debugging\n\n");
}


x86 assembly (clang, -O0):
<ff_usage>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0xee8(%rip),%rdi
call   1030 <printf@plt>
lea    0xef6(%rip),%rdi
call   1030 <printf@plt>
lea    0xf17(%rip),%rdi
call   1030 <printf@plt>
lea    0xf2b(%rip),%rdi
call   1030 <printf@plt>
lea    0xf3c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf65(%rip),%rdi
call   1030 <printf@plt>
lea    0xf71(%rip),%rdi
call   1030 <printf@plt>
lea    0xf97(%rip),%rdi
call   1030 <printf@plt>
lea    0xfac(%rip),%rdi
call   1030 <printf@plt>
lea    0xfc4(%rip),%rdi
call   1030 <printf@plt>
lea    0xfdd(%rip),%rdi
call   1030 <printf@plt>
lea    0xfed(%rip),%rdi
call   1030 <printf@plt>
lea    0x1006(%rip),%rdi
call   1030 <printf@plt>
lea    0x101e(%rip),%rdi
call   1030 <printf@plt>
lea    0x103c(%rip),%rdi
call   1030 <printf@plt>
lea    0x105e(%rip),%rdi
call   1030 <printf@plt>
lea    0x106f(%rip),%rdi
call   1030 <printf@plt>
lea    0x1087(%rip),%rdi
call   1030 <printf@plt>
lea    0x10a4(%rip),%rdi
call   1030 <printf@plt>
lea    0x10c4(%rip),%rdi
call   1030 <printf@plt>
lea    0x10e1(%rip),%rdi
call   1030 <printf@plt>
lea    0x10f8(%rip),%rdi
call   1030 <printf@plt>
lea    0x111f(%rip),%rdi
call   1030 <printf@plt>
lea    0x1141(%rip),%rdi
call   1030 <printf@plt>
lea    0x1163(%rip),%rdi
call   1030 <printf@plt>
lea    0x1182(%rip),%rdi
call   1030 <printf@plt>
lea    0x119e(%rip),%rdi
call   1030 <printf@plt>
lea    0x11c8(%rip),%rdi
call   1030 <printf@plt>
lea    0x11dc(%rip),%rdi
call   1030 <printf@plt>
lea    0x1205(%rip),%rdi
call   1030 <printf@plt>
lea    0x122b(%rip),%rdi
call   1030 <printf@plt>
lea    0x1255(%rip),%rdi
call   1030 <printf@plt>
lea    0x1270(%rip),%rdi
call   1030 <printf@plt>
lea    0x129b(%rip),%rdi
call   1030 <printf@plt>
lea    0x12b2(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<ff_usage>:
push   %rax
lea    0xee8(%rip),%rdi
call   1030 <puts@plt>
lea    0xeea(%rip),%rdi
call   1030 <puts@plt>
lea    0xef7(%rip),%rdi
call   1030 <puts@plt>
lea    0xf17(%rip),%rdi
call   1030 <puts@plt>
lea    0xf2a(%rip),%rdi
call   1030 <puts@plt>
lea    0xf3a(%rip),%rdi
call   1030 <puts@plt>
lea    0xf62(%rip),%rdi
call   1030 <puts@plt>
lea    0xf6d(%rip),%rdi
call   1030 <puts@plt>
lea    0xf92(%rip),%rdi
call   1030 <puts@plt>
lea    0xfa6(%rip),%rdi
call   1030 <puts@plt>
lea    0xfbd(%rip),%rdi
call   1030 <puts@plt>
lea    0xfd5(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe4(%rip),%rdi
call   1030 <puts@plt>
lea    0xffc(%rip),%rdi
call   1030 <puts@plt>
lea    0x1013(%rip),%rdi
call   1030 <puts@plt>
lea    0x1030(%rip),%rdi
call   1030 <puts@plt>
lea    0x1051(%rip),%rdi
call   1030 <puts@plt>
lea    0x1061(%rip),%rdi
call   1030 <puts@plt>
lea    0x1078(%rip),%rdi
call   1030 <puts@plt>
lea    0x1094(%rip),%rdi
call   1030 <puts@plt>
lea    0x10b3(%rip),%rdi
call   1030 <puts@plt>
lea    0x10cf(%rip),%rdi
call   1030 <puts@plt>
lea    0x10e5(%rip),%rdi
call   1030 <puts@plt>
lea    0x110b(%rip),%rdi
call   1030 <puts@plt>
lea    0x112c(%rip),%rdi
call   1030 <puts@plt>
lea    0x114d(%rip),%rdi
call   1030 <puts@plt>
lea    0x116b(%rip),%rdi
call   1030 <puts@plt>
lea    0x1186(%rip),%rdi
call   1030 <puts@plt>
lea    0x11af(%rip),%rdi
call   1030 <puts@plt>
lea    0x11c2(%rip),%rdi
call   1030 <puts@plt>
lea    0x11ea(%rip),%rdi
call   1030 <puts@plt>
lea    0x120f(%rip),%rdi
call   1030 <puts@plt>
lea    0x1238(%rip),%rdi
call   1030 <puts@plt>
lea    0x1252(%rip),%rdi
call   1030 <puts@plt>
lea    0x127c(%rip),%rdi
call   1030 <puts@plt>
lea    0x1292(%rip),%rdi
pop    %rax
jmp    1030 <puts@plt>

LLVM IR (-O0):
@.str = [15 x i8] c"\0Ausage of ff:\0A\00"
@.str.1 = [26 x i8] c"\0AOPTIONS DESCRIPTIONS\0A\0A\00"
@.str.2 = [45 x i8] c"-p <str> path for operator and fact file\0A\00"
@.str.3 = [32 x i8] c"-o <str> operator file name\0A\00"
@.str.4 = [29 x i8] c"-f <str> fact file name\0A\0A\00"
@.str.5 = [53 x i8] c"-i <num> run-time information level( preset: 1 )\0A\00"
@.str.6 = [24 x i8] c" 0 only times\0A\00"
@.str.7 = [50 x i8] c" 1 problem name, planning process infos\0A\00"
@.str.8 = [33 x i8] c" 101 parsed problem data\0A\00"
@.str.9 = [36 x i8] c" 102 cleaned up ADL problem\0A\00"
@.str.10 = [37 x i8] c" 103 collected string tables\0A\00"
@.str.11 = [28 x i8] c" 104 encoded domain\0A\00"
@.str.12 = [37 x i8] c" 105 predicates inertia info\0A\00"
@.str.13 = [36 x i8] c" 106 splitted initial state\0A\00"
@.str.14 = [42 x i8] c" 107 domain with Wff s normalized\0A\00"
@.str.15 = [46 x i8] c" 108 domain with NOT conds translated\0A\00"
@.str.16 = [29 x i8] c" 109 splitted domain\0A\00"
@.str.17 = [36 x i8] c" 110 cleaned up easy domain\0A\00"
@.str.18 = [41 x i8] c" 111 unaries encoded easy domain\0A\00"
@.str.19 = [44 x i8] c" 112 effects multiplied easy domain\0A\00"
@.str.20 = [41 x i8] c" 113 inertia removed easy domain\0A\00"
@.str.21 = [35 x i8] c" 114 easy action templates\0A\00"
@.str.22 = [51 x i8] c" 115 cleaned up hard domain representation\0A\00"
@.str.23 = [46 x i8] c" 116 mixed hard domain representation\0A\00"
@.str.24 = [46 x i8] c" 117 final hard domain representation\0A\00"
@.str.25 = [43 x i8] c" 118 reachability analysis results\0A\00"
@.str.26 = [40 x i8] c" 119 facts selected as relevant\0A\00"
@.str.27 = [54 x i8] c" 120 final domain and problem representations\0A\00"
@.str.28 = [32 x i8] c" 121 connectivity graph\0A\00"
@.str.29 = [53 x i8] c" 122 fixpoint result on each evaluated state\0A\00"
@.str.30 = [50 x i8] c" 123 1P extracted on each evaluated state\0A\00"
@.str.31 = [54 x i8] c" 124 H set collected for each evaluated state\0A\00"
@.str.32 = [39 x i8] c" 125 False sets of goals <GAM>\0A\00"
@.str.33 = [55 x i8] c" 126 detected ordering constraints leq_h <GAM>\0A\00"
@.str.34 = [35 x i8] c" 127 the Goal Agenda <GAM>\0A\00"
@.str.35 = [35 x i8] c"\0A-d <num> switch on debugging\0A\0A\00"
define void @ff_usage() {
%1 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 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 ([24 x i8], [24 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.8, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.9, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.10, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.11, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.12, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.13, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([42 x i8], [42 x i8]* @.str.14, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.15, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.16, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([36 x i8], [36 x i8]* @.str.17, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.18, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([44 x i8], [44 x i8]* @.str.19, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.20, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.21, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([51 x i8], [51 x i8]* @.str.22, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.23, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.24, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.25, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.26, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.27, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.28, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.29, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.30, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([54 x i8], [54 x i8]* @.str.31, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.32, i64 0, i64 0))
%34 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.33, i64 0, i64 0))
%35 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.34, i64 0, i64 0))
%36 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.35, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [14 x i8] c"\0Ausage of ff:\00"
@str.36 = [25 x i8] c"\0AOPTIONS DESCRIPTIONS\0A\00"
@str.37 = [44 x i8] c"-p <str> path for operator and fact file\00"
@str.38 = [31 x i8] c"-o <str> operator file name\00"
@str.39 = [28 x i8] c"-f <str> fact file name\0A\00"
@str.40 = [52 x i8] c"-i <num> run-time information level( preset: 1 )\00"
@str.41 = [23 x i8] c" 0 only times\00"
@str.42 = [49 x i8] c" 1 problem name, planning process infos\00"
@str.43 = [32 x i8] c" 101 parsed problem data\00"
@str.44 = [35 x i8] c" 102 cleaned up ADL problem\00"
@str.45 = [36 x i8] c" 103 collected string tables\00"
@str.46 = [27 x i8] c" 104 encoded domain\00"
@str.47 = [36 x i8] c" 105 predicates inertia info\00"
@str.48 = [35 x i8] c" 106 splitted initial state\00"
@str.49 = [41 x i8] c" 107 domain with Wff s normalized\00"
@str.50 = [45 x i8] c" 108 domain with NOT conds translated\00"
@str.51 = [28 x i8] c" 109 splitted domain\00"
@str.52 = [35 x i8] c" 110 cleaned up easy domain\00"
@str.53 = [40 x i8] c" 111 unaries encoded easy domain\00"
@str.54 = [43 x i8] c" 112 effects multiplied easy domain\00"
@str.55 = [40 x i8] c" 113 inertia removed easy domain\00"
@str.56 = [34 x i8] c" 114 easy action templates\00"
@str.57 = [50 x i8] c" 115 cleaned up hard domain representation\00"
@str.58 = [45 x i8] c" 116 mixed hard domain representation\00"
@str.59 = [45 x i8] c" 117 final hard domain representation\00"
@str.60 = [42 x i8] c" 118 reachability analysis results\00"
@str.61 = [39 x i8] c" 119 facts selected as relevant\00"
@str.62 = [53 x i8] c" 120 final domain and problem representations\00"
@str.63 = [31 x i8] c" 121 connectivity graph\00"
@str.64 = [52 x i8] c" 122 fixpoint result on each evaluated state\00"
@str.65 = [49 x i8] c" 123 1P extracted on each evaluated state\00"
@str.66 = [53 x i8] c" 124 H set collected for each evaluated state\00"
@str.67 = [38 x i8] c" 125 False sets of goals <GAM>\00"
@str.68 = [54 x i8] c" 126 detected ordering constraints leq_h <GAM>\00"
@str.69 = [34 x i8] c" 127 the Goal Agenda <GAM>\00"
@str.70 = [34 x i8] c"\0A-d <num> switch on debugging\0A\00"
define void @ff_usage() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.36, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.37, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.38, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.39, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.40, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.41, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.42, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.43, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.44, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.45, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.46, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.47, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.48, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([41 x i8], [41 x i8]* @str.49, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.50, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.51, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([35 x i8], [35 x i8]* @str.52, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.53, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([43 x i8], [43 x i8]* @str.54, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.55, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.56, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([50 x i8], [50 x i8]* @str.57, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.58, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.59, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @str.60, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.61, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @str.62, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.63, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.64, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.65, i64 0, i64 0))
%32 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([53 x i8], [53 x i8]* @str.66, i64 0, i64 0))
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([38 x i8], [38 x i8]* @str.67, i64 0, i64 0))
%34 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.68, i64 0, i64 0))
%35 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.69, i64 0, i64 0))
%36 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.70, i64 0, i64 0))
ret void
}