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 268K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.6K 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 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 104K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is QuasiCertifProtocol-COL-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580400040
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1527141796690


BK_STOP 1527141862726

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-22 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 7058, 'Memory': 383.72, 'Tool': 'lola'}, {'Time': 10555, 'Memory': 395.13, 'Tool': 'lola'}, {'Time': 517366, 'Memory': 15933.86, 'Tool': 'itstools'}, {'Time': 521418, 'Memory': 15934.23, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-COL-22...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-22: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-22: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ QuasiCertifProtocol-COL-22 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2322/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1966 places, 356 transitions, 355 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 471 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-22-ReachabilityCardinality.task
lola: A (G ((p1295 + p1294 + p1293 + p1292 + p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))) : A (G ((p673 <= p670 + p669 + p668 + p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p656 + p655 + p654 + p653 + p652 + p651 + p650 + p649 + p648))) : E (F (((3 <= p1919) AND (p1920 + p1921 + p1922 + p1923 + p1924 + p1925 + p1926 + p1927 + p1928 + p1929 + p1930 + p1931 + p1932 + p1933 + p1934 + p1935 + p1936 + p1937 + p1938 + p1939 + p1940 + p1941 + p1942 <= p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1896 + p1897 + p1898 + p1899)))) : E (F (((2 <= p0) OR (((p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 <= p672) OR (2 <= p1296)) AND ((1 <= p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696) OR (1 <= p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1896 + p1897 + p1898 + p1899)))))) : A (G (((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320) OR (p70 <= 0) OR (((p974 + p951 + p928 + p905 + p882 + p859 + p836 + p813 + p790 + p767 + p744 + p721 + p1227 + p1204 + p1181 + p1158 + p1135 + p1112 + p1089 + p1066 + p1043 + p1023 + p1022 + p1021 + p1020 + p1019 + p1018 + p1017 + p1016 + p1015 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1004 + p1003 + p1002 + p1001 + p1000 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1147 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1205 + p1206 + p1207 + p1208 + 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 + p1246 + p1247 + p1248 + p1249 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p860 + p861 + p862 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p902 + p903 + p904 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p975 + p976 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999 <= p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1896 + p1897 + p1898 + p1899) OR (2 <= p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 + p1260 + p1259 + p1258 + p1257 + p1256 + p1255 + p1254 + p1253 + p1252 + p1251 + p1250)) AND (p670 + p669 + p668 + p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p656 + p655 + p654 + p653 + p652 + p651 + p650 + p649 + p648 <= p1343 + p1342 + p1341 + p1340 + p1339 + p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321))))) : A (G ((p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 <= p0))) : E (F (((p672 <= p1296) AND (1 <= p673)))) : A (G (((p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + 1 <= p1920 + p1921 + p1922 + p1923 + p1924 + p1925 + p1926 + p1927 + p1928 + p1929 + p1930 + p1931 + p1932 + p1933 + p1934 + p1935 + p1936 + p1937 + p1938 + p1939 + p1940 + p1941 + p1942) AND (p720 + 1 <= p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320) AND ((p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 <= 1) OR (p1296 + 1 <= p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366))))) : E (F (((p71 + 1 <= p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1896 + p1897 + p1898 + p1899) AND (p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p69 + 1 <= p670 + p669 + p668 + p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p656 + p655 + p654 + p653 + p652 + p651 + p650 + p649 + p648) AND ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p142 + p165 + p188 + p211 + p234 + p257 + p280 + p303 + p326 + p579 + p556 + p533 + p510 + p487 + p464 + p441 + p418 + p349 + p372 + p395 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p378 + p396 + p397 + p398 + p399 + p377 + p376 + p375 + p374 + p373 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p348 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p347 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p346 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p345 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p344 + p343 + p342 + p341 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p340 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p339 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p338 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p337 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p600 + p601 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262 + p261 + p260 + p259 + p258 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p147 + p146 + p145 + p144 + p143 + p141 + p140 + p139 + p138 + p137 + p136 + 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 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 <= 2) OR (3 <= p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366))))) : E (F ((((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (1 <= p1943 + p1944 + p1945 + p1946 + p1947 + p1948 + p1949 + p1950 + p1951 + p1952 + p1953 + p1954 + p1955 + p1956 + p1957 + p1958 + p1959 + p1960 + p1961 + p1962 + p1963 + p1964 + p1965) OR ((p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 <= p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320) AND (p1943 + p1944 + p1945 + p1946 + p1947 + p1948 + p1949 + p1950 + p1951 + p1952 + p1953 + p1954 + p1955 + p1956 + p1957 + p1958 + p1959 + p1960 + p1961 + p1962 + p1963 + p1964 + p1965 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p142 + p165 + p188 + p211 + p234 + p257 + p280 + p303 + p326 + p579 + p556 + p533 + p510 + p487 + p464 + p441 + p418 + p349 + p372 + p395 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p378 + p396 + p397 + p398 + p399 + p377 + p376 + p375 + p374 + p373 + p371 + p370 + p369 + p368 + p367 + p366 + p365 + p364 + p363 + p362 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p348 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p347 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p346 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p345 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p344 + p343 + p342 + p341 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p340 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p339 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p338 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p337 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p600 + p601 + p283 + p282 + p281 + p279 + p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p263 + p262 + p261 + p260 + p259 + p258 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p235 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p167 + p166 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p1
47 + p146 + p145 + p144 + p143 + p141 + p140 + p139 + p138 + p137 + p136 + 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 + p135 + p134 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124))) AND ((3 <= p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696) OR (p1943 + p1944 + p1945 + p1946 + p1947 + p1948 + p1949 + p1950 + p1951 + p1952 + p1953 + p1954 + p1955 + p1956 + p1957 + p1958 + p1959 + p1960 + p1961 + p1962 + p1963 + p1964 + p1965 + 1 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625))))) : A (G (((p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p69 <= 2) AND (p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 <= p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1896 + p1897 + p1898 + p1899)))) : A (G (((2 <= p71) OR (3 <= p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696) OR (1 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625) OR (p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 <= p71) OR (p1943 + p1944 + p1945 + p1946 + p1947 + p1948 + p1949 + p1950 + p1951 + p1952 + p1953 + p1954 + p1955 + p1956 + p1957 + p1958 + p1959 + p1960 + p1961 + p1962 + p1963 + p1964 + p1965 <= 1)))) : E (F ((((p1297 + 1 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p974 + p951 + p928 + p905 + p882 + p859 + p836 + p813 + p790 + p767 + p744 + p721 + p1227 + p1204 + p1181 + p1158 + p1135 + p1112 + p1089 + p1066 + p1043 + p1023 + p1022 + p1021 + p1020 + p1019 + p1018 + p1017 + p1016 + p1015 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1004 + p1003 + p1002 + p1001 + p1000 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1147 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1205 + p1206 + p1207 + p1208 + 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 + p1246 + p1247 + p1248 + p1249 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p860 + p861 + p862 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p902 + p903 + p904 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p975 + p976 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999)) OR (2 <= p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366)))) : E (F ((3 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625))) : E (F ((p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625))) : A (G ((p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 <= 0)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1295 + p1294 + p1293 + p1292 + p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + p1280 + p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 76 markings, 75 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p673 <= p670 + p669 + p668 + p667 + p666 + p665 + p664 + p663 + p662 + p661 + p660 + p659 + p658 + p657 + p656 + p655 + p654 + p653 + p652 + p651 + p650 + p649 + p648)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100 markings, 99 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1919) AND (p1920 + p1921 + p1922 + p1923 + p1924 + p1925 + p1926 + p1927 + p1928 + p1929 + p1930 + p1931 + p1932 + p1933 + p1934 + p1935 + p1936 + p1937 + p1938 + p1939 + p1940 + p1941 + p1942 <= p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1896 + p1897 + p1898 + p1899))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-22-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p0) OR (((p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 <= p672) OR (2 <= p1296)) AND ((1 <= p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696) OR (1 <= p1900 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: lola: state equation: calling and running sara
The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320) OR (p70 <= 0) OR (((p974 + p951 + p928 + p905 + p882 + p859 + p8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file QuasiCertifProtocol-COL-22-ReachabilityCardinality-3.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-22-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 169 markings, 168 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p672 <= p1296) AND (1 <= p673))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-22-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + 1 <= p1920 + p1921 + p1922 + p1923 + p1924 + p1925 + p1926 + p1927 + p1928 + p1929 + p1930 + p1931 + p1932 + p1933 + p1934 + p1935 + p1936 + p1937 + p1938 + p1939 + p1940 + p1941 + p1942) AND (p720 + 1 <= p12... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p71 + 1 <= p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1896 + p1897 + p1898 + p1899) AND (p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p69 + 1 <= p670 + p669 + p668 + p667 + p666 + p665 + p664 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-22-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) OR (1 <= p1943 + p1944 + p1945 + p1946 + p1947 + p1948 + p1949 + p1950 + p1951 + p1952 + p1953 + p1954 + p1955 + p1956 + p1957 + p1958 + p1959 + p1960 + p1961 + p1962 + p1963 + p1964 + p1965) OR ((p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p13... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 14 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p69 <= 2) AND (p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 <= p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p19... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file QuasiCertifProtocol-COL-22-ReachabilityCardinality-9.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 11 will run for 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p71) OR (3 <= p678 + p677 + p676 + p675 + p674 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696) OR (1 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625) OR (p678 + p677 + p676 + p675 + p674 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-22-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1297 + 1 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p974 + p951 + p928 + p905 + p882 + p859 + p836 + p813 + p790 + p767 + p744 + p721 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 99 markings, 98 edges
lola: ========================================
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: ========================================
lola: subprocess 14 will run for 1763 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 <= p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 110 markings, 109 edges
lola: ========================================
lola: subprocess 15 will run for 3527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p647 + p646 + p645 + p644 + p643 + p642 + p641 + p640 + p639 + p638 + p637 + p636 + p635 + p634 + p633 + p632 + p631 + p630 + p629 + p628 + p627 + p626 + p625 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-22-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 99 markings, 98 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes no no yes no yes yes yes yes no

FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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-22"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
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-22.tgz
mv QuasiCertifProtocol-COL-22 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-full"
echo " Input is QuasiCertifProtocol-COL-22, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-qhx2-152673580400040"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;