Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 67K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is AirplaneLD-COL-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-qhx2-152646136400037
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-00
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-01
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-02
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-03
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-04
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-05
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-06
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-07
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-08
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-09
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-10
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-11
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-12
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-13
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-14
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526673911805


BK_STOP 1526674239010

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using AirplaneLD-COL-0200 as instance name.
Using AirplaneLD as model name.
Using algorithm or tool random-forest.
Model characteristics are: {'Examination': 'UpperBounds', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 3379, 'Memory': 138.95, 'Tool': 'lola'}, {'Time': 5310, 'Memory': 342.17, 'Tool': 'itstools'}, {'Time': 5339, 'Memory': 343.79, 'Tool': 'itstools'}, {'Time': 6868, 'Memory': 2240.12, 'Tool': 'marcie'}, {'Time': 7372, 'Memory': 2240.07, 'Tool': 'marcie'}, {'Time': 18019, 'Memory': 435.14, 'Tool': 'gspn'}, {'Time': 22003, 'Memory': 493.11, 'Tool': 'gspn'}, {'Time': 274055, 'Memory': 2874.83, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 1.571470849363717x far from the best tool lola.
UpperBounds lola AirplaneLD-COL-0200...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
AirplaneLD-COL-0200: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
AirplaneLD-COL-0200: translating COL formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
UpperBounds @ AirplaneLD-COL-0200 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3027/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1419 places, 1608 transitions, 814 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1215 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-COL-0200-UpperBounds.task
lola: MAX(p0) : MAX(p404) : MAX(p404) : MAX(p406 + p407) : MAX(p412) : MAX(p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 + p1260 + p1259 + p1258 + p1257 + p1256 + p1255 + p1254 + p1253 + p1252 + p1251 + p1250 + p1249 + p1248 + p1247 + p1246 + p1245 + p1244 + p1243 + p1242 + p1241 + p1240 + p1239 + p1238 + p1237 + p1236 + p1235 + p1234 + p1233 + p1232 + p1231 + p1230 + p1229 + p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222 + p1221 + p1220 + p1219 + p1218 + p1217 + p1216 + p1215 + p1214 + p1213 + p1212 + p1211 + p1210 + p1209 + p1208 + p1207 + p1206 + p1205 + p1204 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 + p1330 + p1331 + p1332 + p1333 + p1334 + p1335 + p1336 + p1337 + p1338 + p1339 + p1340 + p1341 + p1342 + p1343 + p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375 + p1376 + p1377 + p1378 + p1379 + p1380 + p1381 + p1382 + p1383 + p1384 + p1385 + p1386 + p1387 + p1388 + p1389 + p1390 + p1391 + p1392 + p1393 + p1394 + p1395 + p1396 + p1397 + p1398 + p1399 + p1203 + p1202 + p1201 + p1200 + p1199 + p1198 + p1197 + p1196 + p1195 + p1194 + p1193 + p1192 + p1191 + p1190 + p1189 + p1188 + p1187 + p1186 + p1185 + p1184 + p1183 + p1182 + p1181 + p1180 + p1179 + p1178 + p1177 + p1176 + p1175 + p1174 + p1173 + p1172 + p1171 + p1170 + p1169 + p1168 + p1167 + p1166 + p1165 + p1164 + p1163 + p1162 + p1161 + p1160 + p1159 + p1158 + p1157 + p1156 + p1155 + p1154 + p1153 + p1152 + p1151 + p1150 + p1149 + p1148 + p1147 + p1146 + p1145 + p1144 + p1143 + p1142 + p1141 + p1140 + p1139 + p1138 + p1137 + p1136 + p1135 + p1134 + p1133 + p1132 + p1131 + p1130 + p1129 + p1128 + p1127 + p1126 + p1125 + p1124 + p1123 + p1122 + p1121 + p1120 + p1119 + p1118 + p1117 + p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106 + p1105 + p1104 + p1400 + p1401 + p1402 + p1403 + p1404 + p1405 + p1406 + p1407 + p1408 + p1409 + p1410 + p1411 + p1412 + p1413 + p1414 + p1415 + p1416 + p1417 + p1418 + p1103 + p1102 + p1101 + p1100 + p1099 + p1098 + p1097 + p1096 + p1095 + p1094 + p1093 + p1092 + p1091 + p1090 + p1089 + p1088 + p1087 + p1086 + p1085 + p1084 + p1083 + p1082 + p1081 + p1080 + p1079 + p1078 + p1077 + p1076 + p1075 + p1074 + p1073 + p1072 + p1071 + p1070 + p1069 + p1068 + p1067 + p1066 + p1065 + p1064 + p1063 + p1062 + p1061 + p1060 + p1059 + p1058 + p1057 + p1056 + p1055 + p1054 + p1053 + p1052 + p1051 + p1050 + p1049 + p1048 + p1047 + p1046 + p1045 + p1044 + p1043 + p1042 + p1041 + p1040 + p1039 + p1038 + p1037 + p1036 + p1035 + p1034 + p1033 + p1032 + p1031 + p1030 + p1029 + p1028 + p1027 + p1026 + p1025 + p1024 + p1023 + p1022 + p1021 + p1020 + p1019) : MAX(p403) : MAX(p815) : MAX(p814) : MAX(p405) : MAX(p405) : MAX(p815) : MAX(p813) : MAX(p408) : MAX(p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p99 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p400 + p401 + p402) : MAX(p412)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p404)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p404)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p406 + p407)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 56226 markings, 110451 edges, 11245 markings/sec, 0 secs
lola: 112248 markings, 220513 edges, 11204 markings/sec, 5 secs
lola: 165337 markings, 286466 edges, 10618 markings/sec, 10 secs
lola: 213093 markings, 373690 edges, 9551 markings/sec, 15 secs
lola: 261791 markings, 439571 edges, 9740 markings/sec, 20 secs
lola: 339746 markings, 555875 edges, 15591 markings/sec, 25 secs
lola: 383108 markings, 642799 edges, 8672 markings/sec, 30 secs
lola: 426509 markings, 729801 edges, 8680 markings/sec, 35 secs
lola: 470433 markings, 817849 edges, 8785 markings/sec, 40 secs
lola: 514872 markings, 906929 edges, 8888 markings/sec, 45 secs
lola: 559701 markings, 996785 edges, 8966 markings/sec, 50 secs
lola: 604420 markings, 1086423 edges, 8944 markings/sec, 55 secs
lola: 648342 markings, 1174667 edges, 8784 markings/sec, 60 secs
lola: 692408 markings, 1262999 edges, 8813 markings/sec, 65 secs
lola: 736564 markings, 1351511 edges, 8831 markings/sec, 70 secs
lola: 780257 markings, 1439099 edges, 8739 markings/sec, 75 secs
lola: 823740 markings, 1526263 edges, 8697 markings/sec, 80 secs
lola: 865730 markings, 1610443 edges, 8398 markings/sec, 85 secs
lola: 909224 markings, 1697631 edges, 8699 markings/sec, 90 secs
lola: 953323 markings, 1786029 edges, 8820 markings/sec, 95 secs
lola: 997192 markings, 1873967 edges, 8774 markings/sec, 100 secs
lola: 1040441 markings, 1960667 edges, 8650 markings/sec, 105 secs
lola: 1083708 markings, 2047401 edges, 8653 markings/sec, 110 secs
lola: 1127148 markings, 2134481 edges, 8688 markings/sec, 115 secs
lola: 1171165 markings, 2222913 edges, 8803 markings/sec, 120 secs
lola: 1214795 markings, 2310373 edges, 8726 markings/sec, 125 secs
lola: 1257604 markings, 2396193 edges, 8562 markings/sec, 130 secs
lola: 1301105 markings, 2483393 edges, 8700 markings/sec, 135 secs
lola: 1344988 markings, 2571359 edges, 8777 markings/sec, 140 secs
lola: 1388782 markings, 2659147 edges, 8759 markings/sec, 145 secs
lola: 1431681 markings, 2745147 edges, 8580 markings/sec, 150 secs
lola: 1474552 markings, 2831087 edges, 8574 markings/sec, 155 secs
lola: 1517722 markings, 2917627 edges, 8634 markings/sec, 160 secs
lola: 1561063 markings, 3004510 edges, 8668 markings/sec, 165 secs
lola: 1604015 markings, 3090614 edges, 8590 markings/sec, 170 secs
lola: 1646828 markings, 3176439 edges, 8563 markings/sec, 175 secs
lola: 1689785 markings, 3262553 edges, 8591 markings/sec, 180 secs
lola: 1733126 markings, 3349637 edges, 8668 markings/sec, 185 secs
lola: 1776593 markings, 3436769 edges, 8693 markings/sec, 190 secs
lola: 1820361 markings, 3524505 edges, 8754 markings/sec, 195 secs
lola: 1862776 markings, 3609535 edges, 8483 markings/sec, 200 secs
lola: 1905853 markings, 3695889 edges, 8615 markings/sec, 205 secs
lola: 1948272 markings, 3780927 edges, 8484 markings/sec, 210 secs
lola: 1992120 markings, 3868823 edges, 8770 markings/sec, 215 secs
lola: 2035818 markings, 3956419 edges, 8740 markings/sec, 220 secs
lola: 2079657 markings, 4044297 edges, 8768 markings/sec, 225 secs
lola: 2123170 markings, 4131523 edges, 8703 markings/sec, 230 secs
lola: 2167223 markings, 4219830 edges, 8811 markings/sec, 235 secs
lola: 2211250 markings, 4308083 edges, 8805 markings/sec, 240 secs
lola: 2254861 markings, 4395595 edges, 8722 markings/sec, 245 secs
lola: 2298866 markings, 4483915 edges, 8801 markings/sec, 250 secs
lola: 2341910 markings, 4570203 edges, 8609 markings/sec, 255 secs
lola: 2384506 markings, 4655597 edges, 8519 markings/sec, 260 secs
lola: 2428246 markings, 4743275 edges, 8748 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p412)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 + p1260 + p1259 + p1258 + p1257 + p1256 + p1255 + p1254 + p1253 + p1252 + p1251 + p125... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 400
lola: produced by: state space
lola: The maximum value of the given expression is 400
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p403)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p815)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 41015 markings, 61316 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p814)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p405)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 13 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p405)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 13 markings, 14 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p815)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 41015 markings, 61316 edges
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p813)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1088 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p408)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1632 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 401 markings, 400 edges
lola: ========================================
lola: subprocess 15 will run for 3265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p412)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 1 1 1 unknown 1 400 1 1 1 1 1 1 1 1 1 1
FORMULA AirplaneLD-COL-0200-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-5 400 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AirplaneLD-COL-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0200.tgz
mv AirplaneLD-COL-0200 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is AirplaneLD-COL-0200, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-qhx2-152646136400037"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;