|
| 1 | +make[1]: Verzeichnis »/home/marcus/workspace/openmodelica/openmodelica/OpenModelica-testsuite/openmodelica/bootstrapping« wird betreten |
| 2 | + |
| 3 | +Running tests... |
| 4 | + |
| 5 | +OPENMODELICAHOME= /home/marcus/workspace/openmodelica/openmodelica/OMCompiler/build |
| 6 | + + DumpTest ... execution failed |
| 7 | + |
| 8 | +==== Log /tmp/omc-rtest-marcus/openmodelica/bootstrapping/log-DumpTest.mos |
| 9 | +" |
| 10 | +" |
| 11 | +"" |
| 12 | +true |
| 13 | +"" |
| 14 | +true |
| 15 | +true |
| 16 | +"DumpGraphviz.dump" |
| 17 | +graph AST { |
| 18 | +GVNOD0[label="ROOT"];GVNOD1[label="PURE FUNCTION"];GVNOD1 -- GVNOD0; |
| 19 | +} |
| 20 | + + SimplifyOperator ... execution failed |
| 21 | + |
| 22 | +==== Log /tmp/omc-rtest-marcus/openmodelica/bootstrapping/log-ExpressionTest.mos |
| 23 | + + GraphTest ... execution failed |
| 24 | + |
| 25 | +==== Log /tmp/omc-rtest-marcus/openmodelica/bootstrapping/log-GraphTest.mos |
| 26 | + + HashTable Unit Testing ... ok [time:14] |
| 27 | + + PriorityQueue ... execution failed |
| 28 | + |
| 29 | +==== Log /tmp/omc-rtest-marcus/openmodelica/bootstrapping/log-PriorityQueue.mos |
| 30 | +" |
| 31 | +" |
| 32 | +"" |
| 33 | +true |
| 34 | +"" |
| 35 | +{} |
| 36 | +"" |
| 37 | +{record PriorityQueue.Tree.NODE |
| 38 | + elt = (1,{}), |
| 39 | + rank = 0, |
| 40 | + trees = {} |
| 41 | +end PriorityQueue.Tree.NODE;} |
| 42 | +"" |
| 43 | +(1,{}) |
| 44 | +"" |
| 45 | +{record PriorityQueue.Tree.NODE |
| 46 | + elt = (1,{}), |
| 47 | + rank = 1, |
| 48 | + trees = {record PriorityQueue.Tree.NODE |
| 49 | + elt = (3,{}), |
| 50 | + rank = 0, |
| 51 | + trees = {} |
| 52 | +end PriorityQueue.Tree.NODE;} |
| 53 | +end PriorityQueue.Tree.NODE;} |
| 54 | +"" |
| 55 | +(1,{}) |
| 56 | +"" |
| 57 | +{record PriorityQueue.Tree.NODE |
| 58 | + elt = (2,{}), |
| 59 | + rank = 0, |
| 60 | + trees = {} |
| 61 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 62 | + elt = (1,{}), |
| 63 | + rank = 1, |
| 64 | + trees = {record PriorityQueue.Tree.NODE |
| 65 | + elt = (3,{}), |
| 66 | + rank = 0, |
| 67 | + trees = {} |
| 68 | +end PriorityQueue.Tree.NODE;} |
| 69 | +end PriorityQueue.Tree.NODE;} |
| 70 | +"" |
| 71 | +(1,{}) |
| 72 | +"" |
| 73 | +{record PriorityQueue.Tree.NODE |
| 74 | + elt = (1,{}), |
| 75 | + rank = 2, |
| 76 | + trees = {record PriorityQueue.Tree.NODE |
| 77 | + elt = (2,{}), |
| 78 | + rank = 1, |
| 79 | + trees = {record PriorityQueue.Tree.NODE |
| 80 | + elt = (4,{}), |
| 81 | + rank = 0, |
| 82 | + trees = {} |
| 83 | +end PriorityQueue.Tree.NODE;} |
| 84 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 85 | + elt = (3,{}), |
| 86 | + rank = 0, |
| 87 | + trees = {} |
| 88 | +end PriorityQueue.Tree.NODE;} |
| 89 | +end PriorityQueue.Tree.NODE;} |
| 90 | +"" |
| 91 | +(1,{}) |
| 92 | +"" |
| 93 | +{record PriorityQueue.Tree.NODE |
| 94 | + elt = (7,{}), |
| 95 | + rank = 0, |
| 96 | + trees = {} |
| 97 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 98 | + elt = (1,{}), |
| 99 | + rank = 2, |
| 100 | + trees = {record PriorityQueue.Tree.NODE |
| 101 | + elt = (2,{}), |
| 102 | + rank = 1, |
| 103 | + trees = {record PriorityQueue.Tree.NODE |
| 104 | + elt = (4,{}), |
| 105 | + rank = 0, |
| 106 | + trees = {} |
| 107 | +end PriorityQueue.Tree.NODE;} |
| 108 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 109 | + elt = (3,{}), |
| 110 | + rank = 0, |
| 111 | + trees = {} |
| 112 | +end PriorityQueue.Tree.NODE;} |
| 113 | +end PriorityQueue.Tree.NODE;} |
| 114 | +"" |
| 115 | +(1,{}) |
| 116 | +"" |
| 117 | +{record PriorityQueue.Tree.NODE |
| 118 | + elt = (-2,{}), |
| 119 | + rank = 1, |
| 120 | + trees = {record PriorityQueue.Tree.NODE |
| 121 | + elt = (7,{}), |
| 122 | + rank = 0, |
| 123 | + trees = {} |
| 124 | +end PriorityQueue.Tree.NODE;} |
| 125 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 126 | + elt = (1,{}), |
| 127 | + rank = 2, |
| 128 | + trees = {record PriorityQueue.Tree.NODE |
| 129 | + elt = (2,{}), |
| 130 | + rank = 1, |
| 131 | + trees = {record PriorityQueue.Tree.NODE |
| 132 | + elt = (4,{}), |
| 133 | + rank = 0, |
| 134 | + trees = {} |
| 135 | +end PriorityQueue.Tree.NODE;} |
| 136 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 137 | + elt = (3,{}), |
| 138 | + rank = 0, |
| 139 | + trees = {} |
| 140 | +end PriorityQueue.Tree.NODE;} |
| 141 | +end PriorityQueue.Tree.NODE;} |
| 142 | +"" |
| 143 | +(-2,{}) |
| 144 | +"" |
| 145 | +{record PriorityQueue.Tree.NODE |
| 146 | + elt = (11,{}), |
| 147 | + rank = 0, |
| 148 | + trees = {} |
| 149 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 150 | + elt = (-2,{}), |
| 151 | + rank = 1, |
| 152 | + trees = {record PriorityQueue.Tree.NODE |
| 153 | + elt = (7,{}), |
| 154 | + rank = 0, |
| 155 | + trees = {} |
| 156 | +end PriorityQueue.Tree.NODE;} |
| 157 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 158 | + elt = (1,{}), |
| 159 | + rank = 2, |
| 160 | + trees = {record PriorityQueue.Tree.NODE |
| 161 | + elt = (2,{}), |
| 162 | + rank = 1, |
| 163 | + trees = {record PriorityQueue.Tree.NODE |
| 164 | + elt = (4,{}), |
| 165 | + rank = 0, |
| 166 | + trees = {} |
| 167 | +end PriorityQueue.Tree.NODE;} |
| 168 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 169 | + elt = (3,{}), |
| 170 | + rank = 0, |
| 171 | + trees = {} |
| 172 | +end PriorityQueue.Tree.NODE;} |
| 173 | +end PriorityQueue.Tree.NODE;} |
| 174 | +"" |
| 175 | +(-2,{}) |
| 176 | +"" |
| 177 | +{record PriorityQueue.Tree.NODE |
| 178 | + elt = (-2,{}), |
| 179 | + rank = 3, |
| 180 | + trees = {record PriorityQueue.Tree.NODE |
| 181 | + elt = (1,{}), |
| 182 | + rank = 2, |
| 183 | + trees = {record PriorityQueue.Tree.NODE |
| 184 | + elt = (2,{}), |
| 185 | + rank = 1, |
| 186 | + trees = {record PriorityQueue.Tree.NODE |
| 187 | + elt = (4,{}), |
| 188 | + rank = 0, |
| 189 | + trees = {} |
| 190 | +end PriorityQueue.Tree.NODE;} |
| 191 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 192 | + elt = (3,{}), |
| 193 | + rank = 0, |
| 194 | + trees = {} |
| 195 | +end PriorityQueue.Tree.NODE;} |
| 196 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 197 | + elt = (11,{}), |
| 198 | + rank = 1, |
| 199 | + trees = {record PriorityQueue.Tree.NODE |
| 200 | + elt = (35,{}), |
| 201 | + rank = 0, |
| 202 | + trees = {} |
| 203 | +end PriorityQueue.Tree.NODE;} |
| 204 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 205 | + elt = (7,{}), |
| 206 | + rank = 0, |
| 207 | + trees = {} |
| 208 | +end PriorityQueue.Tree.NODE;} |
| 209 | +end PriorityQueue.Tree.NODE;} |
| 210 | +"" |
| 211 | +(-2,{}) |
| 212 | +"" |
| 213 | +{record PriorityQueue.Tree.NODE |
| 214 | + elt = (26,{}), |
| 215 | + rank = 0, |
| 216 | + trees = {} |
| 217 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 218 | + elt = (-2,{}), |
| 219 | + rank = 3, |
| 220 | + trees = {record PriorityQueue.Tree.NODE |
| 221 | + elt = (1,{}), |
| 222 | + rank = 2, |
| 223 | + trees = {record PriorityQueue.Tree.NODE |
| 224 | + elt = (2,{}), |
| 225 | + rank = 1, |
| 226 | + trees = {record PriorityQueue.Tree.NODE |
| 227 | + elt = (4,{}), |
| 228 | + rank = 0, |
| 229 | + trees = {} |
| 230 | +end PriorityQueue.Tree.NODE;} |
| 231 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 232 | + elt = (3,{}), |
| 233 | + rank = 0, |
| 234 | + trees = {} |
| 235 | +end PriorityQueue.Tree.NODE;} |
| 236 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 237 | + elt = (11,{}), |
| 238 | + rank = 1, |
| 239 | + trees = {record PriorityQueue.Tree.NODE |
| 240 | + elt = (35,{}), |
| 241 | + rank = 0, |
| 242 | + trees = {} |
| 243 | +end PriorityQueue.Tree.NODE;} |
| 244 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 245 | + elt = (7,{}), |
| 246 | + rank = 0, |
| 247 | + trees = {} |
| 248 | +end PriorityQueue.Tree.NODE;} |
| 249 | +end PriorityQueue.Tree.NODE;} |
| 250 | +"" |
| 251 | +(-2,{}) |
| 252 | +"" |
| 253 | +{record PriorityQueue.Tree.NODE |
| 254 | + elt = (1,{}), |
| 255 | + rank = 3, |
| 256 | + trees = {record PriorityQueue.Tree.NODE |
| 257 | + elt = (7,{}), |
| 258 | + rank = 2, |
| 259 | + trees = {record PriorityQueue.Tree.NODE |
| 260 | + elt = (11,{}), |
| 261 | + rank = 1, |
| 262 | + trees = {record PriorityQueue.Tree.NODE |
| 263 | + elt = (35,{}), |
| 264 | + rank = 0, |
| 265 | + trees = {} |
| 266 | +end PriorityQueue.Tree.NODE;} |
| 267 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 268 | + elt = (26,{}), |
| 269 | + rank = 0, |
| 270 | + trees = {} |
| 271 | +end PriorityQueue.Tree.NODE;} |
| 272 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 273 | + elt = (2,{}), |
| 274 | + rank = 1, |
| 275 | + trees = {record PriorityQueue.Tree.NODE |
| 276 | + elt = (4,{}), |
| 277 | + rank = 0, |
| 278 | + trees = {} |
| 279 | +end PriorityQueue.Tree.NODE;} |
| 280 | +end PriorityQueue.Tree.NODE;,record PriorityQueue.Tree.NODE |
| 281 | + elt = (3,{}), |
| 282 | + rank = 0, |
| 283 | + trees = {} |
| 284 | +end PriorityQueue.Tree.NODE;} |
| 285 | +end PriorityQueue.Tree.NODE;} |
| 286 | +"" |
| 287 | + + SimCodeTest ... execution failed |
| 288 | + |
| 289 | +==== Log /tmp/omc-rtest-marcus/openmodelica/bootstrapping/log-SimCodeTest.mos |
| 290 | + + SimplifyTest ... ok [time:24] |
| 291 | + + SusanTest ... ok [time:26] |
| 292 | + + System ... ok [time:0] |
| 293 | + + UtilTest ... ok [time:4] |
| 294 | + |
| 295 | +== 5 out of 10 tests failed [openmodelica/bootstrapping, time: 102] |
0 commit comments