/* Initialize the Red Black Tree header */ struct rbt *rbt_init(){ struct rbt *tree = malloc(sizeof(struct rbt)); tree->nil = create_nil(); tree->root = tree->nil; tree->first = tree->nil; return tree; }
int main() //@ : main //@ requires true; //@ ensures true; //@ terminates; { //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); //@ produce_call_below_perm_(); //@ call_below_perm__elim(main); void *l = create_nil(); l = create_cons(3, l); l = create_cons(2, l); l = create_cons(1, l); list_object_contains(l, 2); //@ split_fraction list_object(l, _, _, _, _); list_object_intersects(l, l); void *l2 = create_nil(); l2 = create_cons(2, l2); l2 = create_cons(4, l2); list_object_intersects(l, l2); //@ leak list_object(l, _, _, _, _); //@ leak list_object(l2, _, _, _, _); return 0; }