[kernel] Parsing simple_intra_slice.i (no preprocessing) [eva] Analyzing a complete application starting at main [eva] Computing initial state [eva] Initial state computed [eva:initial-state] Values of globals at initialization Unknown ∈ {0} G ∈ {0} S ∈ {0} S1 ∈ {0} S2 ∈ {0} [eva:alarm] simple_intra_slice.i:99: Warning: signed overflow. assert -2147483648 ≤ uninit - 1; [eva] simple_intra_slice.i:98: starting to merge loop iterations [eva:alarm] simple_intra_slice.i:99: Warning: signed overflow. assert -2147483648 ≤ Unknown - 1; [eva:alarm] simple_intra_slice.i:99: Warning: signed overflow. assert Unknown + 1 ≤ 2147483647; [eva:alarm] simple_intra_slice.i:101: Warning: signed overflow. assert -2147483648 ≤ uninit2 - 1; [eva] simple_intra_slice.i:100: starting to merge loop iterations [eva:alarm] simple_intra_slice.i:101: Warning: signed overflow. assert S.a + 1 ≤ 2147483647; [eva:alarm] simple_intra_slice.i:101: Warning: signed overflow. assert -2147483648 ≤ S.a - 1; [eva] computing for function f2 <- main. Called from simple_intra_slice.i:103. [eva] computing for function f1 <- f2 <- main. Called from simple_intra_slice.i:23. [eva] Recording results for f1 [eva] Done for function f1 [eva] Recording results for f2 [eva] Done for function f2 [eva] computing for function f3 <- main. Called from simple_intra_slice.i:104. [eva] Recording results for f3 [eva] Done for function f3 [eva] computing for function f4 <- main. Called from simple_intra_slice.i:105. [eva] Recording results for f4 [eva] Done for function f4 [eva] computing for function f5 <- main. Called from simple_intra_slice.i:106. [eva] Recording results for f5 [eva] Done for function f5 [eva] computing for function f6 <- main. Called from simple_intra_slice.i:107. [eva:alarm] simple_intra_slice.i:71: Warning: signed overflow. assert -2147483648 ≤ 10 * n; [eva:alarm] simple_intra_slice.i:71: Warning: signed overflow. assert 10 * n ≤ 2147483647; [eva] Recording results for f6 [eva] Done for function f6 [eva:alarm] simple_intra_slice.i:107: Warning: signed overflow. assert res + tmp_3 ≤ 2147483647; (tmp_3 from f6(Unknown)) [eva] computing for function f7 <- main. Called from simple_intra_slice.i:108. [eva:alarm] simple_intra_slice.i:79: Warning: signed overflow. assert S.a + 3 ≤ 2147483647; [eva:alarm] simple_intra_slice.i:82: Warning: signed overflow. assert s0.a + 1 ≤ 2147483647; [eva] Recording results for f7 [eva] Done for function f7 [eva] computing for function f8 <- main. Called from simple_intra_slice.i:110. [eva] Recording results for f8 [eva] Done for function f8 [eva] computing for function f8 <- main. Called from simple_intra_slice.i:112. [eva] Recording results for f8 [eva] Done for function f8 [eva] Recording results for main [eva] done for function main [from] Computing for function f1 [from] Done for function f1 [from] Computing for function f2 [from] Done for function f2 [from] Computing for function f3 [from] Done for function f3 [from] Computing for function f4 [from] Done for function f4 [from] Computing for function f5 [from] Done for function f5 [from] Computing for function f6 [from] Done for function f6 [from] Computing for function f7 [from] Done for function f7 [from] Computing for function f8 [from] Done for function f8 [from] Computing for function main [from] Done for function main [from] ====== DEPENDENCIES COMPUTED ====== These dependencies hold at termination for the executions that terminate: [from] Function f1: G FROM x \result FROM y [from] Function f2: G FROM \nothing \result FROM \nothing [from] Function f3: G FROM Unknown; c (and SELF) \result FROM Unknown; c [from] Function f4: G FROM Unknown; c (and SELF) \result FROM Unknown; c [from] Function f5: G FROM Unknown; G; c (and SELF) \result FROM Unknown; c [from] Function f6: \result FROM Unknown; n [from] Function f7: S.a FROM S.a; s0 {.b; .c} FROM S.a; s0 (and SELF) [from] Function f8: S1.a FROM S1.a; S2.a; ps (and SELF) .b FROM S1.b; S2.b; ps (and SELF) S2.a FROM S1.a; S2.a; ps (and SELF) .b FROM S1.b; S2.b; ps (and SELF) [from] Function main: Unknown FROM Unknown (and SELF) G FROM Unknown S.a FROM S {.b; .c} FROM S (and SELF) S1.a FROM Unknown; S1.a; S2.a (and SELF) .b FROM Unknown; S1.b; S2.b (and SELF) S2.a FROM Unknown; S1.a; S2.a (and SELF) .b FROM Unknown; S1.b; S2.b (and SELF) \result FROM Unknown [from] ====== END OF DEPENDENCIES ====== [slicing] initializing slicing ... [pdg] computing for function f1 [pdg] done for function f1 RESULT for f1: {n1}: InCtrl {n2}: VarDecl : x -[a--]-> 3 {n3}: In1 -[a--]-> 2 {n4}: VarDecl : y -[a--]-> 5 {n5}: In2 -[a--]-> 4 {n6}: VarDecl : a {n7}: VarDecl : b {n8}: VarDecl : __retres {n9}: int a = 1; -[-c-]-> 1 -[a--]-> 6 {n10}: int b = 2; -[-c-]-> 1 -[a--]-> 7 {n11}: G = x + a; -[-c-]-> 1 -[--d]-> 2 -[--d]-> 3 -[--d]-> 6 -[--d]-> 9 {n12}: __retres = y + b; -[-c-]-> 1 -[--d]-> 4 -[--d]-> 5 -[--d]-> 7 -[a--]-> 8 -[--d]-> 10 {n13}: return __retres; -[-c-]-> 1 -[--d]-> 8 -[--d]-> 12 {n14}: OutRet -[--d]-> 13 int f1(int x, int y) { int __retres; /* 1 */ int a = 1; /* 2 */ int b = 2; /* 3 */ G = x + a; /* 5 */ __retres = y + b; /* 124 */ return __retres; } Slicing project worklist [default] = [f1_slice_1 = (n:11 ,<[ S ], [---]>)(n:1 ,<[-c-], [---]>)(n:2 ,<[--d], [---]>)(n:3 , <[--d], [---]>)(n:6 ,<[--d], [---]>)(n:9 ,<[--d], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f1_slice_1: (InCtrl: <[-cd], [---]>) (In1: <[--d], [---]>) /**/int f1(/* <[--d], [---]> */ int x, /* <[---], [---]> */ int y) { /* <[---], [---]> */ int __retres; /* <[--d], [---]> */ /* <[--d], [---]> */ int a = 1; /* <[---], [---]> */ /* <[---], [---]> */ int b = 2; /* <[ S ], [---]> */ G = x + a; /* <[---], [---]> */ __retres = y + b; /* <[---], [---]> */ return __retres; } [pdg] computing for function f2 [pdg] done for function f2 RESULT for f2: {n15}: InCtrl {n16}: VarDecl : a {n17}: VarDecl : b {n18}: VarDecl : c {n19}: VarDecl : tmp {n20}: int a = 1; -[-c-]-> 15 -[a--]-> 16 {n21}: int b = a + 1; -[-c-]-> 15 -[--d]-> 16 -[a--]-> 17 -[--d]-> 20 {n22}: int c = 3; -[-c-]-> 15 -[a--]-> 18 {n23}: Call10-InCtrl : tmp = f1(b,c); -[-c-]-> 15 {n24}: Call10-In1 : tmp = f1(b,c); -[-c-]-> 15 -[--d]-> 17 -[--d]-> 21 -[-c-]-> 23 {n25}: Call10-In2 : tmp = f1(b,c); -[-c-]-> 15 -[--d]-> 18 -[--d]-> 22 -[-c-]-> 23 {n26}: Call10-Out(G) : tmp = f1(b,c); -[-c-]-> 15 -[-c-]-> 23 -[--d]-> 24 {n27}: Call10-OutRet : tmp = f1(b,c); -[-c-]-> 15 -[a--]-> 19 -[-c-]-> 23 -[--d]-> 25 {n28}: return tmp; -[-c-]-> 15 -[--d]-> 19 -[--d]-> 27 {n29}: OutRet -[--d]-> 28 int f2(void) { int tmp; /* 7 */ int a = 1; /* 8 */ int b = a + 1; /* 9 */ int c = 3; /* 10 */ tmp = f1(b,c); /* 11 */ return tmp; } Slicing project worklist [default] = [f2_slice_1 = (n:22 ,<[ S ], [---]>)(n:15 ,<[-c-], [---]>)(n:18 ,<[a--], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f2_slice_1: (InCtrl: <[-c-], [---]>) /**/int f2(void) { /* <[---], [---]> */ int tmp; /* <[---], [---]> */ /* <[---], [---]> */ int a = 1; /* <[---], [---]> */ /* <[---], [---]> */ int b = a + 1; /* <[ S ], [---]> */ /* <[a--], [---]> */ int c = 3; /* invisible call */ /* <[---], [---]> */ tmp = f1(b,c); /* <[---], [---]> */ return tmp; } [pdg] computing for function f3 [pdg] done for function f3 RESULT for f3: {n30}: InCtrl {n31}: VarDecl : c -[a--]-> 32 {n32}: In1 -[a--]-> 31 {n33}: VarDecl : a {n34}: VarDecl : b {n35}: VarDecl : x {n36}: int a = 1; -[-c-]-> 30 -[a--]-> 33 {n37}: int b = 2; -[-c-]-> 30 -[a--]-> 34 {n38}: int x = 0; -[-c-]-> 30 -[a--]-> 35 {n39}: c > Unknown -[-c-]-> 30 -[--d]-> 31 -[--d]-> 32 -[--d]-> 44 {n40}: x = b; -[-c-]-> 30 -[--d]-> 34 -[a--]-> 35 -[--d]-> 37 -[-c-]-> 39 {n41}: G = a; -[-c-]-> 30 -[--d]-> 33 -[--d]-> 36 -[-c-]-> 39 {n42}: return x; -[-c-]-> 30 -[--d]-> 35 -[--d]-> 38 -[--d]-> 40 {n43}: OutRet -[--d]-> 42 {n44}: In(Unknown) int f3(int c) { /* 13 */ int a = 1; /* 14 */ int b = 2; /* 15 */ int x = 0; /* 17 */ if (c > Unknown) { /* 18 */ x = b; } else { /* 19 */ G = a; } /* 21 */ return x; } Slicing project worklist [default] = [f3_slice_1 = (n:42(restrict to x) ,<[--d], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f3_slice_1: (InCtrl: <[--d], [---]>) (In1: <[--d], [---]>) (In(Unknown): <[--d], [---]>) (OutRet: <[--d], [---]>) /**/int f3(/* <[--d], [---]> */ int c) { /* <[---], [---]> */ /* <[---], [---]> */ int a = 1; /* <[--d], [---]> */ /* <[--d], [---]> */ int b = 2; /* <[--d], [---]> */ /* <[--d], [---]> */ int x = 0; /* <[--d], [---]> */ if (c > Unknown) { /* <[--d], [---]> */ x = b; } else { /* <[---], [---]> */ G = a; } /* <[--d], [---]> */ return x; } [pdg] computing for function f4 [pdg] done for function f4 RESULT for f4: {n45}: InCtrl {n46}: VarDecl : c -[a--]-> 47 {n47}: In1 -[a--]-> 46 {n48}: VarDecl : a {n49}: VarDecl : b {n50}: VarDecl : x {n51}: int a = 1; -[-c-]-> 45 -[a--]-> 48 {n52}: int b = 2; -[-c-]-> 45 -[a--]-> 49 {n53}: int x = 0; -[-c-]-> 45 -[a--]-> 50 {n54}: c > Unknown -[-c-]-> 45 -[--d]-> 46 -[--d]-> 47 -[--d]-> 59 {n55}: G = a; -[-c-]-> 45 -[--d]-> 48 -[--d]-> 51 -[-c-]-> 54 {n56}: x = b; -[-c-]-> 45 -[--d]-> 49 -[a--]-> 50 -[--d]-> 52 -[-c-]-> 54 {n57}: return x; -[-c-]-> 45 -[--d]-> 50 -[--d]-> 53 -[--d]-> 56 {n58}: OutRet -[--d]-> 57 {n59}: In(Unknown) int f4(int c) { /* 23 */ int a = 1; /* 24 */ int b = 2; /* 25 */ int x = 0; /* 27 */ if (c > Unknown) { /* 28 */ G = a; } else { /* 29 */ x = b; } /* 31 */ return x; } Slicing project worklist [default] = [f4_slice_1 = (n:57(restrict to x) ,<[--d], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f4_slice_1: (InCtrl: <[--d], [---]>) (In1: <[--d], [---]>) (In(Unknown): <[--d], [---]>) (OutRet: <[--d], [---]>) /**/int f4(/* <[--d], [---]> */ int c) { /* <[---], [---]> */ /* <[---], [---]> */ int a = 1; /* <[--d], [---]> */ /* <[--d], [---]> */ int b = 2; /* <[--d], [---]> */ /* <[--d], [---]> */ int x = 0; /* <[--d], [---]> */ if (c > Unknown) { /* <[---], [---]> */ G = a; } else { /* <[--d], [---]> */ x = b; } /* <[--d], [---]> */ return x; } Slicing project worklist [default] = [f4_slice_2 = (n:55 ,<[ S ], [---]>)(n:45 ,<[-c-], [---]>)(n:54 ,<[-c-], [---]>)(n:48 , <[--d], [---]>)(n:51 ,<[--d], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f4_slice_2: (InCtrl: <[-cd], [---]>) (In1: <[-c-], [---]>) (In(Unknown): <[-c-], [---]>) /**/int f4(/* <[-c-], [---]> */ int c) { /* <[--d], [---]> */ /* <[--d], [---]> */ int a = 1; /* <[---], [---]> */ /* <[---], [---]> */ int b = 2; /* <[---], [---]> */ /* <[---], [---]> */ int x = 0; /* <[-c-], [---]> */ if (c > Unknown) { /* <[ S ], [---]> */ G = a; } else { /* <[---], [---]> */ x = b; } /* <[---], [---]> */ return x; } [pdg] computing for function f5 [pdg] done for function f5 Sorties de la fonction f5 = G Slicing project worklist [default] = [f5_slice_1 = (n:73(restrict to G) ,<[--d], [---]>)(n:77(restrict to G) ,<[--d], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f5_slice_1: (InCtrl: <[--d], [---]>) (In1: <[--d], [---]>) (In(G): <[--d], [---]>) (In(Unknown): <[--d], [---]>) /**/int f5(/* <[--d], [---]> */ int c) { /* <[---], [---]> */ /* <[---], [---]> */ int x = 0; /* <[---], [---]> */ if (c > Unknown) { /* <[---], [---]> */ goto Lsuite; } /* <[---], [---]> */ x ++; /* <[---], [---]> */ Lsuite: /* <[---], [---]> */ ; /* <[--d], [---]> */ if (c < Unknown) { /* <[--d], [---]> */ goto L2; } /* <[--d], [---]> */ G ++; /* <[--d], [---]> */ L2: /* <[---], [---]> */ x ++; /* <[---], [---]> */ return x; } RESULT for f5: {n60}: InCtrl {n61}: VarDecl : c -[a--]-> 62 {n62}: In1 -[a--]-> 61 {n63}: VarDecl : x {n64}: int x = 0; -[-c-]-> 60 -[a--]-> 63 {n65}: c > Unknown -[-c-]-> 60 -[--d]-> 61 -[--d]-> 62 -[--d]-> 78 {n66}: goto Lsuite; -[-c-]-> 60 -[-c-]-> 65 -[-c-]-> 67 {n67}: Lsuite: -[-c-]-> 60 {n68}: x ++; -[-c-]-> 60 -[a-d]-> 63 -[--d]-> 64 -[-c-]-> 65 -[-c-]-> 66 {n69}: Lsuite: ; -[-c-]-> 60 {n70}: c < Unknown -[-c-]-> 60 -[--d]-> 61 -[--d]-> 62 -[--d]-> 78 {n71}: goto L2; -[-c-]-> 60 -[-c-]-> 70 -[-c-]-> 72 {n72}: L2: -[-c-]-> 60 {n73}: G ++; -[-c-]-> 60 -[-c-]-> 70 -[-c-]-> 71 -[--d]-> 77 {n74}: L2: x ++; -[-c-]-> 60 -[a-d]-> 63 -[--d]-> 64 -[--d]-> 68 {n75}: return x; -[-c-]-> 60 -[--d]-> 63 -[--d]-> 74 {n76}: OutRet -[--d]-> 75 {n77}: In(G) {n78}: In(Unknown) int f5(int c) { /* 33 */ int x = 0; /* 35 */ if (c > Unknown) { /* 36 */ goto Lsuite; } /* 38 */ x ++; /* label */ Lsuite: /* 39 */ ; /* 40 */ if (c < Unknown) { /* 41 */ goto L2; } /* 43 */ G ++; /* label */ L2: /* 44 */ x ++; /* 46 */ return x; } Slicing project worklist [default] = [f5_slice_2 = (n:75(restrict to x) ,<[--d], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f5_slice_2: (InCtrl: <[--d], [---]>) (In1: <[--d], [---]>) (In(Unknown): <[--d], [---]>) (OutRet: <[--d], [---]>) /**/int f5(/* <[--d], [---]> */ int c) { /* <[--d], [---]> */ /* <[--d], [---]> */ int x = 0; /* <[--d], [---]> */ if (c > Unknown) { /* <[--d], [---]> */ goto Lsuite; } /* <[--d], [---]> */ x ++; /* <[--d], [---]> */ Lsuite: /* <[---], [---]> */ ; /* <[---], [---]> */ if (c < Unknown) { /* <[---], [---]> */ goto L2; } /* <[---], [---]> */ G ++; /* <[---], [---]> */ L2: /* <[--d], [---]> */ x ++; /* <[--d], [---]> */ return x; } Slicing project worklist [default] = [f5_slice_3 = (n:60 ,<[-c-], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f5_slice_3: (InCtrl: <[-c-], [---]>) /**/int f5(/* <[---], [---]> */ int c) { /* <[---], [---]> */ /* <[---], [---]> */ int x = 0; /* <[---], [---]> */ if (c > Unknown) { /* <[---], [---]> */ goto Lsuite; } /* <[---], [---]> */ x ++; /* <[---], [---]> */ Lsuite: /* <[---], [---]> */ ; /* <[---], [---]> */ if (c < Unknown) { /* <[---], [---]> */ goto L2; } /* <[---], [---]> */ G ++; /* <[---], [---]> */ L2: /* <[---], [---]> */ x ++; /* <[---], [---]> */ return x; } [pdg] computing for function f6 [pdg] done for function f6 RESULT for f6: {n79}: InCtrl {n80}: VarDecl : n -[a--]-> 81 {n81}: In1 -[a--]-> 80 {n82}: VarDecl : i {n83}: VarDecl : __retres {n84}: int i = 0; -[-c-]-> 79 -[a--]-> 82 {n85}: while(1) -[-c-]-> 79 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[-c-]-> 93 -[-c-]-> 94 {n86}: n < 10 -[-c-]-> 79 -[--d]-> 80 -[--d]-> 81 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[--d]-> 91 -[-c-]-> 93 -[-c-]-> 94 {n87}: block -[-c-]-> 79 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[-c-]-> 93 -[-c-]-> 94 {n88}: Unknown > 3 -[-c-]-> 79 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[-c-]-> 93 -[-c-]-> 94 -[--d]-> 105 {n89}: n % 2 -[-c-]-> 79 -[--d]-> 80 -[--d]-> 81 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[--d]-> 91 -[-c-]-> 93 -[-c-]-> 94 {n90}: continue; -[-c-]-> 79 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[-c-]-> 89 -[-c-]-> 93 -[-c-]-> 94 {n91}: n ++; -[-c-]-> 79 -[a-d]-> 80 -[--d]-> 81 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[-c-]-> 89 -[-c-]-> 90 -[--d]-> 91 -[-c-]-> 93 -[-c-]-> 94 {n92}: i = 1; -[-c-]-> 79 -[a--]-> 82 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[-c-]-> 93 -[-c-]-> 94 {n93}: break; -[-c-]-> 79 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[-c-]-> 93 -[-c-]-> 94 {n94}: break; -[-c-]-> 79 -[-c-]-> 85 -[-c-]-> 86 -[-c-]-> 87 -[-c-]-> 88 -[-c-]-> 93 -[-c-]-> 94 {n95}: i -[-c-]-> 79 -[--d]-> 82 -[--d]-> 84 -[--d]-> 92 {n96}: block -[-c-]-> 79 -[-c-]-> 95 {n97}: block -[-c-]-> 79 -[-c-]-> 95 {n98}: __retres = 0; -[-c-]-> 79 -[a--]-> 83 -[-c-]-> 95 -[-c-]-> 96 {n99}: __retres = 10 * n; -[-c-]-> 79 -[--d]-> 80 -[--d]-> 81 -[a--]-> 83 -[--d]-> 91 -[-c-]-> 95 -[-c-]-> 97 {n100}: goto return_label; -[-c-]-> 79 -[-c-]-> 95 -[-c-]-> 96 -[-c-]-> 101 {n101}: return_label: -[-c-]-> 79 {n102}: goto return_label; -[-c-]-> 79 -[-c-]-> 95 -[-c-]-> 97 -[-c-]-> 101 {n103}: return_label: return __retres; -[-c-]-> 79 -[--d]-> 83 -[--d]-> 98 -[--d]-> 99 {n104}: OutRet -[--d]-> 103 {n105}: In(Unknown) int f6(int n) { int __retres; /* 48 */ int i = 0; /* 49 */ while (n < 10) { /* 55 */ if (Unknown > 3) { /* 56 */ i = 1; /* 57 */ break; } /* 60 */ if (n % 2) { /* 61 */ continue; } /* 63 */ n ++; } /* 65 */ if (i) { /* 130 */ { /* 66 */ __retres = 0; /* 131 */ goto return_label; } } else { /* 132 */ { /*@ assert Eva: signed_overflow: -2147483648 ≤ 10 * n; */ /*@ assert Eva: signed_overflow: 10 * n ≤ 2147483647; */ /* 68 */ __retres = 10 * n; /* 133 */ goto return_label; } } /* label */ return_label: /* 134 */ return __retres; } Slicing project worklist [default] = [f6_slice_1 = (n:79 ,<[-c-], [---]>)(n:95 ,<[-c-], [---]>)(n:97 ,<[-c-], [---]>)] [slicing] applying all slicing requests... [slicing] applying 1 actions... [slicing] applying actions: 1/1... Print slice = f6_slice_1: (InCtrl: <[-c-], [---]>) (In1: <[-c-], [---]>) (In(Unknown): <[-c-], [---]>) /**/int f6(/* <[-c-], [---]> */ int n) { /* <[---], [---]> */ int __retres; /* <[-c-], [---]> */ /* <[-c-], [---]> */ int i = 0; /* <[-c-], [---]> */ while (n < 10) { /* <[-c-], [---]> */ if (Unknown > 3) { /* <[-c-], [---]> */ i = 1; /* <[-c-], [---]> */ break; } /* <[-c-], [---]> */ if (n % 2) { /* <[-c-], [---]> */ continue; } /* <[-c-], [---]> */ n ++; } /* <[-c-], [---]> */ if (i) { /* <[---], [ S ]> */ { /* <[---], [---]> */ __retres = 0; /* <[---], [---]> */ goto return_label; } } else { /* <[-c-], [---]> */ { /*@ assert Eva: signed_overflow: -2147483648 ≤ 10 * n; */ /*@ assert Eva: signed_overflow: 10 * n ≤ 2147483647; */ /* <[---], [---]> */ __retres = 10 * n; /* <[---], [---]> */ goto return_label; } } /* <[---], [---]> */ return_label: /* <[---], [---]> */ return __retres; } struct __anonstruct_Tstr_1 { int a ; int b ; int c ; }; typedef struct __anonstruct_Tstr_1 Tstr; int Unknown; int G; Print slice = f1_slice_1: (InCtrl: <[-cd], [---]>) (In1: <[--d], [---]>) /**/int f1(/* <[--d], [---]> */ int x, /* <[---], [---]> */ int y) { /* <[---], [---]> */ int __retres; /* <[--d], [---]> */ /* <[--d], [---]> */ int a = 1; /* <[---], [---]> */ /* <[---], [---]> */ int b = 2; /* <[ S ], [---]> */ G = x + a; /* <[---], [---]> */ __retres = y + b; /* <[---], [---]> */ return __retres; } Print slice = f2_slice_1: (InCtrl: <[-c-], [---]>) /**/int f2(void) { /* <[---], [---]> */ int tmp; /* <[---], [---]> */ /* <[---], [---]> */ int a = 1; /* <[---], [---]> */ /* <[---], [---]> */ int b = a + 1; /* <[ S ], [---]> */ /* <[a--], [---]> */ int c = 3; /* invisible call */ /* <[---], [---]> */ tmp = f1(b,c); /* <[---], [---]> */ return tmp; } Print slice = f3_slice_1: (InCtrl: <[--d], [---]>) (In1: <[--d], [---]>) (In(Unknown): <[--d], [---]>) (OutRet: <[--d], [---]>) /**/int f3(/* <[--d], [---]> */ int c) { /* <[---], [---]> */ /* <[---], [---]> */ int a = 1; /* <[--d], [---]> */ /* <[--d], [---]> */ int b = 2; /* <[--d], [---]> */ /* <[--d], [---]> */ int x = 0; /* <[--d], [---]> */ if (c > Unknown) { /* <[--d], [---]> */ x = b; } else { /* <[---], [---]> */ G = a; } /* <[--d], [---]> */ return x; } Print slice = f4_slice_2: (InCtrl: <[-cd], [---]>) (In1: <[-c-], [---]>) (In(Unknown): <[-c-], [---]>) /**/int f4(/* <[-c-], [---]> */ int c) { /* <[--d], [---]> */ /* <[--d], [---]> */ int a = 1; /* <[---], [---]> */ /* <[---], [---]> */ int b = 2; /* <[---], [---]> */ /* <[---], [---]> */ int x = 0; /* <[-c-], [---]> */ if (c > Unknown) { /* <[ S ], [---]> */ G = a; } else { /* <[---], [---]> */ x = b; } /* <[---], [---]> */ return x; } Print slice = f4_slice_1: (InCtrl: <[--d], [---]>) (In1: <[--d], [---]>) (In(Unknown): <[--d], [---]>) (OutRet: <[--d], [---]>) /**/int f4(/* <[--d], [---]> */ int c) { /* <[---], [---]> */ /* <[---], [---]> */ int a = 1; /* <[--d], [---]> */ /* <[--d], [---]> */ int b = 2; /* <[--d], [---]> */ /* <[--d], [---]> */ int x = 0; /* <[--d], [---]> */ if (c > Unknown) { /* <[---], [---]> */ G = a; } else { /* <[--d], [---]> */ x = b; } /* <[--d], [---]> */ return x; } Print slice = f5_slice_3: (InCtrl: <[-c-], [---]>) /**/int f5(/* <[---], [---]> */ int c) { /* <[---], [---]> */ /* <[---], [---]> */ int x = 0; /* <[---], [---]> */ if (c > Unknown) { /* <[---], [---]> */ goto Lsuite; } /* <[---], [---]> */ x ++; /* <[---], [---]> */ Lsuite: /* <[---], [---]> */ ; /* <[---], [---]> */ if (c < Unknown) { /* <[---], [---]> */ goto L2; } /* <[---], [---]> */ G ++; /* <[---], [---]> */ L2: /* <[---], [---]> */ x ++; /* <[---], [---]> */ return x; } Print slice = f5_slice_2: (InCtrl: <[--d], [---]>) (In1: <[--d], [---]>) (In(Unknown): <[--d], [---]>) (OutRet: <[--d], [---]>) /**/int f5(/* <[--d], [---]> */ int c) { /* <[--d], [---]> */ /* <[--d], [---]> */ int x = 0; /* <[--d], [---]> */ if (c > Unknown) { /* <[--d], [---]> */ goto Lsuite; } /* <[--d], [---]> */ x ++; /* <[--d], [---]> */ Lsuite: /* <[---], [---]> */ ; /* <[---], [---]> */ if (c < Unknown) { /* <[---], [---]> */ goto L2; } /* <[---], [---]> */ G ++; /* <[---], [---]> */ L2: /* <[--d], [---]> */ x ++; /* <[--d], [---]> */ return x; } Print slice = f5_slice_1: (InCtrl: <[--d], [---]>) (In1: <[--d], [---]>) (In(G): <[--d], [---]>) (In(Unknown): <[--d], [---]>) /**/int f5(/* <[--d], [---]> */ int c) { /* <[---], [---]> */ /* <[---], [---]> */ int x = 0; /* <[---], [---]> */ if (c > Unknown) { /* <[---], [---]> */ goto Lsuite; } /* <[---], [---]> */ x ++; /* <[---], [---]> */ Lsuite: /* <[---], [---]> */ ; /* <[--d], [---]> */ if (c < Unknown) { /* <[--d], [---]> */ goto L2; } /* <[--d], [---]> */ G ++; /* <[--d], [---]> */ L2: /* <[---], [---]> */ x ++; /* <[---], [---]> */ return x; } Print slice = f6_slice_1: (InCtrl: <[-c-], [---]>) (In1: <[-c-], [---]>) (In(Unknown): <[-c-], [---]>) /**/int f6(/* <[-c-], [---]> */ int n) { /* <[---], [---]> */ int __retres; /* <[-c-], [---]> */ /* <[-c-], [---]> */ int i = 0; /* <[-c-], [---]> */ while (n < 10) { /* <[-c-], [---]> */ if (Unknown > 3) { /* <[-c-], [---]> */ i = 1; /* <[-c-], [---]> */ break; } /* <[-c-], [---]> */ if (n % 2) { /* <[-c-], [---]> */ continue; } /* <[-c-], [---]> */ n ++; } /* <[-c-], [---]> */ if (i) { /* <[---], [ S ]> */ { /* <[---], [---]> */ __retres = 0; /* <[---], [---]> */ goto return_label; } } else { /* <[-c-], [---]> */ { /*@ assert Eva: signed_overflow: -2147483648 ≤ 10 * n; */ /*@ assert Eva: signed_overflow: 10 * n ≤ 2147483647; */ /* <[---], [---]> */ __retres = 10 * n; /* <[---], [---]> */ goto return_label; } } /* <[---], [---]> */ return_label: /* <[---], [---]> */ return __retres; } Tstr S; Tstr S1; Tstr S2; Slicing project worklist [default] =