user: 请从给定的汇编指令推导出C源代码:

```asm
<main>:
  endbr64
  push   %r14
  mov    $0x7,%edx
  mov    $0x9,%esi
  push   %r13
  movabs $0xa00000009,%r13
  push   %r12
  movabs $0x600000003,%r12
  push   %rbp
  movabs $0x200000001,%rbp
  push   %rbx
  movabs $0x800000007,%rbx
  sub    $0x120,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0x118(%rsp)
  xor    %eax,%eax
  mov    %rsp,%r14
  mov    %rbp,(%rsp)
  mov    %r14,%rdi
  mov    %r12,0x8(%rsp)
  mov    %r13,0x18(%rsp)
  mov    %rbx,0x10(%rsp)
  movl   $0xb,0x20(%rsp)
  call   <linear_search_for_num@plt>
  xor    %edi,%edi
  cmp    $0x4,%eax
  sete   %dil
  call   <assert@plt>
  mov    $0x7,%edx
  mov    $0x9,%esi
  mov    %r14,%rdi
  call   <binary_search_for_num@plt>
  xor    %edi,%edi
  cmp    $0x4,%eax
  sete   %dil
  call   <assert@plt>
  mov    %r13,0x48(%rsp)
  lea    0x30(%rsp),%r13
  mov    $0xb,%edx
  mov    $0x9,%esi
  mov    %r13,%rdi
  mov    %rbp,0x30(%rsp)
  mov    %r12,0x38(%rsp)
  mov    %rbx,0x40(%rsp)
  movl   $0xb,0x50(%rsp)
  call   <linear_search_for_num@plt>
  xor    %edi,%edi
  cmp    $0x8,%eax
  sete   %dil
  call   <assert@plt>
  mov    $0xb,%edx
  mov    $0x9,%esi
  mov    %r13,%rdi
  call   <binary_search_for_num@plt>
  xor    %edi,%edi
  lea    0x60(%rsp),%r13
  cmp    $0x8,%eax
  sete   %dil
  call   <assert@plt>
  mov    $0x1,%edx
  mov    $0x9,%esi
  movabs $0x1400000009,%rax
  mov    %r13,%rdi
  mov    %rbp,0x60(%rsp)
  mov    %r12,0x68(%rsp)
  mov    %rbx,0x70(%rsp)
  mov    %rax,0x78(%rsp)
  movl   $0x16,0x80(%rsp)
  call   <linear_search_for_num@plt>
  xor    %edi,%edi
  test   %eax,%eax
  sete   %dil
  call   <assert@plt>
  mov    $0x1,%edx
  mov    $0x9,%esi
  mov    %r13,%rdi
  call   <binary_search_for_num@plt>
  xor    %edi,%edi
  test   %eax,%eax
  sete   %dil
  call   <assert@plt>
  mov    $0x22,%edx
  mov    %r12,0x98(%rsp)
  lea    0x90(%rsp),%r12
  mov    $0x9,%esi
  mov    %r12,%rdi
  movabs $0x1e00000009,%rax
  mov    %rbp,0x90(%rsp)
  mov    %rbx,0xa0(%rsp)
  mov    %rax,0xa8(%rsp)
  movl   $0x21,0xb0(%rsp)
  call   <linear_search_for_num@plt>
  xor    %edi,%edi
  cmp    $0xffffffff,%eax
  sete   %dil
  call   <assert@plt>
  mov    $0x22,%edx
  mov    $0x9,%esi
  mov    %r12,%rdi
  call   <binary_search_for_num@plt>
  xor    %edi,%edi
  cmp    $0xffffffff,%eax
  sete   %dil
  call   <assert@plt>
  mov    %rbp,0xc0(%rsp)
  xor    %edx,%edx
  lea    0xc0(%rsp),%rbp
  mov    $0x9,%esi
  mov    %rbp,%rdi
  movabs $0x600000004,%rax
  mov    %rbx,0xd0(%rsp)
  mov    %rax,0xc8(%rsp)
  movabs $0x2800000009,%rax
  mov    %rax,0xd8(%rsp)
  movl   $0x2c,0xe0(%rsp)
  call   <linear_search_for_num@plt>
  xor    %edi,%edi
  cmp    $0xffffffff,%eax
  sete   %dil
  call   <assert@plt>
  xor    %edx,%edx
  mov    $0x9,%esi
  mov    %rbp,%rdi
  call   <binary_search_for_num@plt>
  xor    %edi,%edi
  lea    0xf0(%rsp),%rbp
  cmp    $0xffffffff,%eax
  sete   %dil
  call   <assert@plt>
  mov    $0x2,%edx
  mov    %rbp,%rdi
  movabs $0x300000001,%rax
  mov    %rax,0xf0(%rsp)
  mov    $0x9,%esi
  movabs $0x600000005,%rax
  mov    %rax,0xf8(%rsp)
  movabs $0x3200000009,%rax
  mov    %rbx,0x100(%rsp)
  mov    %rax,0x108(%rsp)
  movl   $0x37,0x110(%rsp)
  call   <linear_search_for_num@plt>
  xor    %edi,%edi
  cmp    $0xffffffff,%eax
  sete   %dil
  call   <assert@plt>
  mov    %rbp,%rdi
  mov    $0x2,%edx
  mov    $0x9,%esi
  call   <binary_search_for_num@plt>
  xor    %edi,%edi
  cmp    $0xffffffff,%eax
  sete   %dil
  call   <assert@plt>
  mov    0x118(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L5
  add    $0x120,%rsp
  xor    %eax,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  ret
L5:
  call   <__stack_chk_fail@plt>
```

assistant: ```c
int main() {
  int array0[] = {1, 2, 3, 6, 7, 8, 9, 10, 11};
  int len0 = sizeof(array0) / sizeof(int);
  int num0 = 7;
  int exp_index0 = 4;
  assert(exp_index0 == linear_search_for_num(array0, len0, num0));
  assert(exp_index0 == binary_search_for_num(array0, len0, num0));
  int array1[] = {1, 2, 3, 6, 7, 8, 9, 10, 11};
  int len1 = sizeof(array1) / sizeof(int);
  int num1 = 11;
  int exp_index1 = 8;
  assert(exp_index1 == linear_search_for_num(array1, len1, num1));
  assert(exp_index1 == binary_search_for_num(array1, len1, num1));
  int array2[] = {1, 2, 3, 6, 7, 8, 9, 20, 22};
  int len2 = sizeof(array2) / sizeof(int);
  int num2 = 1;
  int exp_index2 = 0;
  assert(exp_index2 == linear_search_for_num(array2, len2, num2));
  assert(exp_index2 == binary_search_for_num(array2, len2, num2));
  int array3[] = {1, 2, 3, 6, 7, 8, 9, 30, 33};
  int len3 = sizeof(array3) / sizeof(int);
  int num3 = array3[len3 - 1] + 1;
  int exp_index3 = -1;
  assert(exp_index3 == linear_search_for_num(array3, len3, num3));
  assert(exp_index3 == binary_search_for_num(array3, len3, num3));
  int array4[] = {1, 2, 4, 6, 7, 8, 9, 40, 44};
  int len4 = sizeof(array4) / sizeof(int);
  int num4 = array4[0] - 1;
  int exp_index4 = -1;
  assert(exp_index4 == linear_search_for_num(array4, len4, num4));
  assert(exp_index4 == binary_search_for_num(array4, len4, num4));
  int array5[] = {1, 3, 5, 6, 7, 8, 9, 50, 55};
  int len5 = sizeof(array5) / sizeof(int);
  int num5 = array5[0] + 1;
  int exp_index5 = -1;
  assert(exp_index5 == linear_search_for_num(array5, len5, num5));
  assert(exp_index5 == binary_search_for_num(array5, len5, num5));
  return (0);
}
```