int main(void)
{
int l1 ;
int A[6] ;
int __retres3 ;
{
__globinit_array_symbolic();
__CrestCall(1, 1);
#line 9
__CrestInt(& l1);
__CrestLoad(2, (unsigned long )0, (long long )0);
__CrestStore(3, (unsigned long )(& A[0]));
#line 19
A[0] = 0;
__CrestLoad(4, (unsigned long )0, (long long )1);
__CrestStore(5, (unsigned long )(& A[1]));
#line 19
A[1] = 1;
__CrestLoad(6, (unsigned long )0, (long long )2);
__CrestStore(7, (unsigned long )(& A[2]));
#line 19
A[2] = 2;
__CrestLoad(8, (unsigned long )0, (long long )3);
__CrestStore(9, (unsigned long )(& A[3]));
#line 19
A[3] = 3;
__CrestLoad(10, (unsigned long )0, (long long )4);
__CrestStore(11, (unsigned long )(& A[4]));
#line 19
A[4] = 4;
__CrestLoad(12, (unsigned long )0, (long long )5);
__CrestStore(13, (unsigned long )(& A[5]));
#line 19
A[5] = 5;
__CrestLoad(16, (unsigned long )(& l1), (long long )l1);
__CrestLoad(15, (unsigned long )0, (long long )5);
__CrestApply2(14, 16, (long long )(l1 < 5));
__CrestSolve(17, 3, 6);
#line 20
if (l1 < 5) {
__CrestBranch(18, 3, 1);
{
__CrestLoad(22, (unsigned long )(& A[l1]), (long long )A[l1]);
__CrestLoad(21, (unsigned long )0, (long long )3);
__CrestApply2(20, 12, (long long )(A[l1] == 3));
__CrestSolve(23, 4, 5);
#line 21
if (A[l1] == 3) {
__CrestBranch(24, 4, 1);
#line 22
printf((char const * __restrict )"Bazinga\n");
__CrestClearStack(26);
} else {
__CrestBranch(25, 5, 0);
#line 24
printf((char const * __restrict )"Badumtss");
__CrestClearStack(27);
}
}
int main(void)
{
int side1 ;
int side2 ;
int side3 ;
int triang ;
int __retres5 ;
{
__globinit_triangle();
__CrestCall(5, 3);
#line 7
__CrestInt(& side1);
#line 8
__CrestInt(& side2);
#line 9
__CrestInt(& side3);
__CrestLoad(8, (unsigned long )(& side1), (long long )side1);
__CrestLoad(7, (unsigned long )0, (long long )0);
__CrestApply2(6, 16, (long long )(side1 < 0));
#line 12
if (side1 < 0) {
__CrestBranch(9, 5, 1);
#line 13
printf((char const * __restrict )"Illegal arguments !! \n");
__CrestClearStack(11);
} else {
int main(void)
{
int a ;
int b ;
int c ;
int d ;
int __retres5 ;
{
__globinit_uniform_test();
__CrestCall(1, 1);
#line 17
__CrestInt(& a);
#line 18
__CrestInt(& b);
#line 19
__CrestInt(& c);
#line 20
__CrestInt(& d);
__CrestLoad(4, (unsigned long )(& a), (long long )a);
__CrestLoad(3, (unsigned long )0, (long long )5);
__CrestApply2(2, 12, (long long )(a == 5));
#line 21
if (a == 5) {
__CrestBranch(5, 3, 1);
{
__CrestLoad(9, (unsigned long )(& b), (long long )b);
__CrestLoad(8, (unsigned long )0, (long long )19);
__CrestApply2(7, 12, (long long )(b == 19));
#line 22
if (b == 19) {
__CrestBranch(10, 4, 1);
{
__CrestLoad(14, (unsigned long )(& c), (long long )c);
__CrestLoad(13, (unsigned long )0, (long long )7);
__CrestApply2(12, 12, (long long )(c == 7));
#line 23
if (c == 7) {
__CrestBranch(15, 5, 1);
{
__CrestLoad(19, (unsigned long )(& d), (long long )d);
__CrestLoad(18, (unsigned long )0, (long long )4);
__CrestApply2(17, 12, (long long )(d == 4));
#line 24
if (d == 4) {
__CrestBranch(20, 6, 1);
#line 25
fprintf((FILE * __restrict )stderr, (char const * __restrict )"GOAL!\n");
__CrestClearStack(22);
} else {
__CrestBranch(21, 7, 0);
}
}
} else {
int main(void)
{
int n ;
int i ;
int a[50] ;
int __retres4 ;
{
__globinit_heapsort();
__CrestCall(1, 1);
#line 31
printf((char const * __restrict )"\nEnter the limit:");
__CrestClearStack(2);
#line 33
printf((char const * __restrict )"\nEnter the elements:");
__CrestClearStack(3);
__CrestLoad(4, (unsigned long )0, (long long )0);
__CrestStore(5, (unsigned long )(& i));
#line 34
i = 0;
__CrestLoad(8, (unsigned long )(& i), (long long )i);
__CrestLoad(7, (unsigned long )(& n), (long long )n);
__CrestApply2(6, 16, (long long )(i < n));
if (i < n) {
__CrestBranch(9, 4, 1);
__CrestLoad(11, (unsigned long )(& n), (long long )n);
heapSort(a, n);
__CrestClearStack(12);
__CrestLoad(15, (unsigned long )(& i), (long long )i);
__CrestLoad(14, (unsigned long )0, (long long )1);
__CrestApply2(13, 0, (long long )(i + 1));
__CrestStore(16, (unsigned long )(& i));
i ++;
} else {
__CrestBranch(10, 5, 0);
}
__CrestLoad(19, (unsigned long )(& i), (long long )i);
__CrestLoad(18, (unsigned long )(& n), (long long )n);
__CrestApply2(17, 16, (long long )(i < n));
if (i < n) {
__CrestBranch(20, 7, 1);
__CrestLoad(22, (unsigned long )(& n), (long long )n);
heapSort(a, n);
__CrestClearStack(23);
__CrestLoad(26, (unsigned long )(& i), (long long )i);
__CrestLoad(25, (unsigned long )0, (long long )1);
__CrestApply2(24, 0, (long long )(i + 1));
__CrestStore(27, (unsigned long )(& i));
i ++;
} else {
__CrestBranch(21, 8, 0);
}
#line 38
printf((char const * __restrict )"\nThe Sorted Elements Are:\n");
__CrestClearStack(28);
__CrestLoad(29, (unsigned long )0, (long long )0);
__CrestStore(30, (unsigned long )(& i));
#line 39
i = 0;
__CrestLoad(33, (unsigned long )(& i), (long long )i);
__CrestLoad(32, (unsigned long )(& n), (long long )n);
__CrestApply2(31, 16, (long long )(i < n));
if (i < n) {
__CrestBranch(34, 12, 1);
__CrestLoad(36, (unsigned long )(& a[i]), (long long )a[i]);
printf((char const * __restrict )"\t%d", a[i]);
__CrestClearStack(37);
__CrestLoad(40, (unsigned long )(& i), (long long )i);
__CrestLoad(39, (unsigned long )0, (long long )1);
__CrestApply2(38, 0, (long long )(i + 1));
__CrestStore(41, (unsigned long )(& i));
i ++;
} else {
