#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*/ clrscr();
int find_difference(int *, int *, int *, int, int);
int find_intersection(int *, int *, int *, int);
int find_union(int *, int *, int *, int, int);
int /*<<< orphan*/ free(int *);
int /*<<< orphan*/ function_sort(int *, int);
int /*<<< orphan*/ get_value(int *, int);
int /*<<< orphan*/ getch();
scalar_t__ malloc(int);
int /*<<< orphan*/ print_value(int *, int);
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ scanf(char *, int *);
int main() {
  int *setA, *setB, *intersection, *_union, num_elements, *AminusB, *BminusA,
      SIZE1, SIZE2;
  clrscr();
  printf("Enter size the size for set A : ");
  scanf("%d", &SIZE1);
  setA = (int *)malloc(SIZE1 * sizeof(int));
  printf("Enter the elements of set A :\n");
  get_value(setA, SIZE1);
  function_sort(setA, SIZE1);
  printf("\nEnter size the size for set B : ");
  scanf("%d", &SIZE2);
  setB = (int *)malloc(SIZE2 * sizeof(int));
  printf("Enter the elements of set B :\n");
  get_value(setB, SIZE2);
  function_sort(setB, SIZE2);
  printf("\nSet A\t\t: ");
  print_value(setA, SIZE1);
  printf("\nSet B\t\t: ");
  print_value(setB, SIZE2);
  intersection =
      (int *)malloc(((SIZE1 >= SIZE2) ? SIZE2 : SIZE1) * sizeof(int));
  num_elements = find_intersection(setA, setB, intersection,
                                   (SIZE1 >= SIZE2) ? SIZE2 : SIZE1);
  printf("\nIntersection\t: ");
  print_value(intersection, num_elements);
  _union = (int *)malloc((SIZE1 + SIZE2) * sizeof(int));
  num_elements = find_union(setA, setB, _union, SIZE1, SIZE2);
  printf("\nUnion\t\t: ");
  print_value(_union, num_elements);
  AminusB = (int *)malloc(SIZE1 * sizeof(int));
  num_elements = find_difference(setA, setB, AminusB, SIZE1, SIZE2);
  printf("\nDifference (A-B): ");
  print_value(AminusB, num_elements);
  BminusA = (int *)malloc(SIZE2 * sizeof(int));
  num_elements = find_difference(setB, setA, BminusA, SIZE2, SIZE1);
  printf("\nDifference (B-A): ");
  print_value(BminusA, num_elements);
  free(BminusA);
  free(AminusB);
  free(_union);
  free(intersection);
  free(setB);
  free(setA);
  getch();
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x70,%rsp
movl   $0x0,-0x4(%rbp)
mov    $0x0,%al
call   1050 <clrscr@plt>
lea    0xe23(%rip),%rdi
call   1070 <printf@plt>
lea    0xe38(%rip),%rdi
lea    -0x44(%rbp),%rsi
call   10c0 <scanf@plt>
movslq -0x44(%rbp),%rax
shl    $0x2,%rax
mov    %eax,%edi
call   1090 <malloc@plt>
mov    %rax,-0x10(%rbp)
lea    0xe18(%rip),%rdi
call   1070 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x44(%rbp),%esi
call   10a0 <get_value@plt>
mov    -0x10(%rbp),%rdi
mov    -0x44(%rbp),%esi
call   1040 <function_sort@plt>
lea    0xe13(%rip),%rdi
call   1070 <printf@plt>
lea    0xde5(%rip),%rdi
lea    -0x48(%rbp),%rsi
call   10c0 <scanf@plt>
movslq -0x48(%rbp),%rax
shl    $0x2,%rax
mov    %eax,%edi
call   1090 <malloc@plt>
mov    %rax,-0x18(%rbp)
lea    0xe06(%rip),%rdi
call   1070 <printf@plt>
mov    -0x18(%rbp),%rdi
mov    -0x48(%rbp),%esi
call   10a0 <get_value@plt>
mov    -0x18(%rbp),%rdi
mov    -0x48(%rbp),%esi
call   1040 <function_sort@plt>
lea    0xe01(%rip),%rdi
call   1070 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    -0x44(%rbp),%esi
call   1060 <print_value@plt>
lea    0xdf4(%rip),%rdi
call   1070 <printf@plt>
mov    -0x18(%rbp),%rdi
mov    -0x48(%rbp),%esi
call   1060 <print_value@plt>
mov    -0x44(%rbp),%eax
cmp    -0x48(%rbp),%eax
jl     12c3 <main+0x103>
mov    -0x48(%rbp),%eax
mov    %eax,-0x4c(%rbp)
jmp    12c9 <main+0x109>
mov    -0x44(%rbp),%eax
mov    %eax,-0x4c(%rbp)
mov    -0x4c(%rbp),%eax
cltq
shl    $0x2,%rax
mov    %eax,%edi
call   1090 <malloc@plt>
mov    %rax,-0x20(%rbp)
mov    -0x10(%rbp),%rax
mov    %rax,-0x68(%rbp)
mov    -0x18(%rbp),%rax
mov    %rax,-0x60(%rbp)
mov    -0x20(%rbp),%rax
mov    %rax,-0x58(%rbp)
mov    -0x44(%rbp),%eax
cmp    -0x48(%rbp),%eax
jl     130c <main+0x14c>
mov    -0x48(%rbp),%eax
mov    %eax,-0x6c(%rbp)
jmp    1312 <main+0x152>
mov    -0x44(%rbp),%eax
mov    %eax,-0x6c(%rbp)
mov    -0x58(%rbp),%rdx
mov    -0x60(%rbp),%rsi
mov    -0x68(%rbp),%rdi
mov    -0x6c(%rbp),%ecx
call   10b0 <find_intersection@plt>
mov    %eax,-0x2c(%rbp)
lea    0xd6a(%rip),%rdi
call   1070 <printf@plt>
mov    -0x20(%rbp),%rdi
mov    -0x2c(%rbp),%esi
call   1060 <print_value@plt>
mov    -0x44(%rbp),%eax
add    -0x48(%rbp),%eax
cltq
shl    $0x2,%rax
mov    %eax,%edi
call   1090 <malloc@plt>
mov    %rax,-0x28(%rbp)
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rsi
mov    -0x28(%rbp),%rdx
mov    -0x44(%rbp),%ecx
mov    -0x48(%rbp),%r8d
call   1080 <find_union@plt>
mov    %eax,-0x2c(%rbp)
lea    0xd31(%rip),%rdi
call   1070 <printf@plt>
mov    -0x28(%rbp),%rdi
mov    -0x2c(%rbp),%esi
call   1060 <print_value@plt>
movslq -0x44(%rbp),%rax
shl    $0x2,%rax
mov    %eax,%edi
call   1090 <malloc@plt>
mov    %rax,-0x38(%rbp)
mov    -0x10(%rbp),%rdi
mov    -0x18(%rbp),%rsi
mov    -0x38(%rbp),%rdx
mov    -0x44(%rbp),%ecx
mov    -0x48(%rbp),%r8d
call   10e0 <find_difference@plt>
mov    %eax,-0x2c(%rbp)
lea    0xcf6(%rip),%rdi
call   1070 <printf@plt>
mov    -0x38(%rbp),%rdi
mov    -0x2c(%rbp),%esi
call   1060 <print_value@plt>
movslq -0x48(%rbp),%rax
shl    $0x2,%rax
mov    %eax,%edi
call   1090 <malloc@plt>
mov    %rax,-0x40(%rbp)
mov    -0x18(%rbp),%rdi
mov    -0x10(%rbp),%rsi
mov    -0x40(%rbp),%rdx
mov    -0x48(%rbp),%ecx
mov    -0x44(%rbp),%r8d
call   10e0 <find_difference@plt>
mov    %eax,-0x2c(%rbp)
lea    0xcc4(%rip),%rdi
call   1070 <printf@plt>
mov    -0x40(%rbp),%rdi
mov    -0x2c(%rbp),%esi
call   1060 <print_value@plt>
mov    -0x40(%rbp),%rdi
call   1030 <free@plt>
mov    -0x38(%rbp),%rdi
call   1030 <free@plt>
mov    -0x28(%rbp),%rdi
call   1030 <free@plt>
mov    -0x20(%rbp),%rdi
call   1030 <free@plt>
mov    -0x18(%rbp),%rdi
call   1030 <free@plt>
mov    -0x10(%rbp),%rdi
call   1030 <free@plt>
mov    $0x0,%al
call   10d0 <getch@plt>
xor    %eax,%eax
add    $0x70,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbp
push   %r15
push   %r14
push   %r13
push   %r12
push   %rbx
sub    $0x18,%rsp
xor    %eax,%eax
call   1050 <clrscr@plt>
lea    0xe14(%rip),%rdi
call   1080 <printf@plt>
lea    0xe29(%rip),%rbx
lea    0xc(%rsp),%rsi
mov    %rbx,%rdi
call   10d0 <scanf@plt>
mov    0xc(%rsp),%edi
shl    $0x2,%edi
call   10a0 <malloc@plt>
mov    %rax,%r14
lea    0xe85(%rip),%rdi
call   1060 <puts@plt>
mov    0xc(%rsp),%esi
mov    %r14,%rdi
call   10b0 <get_value@plt>
mov    0xc(%rsp),%esi
mov    %r14,%rdi
call   1040 <function_sort@plt>
lea    0xde5(%rip),%rdi
call   1080 <printf@plt>
lea    0x8(%rsp),%rsi
mov    %rbx,%rdi
call   10d0 <scanf@plt>
mov    0x8(%rsp),%edi
shl    $0x2,%edi
call   10a0 <malloc@plt>
mov    %rax,%r13
lea    0xe57(%rip),%rdi
call   1060 <puts@plt>
mov    0x8(%rsp),%esi
mov    %r13,%rdi
call   10b0 <get_value@plt>
mov    0x8(%rsp),%esi
mov    %r13,%rdi
call   1040 <function_sort@plt>
lea    0xdbb(%rip),%rdi
call   1080 <printf@plt>
mov    0xc(%rsp),%esi
mov    %r14,%rdi
call   1070 <print_value@plt>
lea    0xdae(%rip),%rdi
call   1080 <printf@plt>
mov    0x8(%rsp),%esi
mov    %r13,%rdi
call   1070 <print_value@plt>
mov    0xc(%rsp),%eax
mov    0x8(%rsp),%edi
cmp    %edi,%eax
cmovl  %eax,%edi
shl    $0x2,%edi
call   10a0 <malloc@plt>
mov    %rax,%rbp
mov    %rax,0x10(%rsp)
mov    0xc(%rsp),%eax
mov    0x8(%rsp),%ecx
cmp    %ecx,%eax
cmovl  %eax,%ecx
mov    %r14,%rdi
mov    %r13,%rsi
mov    %rbp,%rdx
call   10c0 <find_intersection@plt>
mov    %eax,%ebx
lea    0xd67(%rip),%rdi
call   1080 <printf@plt>
mov    %rbp,%rdi
mov    %ebx,%esi
call   1070 <print_value@plt>
mov    0x8(%rsp),%edi
add    0xc(%rsp),%edi
shl    $0x2,%edi
call   10a0 <malloc@plt>
mov    %rax,%r12
mov    0xc(%rsp),%ecx
mov    0x8(%rsp),%r8d
mov    %r14,%rdi
mov    %r13,%rsi
mov    %rax,%rdx
call   1090 <find_union@plt>
mov    %eax,%ebx
lea    0xd36(%rip),%rdi
call   1080 <printf@plt>
mov    %r12,%rdi
mov    %ebx,%esi
call   1070 <print_value@plt>
mov    0xc(%rsp),%edi
shl    $0x2,%edi
call   10a0 <malloc@plt>
mov    %rax,%rbx
mov    0xc(%rsp),%ecx
mov    0x8(%rsp),%r8d
mov    %r14,%rdi
mov    %r13,%rsi
mov    %rax,%rdx
call   10f0 <find_difference@plt>
mov    %eax,%ebp
lea    0xd03(%rip),%rdi
call   1080 <printf@plt>
mov    %rbx,%rdi
mov    %ebp,%esi
call   1070 <print_value@plt>
mov    0x8(%rsp),%edi
shl    $0x2,%edi
call   10a0 <malloc@plt>
mov    %rax,%rbp
mov    0x8(%rsp),%ecx
mov    0xc(%rsp),%r8d
mov    %r13,%rdi
mov    %r14,%rsi
mov    %rax,%rdx
call   10f0 <find_difference@plt>
mov    %eax,%r15d
lea    0xcd8(%rip),%rdi
call   1080 <printf@plt>
mov    %rbp,%rdi
mov    %r15d,%esi
call   1070 <print_value@plt>
mov    %rbp,%rdi
call   1030 <free@plt>
mov    %rbx,%rdi
call   1030 <free@plt>
mov    %r12,%rdi
call   1030 <free@plt>
mov    0x10(%rsp),%rdi
call   1030 <free@plt>
mov    %r13,%rdi
call   1030 <free@plt>
mov    %r14,%rdi
call   1030 <free@plt>
xor    %eax,%eax
call   10e0 <getch@plt>
xor    %eax,%eax
add    $0x18,%rsp
pop    %rbx
pop    %r12
pop    %r13
pop    %r14
pop    %r15
pop    %rbp
ret

LLVM IR (-O0):
@.str = [33 x i8] c"Enter size the size for set A : \00"
@.str.1 = [3 x i8] c"%d\00"
@.str.2 = [31 x i8] c"Enter the elements of set A :\0A\00"
@.str.3 = [34 x i8] c"\0AEnter size the size for set B : \00"
@.str.4 = [31 x i8] c"Enter the elements of set B :\0A\00"
@.str.5 = [11 x i8] c"\0ASet A\09\09: \00"
@.str.6 = [11 x i8] c"\0ASet B\09\09: \00"
@.str.7 = [17 x i8] c"\0AIntersection\09: \00"
@.str.8 = [11 x i8] c"\0AUnion\09\09: \00"
@.str.9 = [20 x i8] c"\0ADifference (A-B): \00"
@.str.10 = [20 x i8] c"\0ADifference (B-A): \00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32*
%3 = alloca i32*
%4 = alloca i32*
%5 = alloca i32*
%6 = alloca i32
%7 = alloca i32*
%8 = alloca i32*
%9 = alloca i32
%10 = alloca i32
store i32 0, i32* %1
%11 = call i32 (...) @clrscr()
%12 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str, i64 0, i64 0))
%13 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %9)
%14 = load i32, i32* %9
%15 = sext i32 %14 to i64
%16 = mul i64 %15, 4
%17 = trunc i64 %16 to i32
%18 = call i64 @malloc(i32 %17)
%19 = inttoptr i64 %18 to i32*
store i32* %19, i32** %2
%20 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.2, i64 0, i64 0))
%21 = load i32*, i32** %2
%22 = load i32, i32* %9
%23 = call i32 @get_value(i32* %21, i32 %22)
%24 = load i32*, i32** %2
%25 = load i32, i32* %9
%26 = call i32 @function_sort(i32* %24, i32 %25)
%27 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.3, i64 0, i64 0))
%28 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %10)
%29 = load i32, i32* %10
%30 = sext i32 %29 to i64
%31 = mul i64 %30, 4
%32 = trunc i64 %31 to i32
%33 = call i64 @malloc(i32 %32)
%34 = inttoptr i64 %33 to i32*
store i32* %34, i32** %3
%35 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.4, i64 0, i64 0))
%36 = load i32*, i32** %3
%37 = load i32, i32* %10
%38 = call i32 @get_value(i32* %36, i32 %37)
%39 = load i32*, i32** %3
%40 = load i32, i32* %10
%41 = call i32 @function_sort(i32* %39, i32 %40)
%42 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.5, i64 0, i64 0))
%43 = load i32*, i32** %2
%44 = load i32, i32* %9
%45 = call i32 @print_value(i32* %43, i32 %44)
%46 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.6, i64 0, i64 0))
%47 = load i32*, i32** %3
%48 = load i32, i32* %10
%49 = call i32 @print_value(i32* %47, i32 %48)
%50 = load i32, i32* %9
%51 = load i32, i32* %10
%52 = icmp sge i32 %50, %51
br i1 %52, label %53, label %55
53: ; preds = %0
%54 = load i32, i32* %10
br label %57
55: ; preds = %0
%56 = load i32, i32* %9
br label %57
57: ; preds = %55, %53
%58 = phi i32 [ %54, %53 ], [ %56, %55 ]
%59 = sext i32 %58 to i64
%60 = mul i64 %59, 4
%61 = trunc i64 %60 to i32
%62 = call i64 @malloc(i32 %61)
%63 = inttoptr i64 %62 to i32*
store i32* %63, i32** %4
%64 = load i32*, i32** %2
%65 = load i32*, i32** %3
%66 = load i32*, i32** %4
%67 = load i32, i32* %9
%68 = load i32, i32* %10
%69 = icmp sge i32 %67, %68
br i1 %69, label %70, label %72
70: ; preds = %57
%71 = load i32, i32* %10
br label %74
72: ; preds = %57
%73 = load i32, i32* %9
br label %74
74: ; preds = %72, %70
%75 = phi i32 [ %71, %70 ], [ %73, %72 ]
%76 = call i32 @find_intersection(i32* %64, i32* %65, i32* %66, i32 %75)
store i32 %76, i32* %6
%77 = call i32 @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str.7, i64 0, i64 0))
%78 = load i32*, i32** %4
%79 = load i32, i32* %6
%80 = call i32 @print_value(i32* %78, i32 %79)
%81 = load i32, i32* %9
%82 = load i32, i32* %10
%83 = add nsw i32 %81, %82
%84 = sext i32 %83 to i64
%85 = mul i64 %84, 4
%86 = trunc i64 %85 to i32
%87 = call i64 @malloc(i32 %86)
%88 = inttoptr i64 %87 to i32*
store i32* %88, i32** %5
%89 = load i32*, i32** %2
%90 = load i32*, i32** %3
%91 = load i32*, i32** %5
%92 = load i32, i32* %9
%93 = load i32, i32* %10
%94 = call i32 @find_union(i32* %89, i32* %90, i32* %91, i32 %92, i32 %93)
store i32 %94, i32* %6
%95 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.8, i64 0, i64 0))
%96 = load i32*, i32** %5
%97 = load i32, i32* %6
%98 = call i32 @print_value(i32* %96, i32 %97)
%99 = load i32, i32* %9
%100 = sext i32 %99 to i64
%101 = mul i64 %100, 4
%102 = trunc i64 %101 to i32
%103 = call i64 @malloc(i32 %102)
%104 = inttoptr i64 %103 to i32*
store i32* %104, i32** %7
%105 = load i32*, i32** %2
%106 = load i32*, i32** %3
%107 = load i32*, i32** %7
%108 = load i32, i32* %9
%109 = load i32, i32* %10
%110 = call i32 @find_difference(i32* %105, i32* %106, i32* %107, i32 %108, i32 %109)
store i32 %110, i32* %6
%111 = call i32 @printf(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @.str.9, i64 0, i64 0))
%112 = load i32*, i32** %7
%113 = load i32, i32* %6
%114 = call i32 @print_value(i32* %112, i32 %113)
%115 = load i32, i32* %10
%116 = sext i32 %115 to i64
%117 = mul i64 %116, 4
%118 = trunc i64 %117 to i32
%119 = call i64 @malloc(i32 %118)
%120 = inttoptr i64 %119 to i32*
store i32* %120, i32** %8
%121 = load i32*, i32** %3
%122 = load i32*, i32** %2
%123 = load i32*, i32** %8
%124 = load i32, i32* %10
%125 = load i32, i32* %9
%126 = call i32 @find_difference(i32* %121, i32* %122, i32* %123, i32 %124, i32 %125)
store i32 %126, i32* %6
%127 = call i32 @printf(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @.str.10, i64 0, i64 0))
%128 = load i32*, i32** %8
%129 = load i32, i32* %6
%130 = call i32 @print_value(i32* %128, i32 %129)
%131 = load i32*, i32** %8
%132 = call i32 @free(i32* %131)
%133 = load i32*, i32** %7
%134 = call i32 @free(i32* %133)
%135 = load i32*, i32** %5
%136 = call i32 @free(i32* %135)
%137 = load i32*, i32** %4
%138 = call i32 @free(i32* %137)
%139 = load i32*, i32** %3
%140 = call i32 @free(i32* %139)
%141 = load i32*, i32** %2
%142 = call i32 @free(i32* %141)
%143 = call i32 (...) @getch()
ret i32 0
}

LLVM IR (-O2):
@.str = [33 x i8] c"Enter size the size for set A : \00"
@.str.1 = [3 x i8] c"%d\00"
@.str.3 = [34 x i8] c"\0AEnter size the size for set B : \00"
@.str.5 = [11 x i8] c"\0ASet A\09\09: \00"
@.str.6 = [11 x i8] c"\0ASet B\09\09: \00"
@.str.7 = [17 x i8] c"\0AIntersection\09: \00"
@.str.8 = [11 x i8] c"\0AUnion\09\09: \00"
@.str.9 = [20 x i8] c"\0ADifference (A-B): \00"
@.str.10 = [20 x i8] c"\0ADifference (B-A): \00"
@str = [30 x i8] c"Enter the elements of set A :\00"
@str.11 = [30 x i8] c"Enter the elements of set B :\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32
%3 = bitcast i32* %1 to i8*
%4 = bitcast i32* %2 to i8*
%5 = tail call i32 (...) @clrscr()
%6 = tail call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @.str, i64 0, i64 0))
%7 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %1)
%8 = load i32, i32* %1
%9 = shl i32 %8, 2
%10 = call i64 @malloc(i32 %9)
%11 = inttoptr i64 %10 to i32*
%12 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str, i64 0, i64 0))
%13 = load i32, i32* %1
%14 = call i32 @get_value(i32* %11, i32 %13)
%15 = load i32, i32* %1
%16 = call i32 @function_sort(i32* %11, i32 %15)
%17 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @.str.3, i64 0, i64 0))
%18 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %2)
%19 = load i32, i32* %2
%20 = shl i32 %19, 2
%21 = call i64 @malloc(i32 %20)
%22 = inttoptr i64 %21 to i32*
%23 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str.11, i64 0, i64 0))
%24 = load i32, i32* %2
%25 = call i32 @get_value(i32* %22, i32 %24)
%26 = load i32, i32* %2
%27 = call i32 @function_sort(i32* %22, i32 %26)
%28 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @.str.5, i64 0, i64 0))
%29 = load i32, i32* %1
%30 = call i32 @print_value(i32* %11, i32 %29)
%31 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @.str.6, i64 0, i64 0))
%32 = load i32, i32* %2
%33 = call i32 @print_value(i32* %22, i32 %32)
%34 = load i32, i32* %1
%35 = load i32, i32* %2
%36 = icmp slt i32 %34, %35
%37 = select i1 %36, i32 %34, i32 %35
%38 = shl i32 %37, 2
%39 = call i64 @malloc(i32 %38)
%40 = inttoptr i64 %39 to i32*
%41 = load i32, i32* %1
%42 = load i32, i32* %2
%43 = icmp slt i32 %41, %42
%44 = select i1 %43, i32 %41, i32 %42
%45 = call i32 @find_intersection(i32* %11, i32* %22, i32* %40, i32 %44)
%46 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([17 x i8], [17 x i8]* @.str.7, i64 0, i64 0))
%47 = call i32 @print_value(i32* %40, i32 %45)
%48 = load i32, i32* %1
%49 = load i32, i32* %2
%50 = add nsw i32 %49, %48
%51 = shl i32 %50, 2
%52 = call i64 @malloc(i32 %51)
%53 = inttoptr i64 %52 to i32*
%54 = load i32, i32* %1
%55 = load i32, i32* %2
%56 = call i32 @find_union(i32* %11, i32* %22, i32* %53, i32 %54, i32 %55)
%57 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @.str.8, i64 0, i64 0))
%58 = call i32 @print_value(i32* %53, i32 %56)
%59 = load i32, i32* %1
%60 = shl i32 %59, 2
%61 = call i64 @malloc(i32 %60)
%62 = inttoptr i64 %61 to i32*
%63 = load i32, i32* %1
%64 = load i32, i32* %2
%65 = call i32 @find_difference(i32* %11, i32* %22, i32* %62, i32 %63, i32 %64)
%66 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([20 x i8], [20 x i8]* @.str.9, i64 0, i64 0))
%67 = call i32 @print_value(i32* %62, i32 %65)
%68 = load i32, i32* %2
%69 = shl i32 %68, 2
%70 = call i64 @malloc(i32 %69)
%71 = inttoptr i64 %70 to i32*
%72 = load i32, i32* %2
%73 = load i32, i32* %1
%74 = call i32 @find_difference(i32* %22, i32* %11, i32* %71, i32 %72, i32 %73)
%75 = call i32 @printf(i8* dereferenceable(1) getelementptr inbounds ([20 x i8], [20 x i8]* @.str.10, i64 0, i64 0))
%76 = call i32 @print_value(i32* %71, i32 %74)
%77 = call i32 @free(i32* %71)
%78 = call i32 @free(i32* %62)
%79 = call i32 @free(i32* %53)
%80 = call i32 @free(i32* %40)
%81 = call i32 @free(i32* %22)
%82 = call i32 @free(i32* %11)
%83 = call i32 (...) @getch()
ret i32 0
}