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 264K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700030
=====================================================================

--------------------
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 QuasiCertifProtocol-COL-18-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526909742233

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-18 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-18 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-COL-18 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 44736
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-18-UpperBounds.task
lola: MAX(p419) : MAX(p820) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p38 + p19 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p133 + p152 + p171 + p190 + p209 + p228 + p247 + p266 + p285 + p304 + p323 + p342 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p303 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p265 + p264 + p263 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p234 + p233 + p232 + p231 + p230 + p229 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p170 + p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p151 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p134 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p104 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p103 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p102 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p101 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379) : MAX(p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379) : MAX(p975) : MAX(p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898) : MAX(p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379) : MAX(p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860) : MAX(p899 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917) : MAX(p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974) : MAX(p1360 + p1341 + p1322 + p1303 + p1284 + p1265 + p1246 + p1227 + p1208 + p1189 + p1170 + p1151 + p1132 + p1113 + p1094 + p1075 + p1056 + p1037 + p1036 + p1035 + p1034 + p1033 + p1032 + p1031 + p1030 + p1029 + p1028 + p1027 + p1026 + p1025 + p1024 + p1023 + p1022 + p1021 + p1020 + p1019 + p1018 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 + p1131 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1147 + p1148 + p1149 + p1150 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1204 + p1205 + p1206 + p1207 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1223 + p1224 + p1225 + p1226 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + p1240 + p1241 + p1242 + p1243 + p1244 + p1245 + p1247 + p1248 + p1249 + p1250 + p1251 + p1252 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 + p1259 + p1260 + p1261 + p1262 + p1263 + p1264 + p1266 + p1267 + p1268 + p1269 + p1270 + p1271 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279 + p1280 + p1281 + p1282 + p1283 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 + p1330 + p1331 + p1332 + p1333 + p1334 + p1335 + p1336 + p1337 + p1338 + p1339 + p1340 + p1342 + p1343 + p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375 + p1376 + p1377 + p1378) : MAX(p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841) : MAX(p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 + p785 + p784 + p783 + p782) : MAX(p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898) : MAX(p1017)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p419)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p419)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-0 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p820)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p820)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 43 markings, 42 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-1 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p975)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p975)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 102 markings, 101 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-5 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1017)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1017)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 11 markings, 10 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-15 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379)
lola: processed formula length: 154
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 23 markings, 22 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-3 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 63 markings, 62 edges
lola:
FORMULA QuasiCertifProtocol-COL-18-UpperBounds-6 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 44 markings, 43 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-7 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 63 markings, 62 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-8 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p899 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p899 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 21 markings, 20 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-9 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 158 markings, 157 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-10 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 0 markings, 0 edges

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-12 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 + p785 + p784 + p783 + p782)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 + p785 + p784 + p783 + p782)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 101 markings, 100 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-13 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 63 markings, 62 edges

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-14 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379)
lola: processed formula length: 135
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 44 markings, 43 edges

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-4 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p38 + p19 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p133 + p152 + p171 + p190 + p209 + p228 + p247 + p266 + p285 + p304 + p323 + p342 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p341 + p340 + p339 + p338 + p337 + p336 + p335 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p38 + p19 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p133 + p152 + p171 + p190 + p209 + p228 + p247 + p266 + p285 + p304 + p323 + p342 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p341 + p340 + p339 + p338 + p337 + p336 + p335 ... (shortened)
lola: processed formula length: 2419
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 361
lola: SUBRESULT
lola: result: 361
lola: produced by: state space
lola: The maximum value of the given expression is 361
lola: 139 markings, 138 edges

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-2 361 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1360 + p1341 + p1322 + p1303 + p1284 + p1265 + p1246 + p1227 + p1208 + p1189 + p1170 + p1151 + p1132 + p1113 + p1094 + p1075 + p1056 + p1037 + p1036 + p1035 + p1034 + p1033 + p1032 + p1031 + p1030 + p1029 + p1028 + p1027 + p1026 + p1025 + p1024 + p1023 + p1022 + p1021 + p1020 + p1019 + p1018 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p105... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1360 + p1341 + p1322 + p1303 + p1284 + p1265 + p1246 + p1227 + p1208 + p1189 + p1170 + p1151 + p1132 + p1113 + p1094 + p1075 + p1056 + p1037 + p1036 + p1035 + p1034 + p1033 + p1032 + p1031 + p1030 + p1029 + p1028 + p1027 + p1026 + p1025 + p1024 + p1023 + p1022 + p1021 + p1020 + p1019 + p1018 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p105... (shortened)
lola: processed formula length: 2890
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-18-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 361
lola: SUBRESULT
lola: result: 361
lola: produced by: state space
lola: The maximum value of the given expression is 361
lola: 82 markings, 81 edges

FORMULA QuasiCertifProtocol-COL-18-UpperBounds-11 361 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 1 361 19 19 10 19 19 19 19 19 361 19 19 19 10
lola:
preliminary result: 1 1 361 19 19 10 19 19 19 19 19 361 19 19 19 10
lola: ========================================
lola: memory consumption: 19932 KB
lola: time consumption: 27 seconds

BK_STOP 1526909789350

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

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="QuasiCertifProtocol-COL-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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 lola"
echo " Input is QuasiCertifProtocol-COL-18, 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 r136-qhx2-152673578700030"
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 ;