About the Execution of Irma.struct for QuasiCertifProtocol-COL-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7378.010 | 874604.00 | 1737258.00 | 2234.90 | FFF?TTTFTF?TTFTF | normal |
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.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 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 irma4mcc-structural
Input is QuasiCertifProtocol-COL-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581100033
=====================================================================
--------------------
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-18-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527782123987
BK_STOP 1527782998591
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-18 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': 249276, 'Memory': 8099.35, 'Tool': 'lola'}, {'Time': 249384, 'Memory': 3867.16, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-COL-18...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
QuasiCertifProtocol-COL-18: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-18: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ QuasiCertifProtocol-COL-18 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
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-ReachabilityCardinality.task
lola: A (G ((p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375 + p1376 + p1377 + p1378 <= p364))) : A (G (((p808 + p807 + p806 + p805 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + 1 <= p1261) OR (p766 + p765 + p764 + p763 + p762 + p761 + p760 + p759 + p758 + p757 + p756 + p755 + p754 + p753 + p752 + p751 + p750 + p749 + p748 + 1 <= p1262)))) : A (G ((p1283 <= p709 + p690 + p671 + p652 + p633 + p614 + p595 + p576 + p557 + p538 + p519 + p500 + p481 + p462 + p443 + p424 + p405 + p386 + p385 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727))) : E (F (((p365 <= 0) AND (p728 + 1 <= p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302) AND (2 <= p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786) AND (2 <= p976 + p957 + p938 + p919 + p900 + p881 + p862 + p843 + p824 + p1166 + p1147 + p1128 + p1109 + p1090 + p1071 + p1052 + p1033 + p1014 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999) AND ((p808 + p807 + p806 + p805 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 <= p365) OR (p709 + p690 + p671 + p652 + p633 + p614 + p595 + p576 + p557 + p538 + p519 + p500 + p481 + p462 + p443 + p424 + p405 + p386 + p385 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 <= p766 + p765 + p764 + p763 + p762 + p761 + p760 + p759 + p758 + p757 + p756 + p755 + p754 + p753 + p752 + p751 + p750 + p749 + p748))))) : E (F ((1 <= p1241 + p1240 + p1239 + p1238 + p1237 + p1236 + p1235 + p1234 + p1233 + p1232 + p1231 + p1230 + p1229 + p1228 + p1227 + p1226 + p1225 + p1224 + p1223))) : E (F ((3 <= p1222 + p1221 + p1220 + p1219 + p1218 + p1217 + p1216 + p1215 + p1214 + p1213 + p1212 + p1211 + p1210 + p1209 + p1208 + p1207 + p1206 + p1205 + p1204))) : E (F (((2 <= p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303) AND (p363 <= 0) AND ((3 <= p1) OR (p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375 + p1376 + p1377 + p1378 <= p1) OR (p1 <= 1))))) : E (F (((p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 <= 0) AND (p1261 + 1 <= p1263) AND ((p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + 1 <= p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786) OR (p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 + 1 <= p976 + p957 + p938 + p919 + p900 + p881 + p862 + p843 + p824 + p1166 + p1147 + p1128 + p1109 + p1090 + p1071 + p1052 + p1033 + p1014 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999))))) : A (G (((2 <= p1262) OR (p0 <= 0) OR (p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 <= p785 + p784 + p783 + p782 + p781 + p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771 + p770 + p769 + p768 + p767)))) : E (F ((((p1359 + p1358 + p1357 + p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341 + 1 <= p1203 + p1202 + p1201 + p1200 + p1199 + p1198 + p1197 + p1196 + p1195 + p1194 + p1193 + p1192 + p1191 + p1190 + p1189 + p1188 + p1187 + p1186 + p1185) OR (p366 <= p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747)) AND (3 <= p1261)))) : A (G (((3 <= p1261) OR (p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 <= p709 + p690 + p671 + p652 + p633 + p614 + p595 + p576 + p557 + p538 + p519 + p500 + p481 + p462 + p443 + p424 + p405 + p386 + p385 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p72
3 + p724 + p725 + p726 + p727) OR ((p1283 <= p363) AND (1 <= p1261)) OR (((2 <= p1260 + p1259 + p1258 + p1257 + p1256 + p1255 + p1254 + p1253 + p1252 + p1251 + p1250 + p1249 + p1248 + p1247 + p1246 + p1245 + p1244 + p1243 + p1242) OR (p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p766 + p765 + p764 + p763 + p762 + p761 + p760 + p759 + p758 + p757 + p756 + p755 + p754 + p753 + p752 + p751 + p750 + p749 + p748)) AND ((p1 <= p1264 + p1265 + p1266 + p1267 + p1268 + p1269 + p1270 + p1271 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279 + p1280 + p1281 + p1282) OR (p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p1263)))))) : E (F ((3 <= p785 + p784 + p783 + p782 + p781 + p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771 + p770 + p769 + p768 + p767))) : A (G (((p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + 1 <= p364) OR (p363 <= 2)))) : A (G (((p808 + p807 + p806 + p805 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 <= p785 + p784 + p783 + p782 + p781 + p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771 + p770 + p769 + p768 + p767) OR (p1262 <= p808 + p807 + p806 + p805 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823)))) : E (F ((p1340 + p1339 + p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 <= p1359 + p1358 + p1357 + p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341))) : E (F (((p1260 + p1259 + p1258 + p1257 + p1256 + p1255 + p1254 + p1253 + p1252 + p1251 + p1250 + p1249 + p1248 + p1247 + p1246 + p1245 + p1244 + p1243 + p1242 + 1 <= p364) AND (2 <= p1261) AND (p1340 + p1339 + p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 <= p365))))
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 ((p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375 + p1376 + p1377 + p1378 <= p364)))
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 1180 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-18-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: 24 markings, 23 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p808 + p807 + p806 + p805 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + 1 <= p1261) OR (p766 + p765 + p764 + p763 + p762 + p761 + p760 + p759 + p758 + p757 + p756 + p755 + p754 + p753 + p752 + p751 + p750 + p749 + p748 + 1 <= p1262))))
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 1180 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-18-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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1283 <= p709 + p690 + p671 + p652 + p633 + p614 + p595 + p576 + p557 + p538 + p519 + p500 + p481 + p462 + p443 + p424 + p405 + p386 + p385 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 +... (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 1180 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-18-ReachabilityCardinality-2.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: 102 markings, 101 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p365 <= 0) AND (p728 + 1 <= p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302) AND (2 <= p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786) AND (2 <= p976 + p957 + p938 + p919 + p900 + p881 + p862 + p843 + p824 ... (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 1180 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 350353 markings, 429290 edges, 70071 markings/sec, 0 secs
lola: sara is running 5 secs || 703311 markings, 874481 edges, 70592 markings/sec, 5 secs
lola: sara is running 10 secs || 1047896 markings, 1318206 edges, 68917 markings/sec, 10 secs
lola: sara is running 15 secs || 1391043 markings, 1766023 edges, 68629 markings/sec, 15 secs
lola: sara is running 20 secs || 1731235 markings, 2217183 edges, 68038 markings/sec, 20 secs
lola: sara is running 25 secs || 2062404 markings, 2662007 edges, 66234 markings/sec, 25 secs
lola: sara is running 30 secs || 2397154 markings, 3094865 edges, 66950 markings/sec, 30 secs
lola: sara is running 35 secs || 2729159 markings, 3536241 edges, 66401 markings/sec, 35 secs
lola: sara is running 40 secs || 3055290 markings, 3985577 edges, 65226 markings/sec, 40 secs
lola: sara is running 45 secs || 3387952 markings, 4420833 edges, 66532 markings/sec, 45 secs
lola: sara is running 50 secs || 3715424 markings, 4871879 edges, 65494 markings/sec, 50 secs
lola: sara is running 55 secs || 4044015 markings, 5328015 edges, 65718 markings/sec, 55 secs
lola: sara is running 60 secs || 4352033 markings, 5818666 edges, 61604 markings/sec, 60 secs
lola: sara is running 65 secs || 4501957 markings, 6618796 edges, 29985 markings/sec, 65 secs
lola: sara is running 70 secs || 4645680 markings, 7431151 edges, 28745 markings/sec, 70 secs
lola: sara is running 75 secs || 4811099 markings, 8094605 edges, 33084 markings/sec, 75 secs
lola: sara is running 80 secs || 4976057 markings, 8731125 edges, 32992 markings/sec, 80 secs
lola: sara is running 85 secs || 5125389 markings, 9482826 edges, 29866 markings/sec, 85 secs
lola: sara is running 90 secs || 5265397 markings, 10037019 edges, 28002 markings/sec, 90 secs
lola: sara is running 95 secs || 5396944 markings, 10608646 edges, 26309 markings/sec, 95 secs
lola: sara is running 100 secs || 5531014 markings, 11403555 edges, 26814 markings/sec, 100 secs
lola: sara is running 105 secs || 5668146 markings, 12158038 edges, 27426 markings/sec, 105 secs
lola: sara is running 110 secs || 5812764 markings, 12837209 edges, 28924 markings/sec, 110 secs
lola: sara is running 115 secs || 5949726 markings, 13550225 edges, 27392 markings/sec, 115 secs
lola: sara is running 120 secs || 6092150 markings, 14234644 edges, 28485 markings/sec, 120 secs
lola: sara is running 125 secs || 6229944 markings, 14948009 edges, 27559 markings/sec, 125 secs
lola: sara is running 130 secs || 6364329 markings, 15690324 edges, 26877 markings/sec, 130 secs
lola: sara is running 135 secs || 6513497 markings, 16484791 edges, 29834 markings/sec, 135 secs
lola: sara is running 140 secs || 6631650 markings, 17401443 edges, 23631 markings/sec, 140 secs
lola: sara is running 145 secs || 6711824 markings, 18270359 edges, 16035 markings/sec, 145 secs
lola: sara is running 150 secs || 6835723 markings, 18992818 edges, 24780 markings/sec, 150 secs
lola: sara is running 155 secs || 7025197 markings, 19543714 edges, 37895 markings/sec, 155 secs
lola: sara is running 160 secs || 7188994 markings, 20283126 edges, 32759 markings/sec, 160 secs
lola: sara is running 165 secs || 7341339 markings, 21049462 edges, 30469 markings/sec, 165 secs
lola: sara is running 170 secs || 7502532 markings, 21782096 edges, 32239 markings/sec, 170 secs
lola: sara is running 175 secs || 7650940 markings, 22519166 edges, 29682 markings/sec, 175 secs
lola: sara is running 180 secs || 7785866 markings, 23328916 edges, 26985 markings/sec, 180 secs
lola: sara is running 185 secs || 7894439 markings, 24102323 edges, 21715 markings/sec, 185 secs
lola: sara is running 190 secs || 8033832 markings, 24659841 edges, 27879 markings/sec, 190 secs
lola: sara is running 195 secs || 8164841 markings, 25254793 edges, 26202 markings/sec, 195 secs
lola: sara is running 200 secs || 8294392 markings, 26046760 edges, 25910 markings/sec, 200 secs
lola: sara is running 205 secs || 8425749 markings, 26717549 edges, 26271 markings/sec, 205 secs
lola: sara is running 210 secs || 8559305 markings, 27425779 edges, 26711 markings/sec, 210 secs
lola: sara is running 215 secs || 8672411 markings, 28309249 edges, 22621 markings/sec, 215 secs
lola: sara is running 220 secs || 8774625 markings, 29230890 edges, 20443 markings/sec, 220 secs
lola: sara is running 225 secs || 8874030 markings, 30139613 edges, 19881 markings/sec, 225 secs
lola: sara is running 230 secs || 8970514 markings, 31075652 edges, 19297 markings/sec, 230 secs
lola: sara is running 235 secs || 9084027 markings, 31957653 edges, 22703 markings/sec, 235 secs
lola: sara is running 240 secs || 9206219 markings, 32837505 edges, 24438 markings/sec, 240 secs
lola: sara is running 245 secs || 9304578 markings, 33729574 edges, 19672 markings/sec, 245 secs
lola: sara is running 250 secs || 9412664 markings, 34629110 edges, 21617 markings/sec, 250 secs
lola: sara is running 255 secs || 9517603 markings, 35534898 edges, 20988 markings/sec, 255 secs
lola: sara is running 260 secs || 9626221 markings, 36401320 edges, 21724 markings/sec, 260 secs
lola: sara is running 265 secs || 9766123 markings, 37097471 edges, 27980 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1241 + p1240 + p1239 + p1238 + p1237 + p1236 + p1235 + p1234 + p1233 + p1232 + p1231 + p1230 + p1229 + p1228 + p1227 + p1226 + p1225 + p1224 + p1223)))
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 1180 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-18-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1222 + p1221 + p1220 + p1219 + p1218 + p1217 + p1216 + p1215 + p1214 + p1213 + p1212 + p1211 + p1210 + p1209 + p1208 + p1207 + p1206 + p1205 + p1204)))
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 1180 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-5.sara
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303) AND (p363 <= 0) AND ((3 <= p1) OR (p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375 + p1376 + p1377 + p1378 <= p1) OR (p1 <= 1)))))
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 1180 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 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.lola:
lola: state equation: calling and running sara
23 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 <= 0) AND (p1261 + 1 <= p1263) AND ((p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + 1 <= p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-6.sara.
STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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-18-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-7.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: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p1262) OR (p0 <= 0) OR (p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 <= p785 + p784 + p783 + p782 + p781 + p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771 + p770 + p769 + p768 + p767))))
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 1180 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 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-8.sara.
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 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1359 + p1358 + p1357 + p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341 + 1 <= p1203 + p1202 + p1201 + p1200 + p1199 + p1198 + p1197 + p1196 + p1195 + p1194 + p1193 + p1192 + p1191 + p1190 + p1189 + p1188 + p1187 + p1186 + p1185) OR (p366 <= p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + ... (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 1180 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 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-9.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 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p1261) OR (p804 + p803 + p802 + p801 + p800 + p799 + p798 + p797 + p796 + p795 + p794 + p793 + p792 + p791 + p790 + p789 + p788 + p787 + p786 <= p709 + p690 + p671 + p652 + p633 + p614 + p595 + p576 + p557 + p538 + p519 + p500 + p481 + p462 + p443 + p424 + p405 + p386 + p385 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p38... (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 1180 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 182210 markings, 1556023 edges, 36442 markings/sec, 0 secs
lola: sara is running 5 secs || 359448 markings, 3247433 edges, 35448 markings/sec, 5 secs
lola: sara is running 10 secs || 513357 markings, 4843256 edges, 30782 markings/sec, 10 secs
lola: sara is running 15 secs || 695022 markings, 6429262 edges, 36333 markings/sec, 15 secs
lola: sara is running 20 secs || 858509 markings, 7982581 edges, 32697 markings/sec, 20 secs
lola: sara is running 25 secs || 1003342 markings, 9442281 edges, 28967 markings/sec, 25 secs
lola: sara is running 30 secs || 1166478 markings, 10938864 edges, 32627 markings/sec, 30 secs
lola: sara is running 35 secs || 1322879 markings, 12412824 edges, 31280 markings/sec, 35 secs
lola: sara is running 40 secs || 1475035 markings, 13880090 edges, 30431 markings/sec, 40 secs
lola: sara is running 45 secs || 1620890 markings, 15306882 edges, 29171 markings/sec, 45 secs
lola: sara is running 50 secs || 1774916 markings, 16689010 edges, 30805 markings/sec, 50 secs
lola: sara is running 55 secs || 1924969 markings, 18113767 edges, 30011 markings/sec, 55 secs
lola: sara is running 60 secs || 2055779 markings, 19445692 edges, 26162 markings/sec, 60 secs
lola: sara is running 65 secs || 2203103 markings, 20788787 edges, 29465 markings/sec, 65 secs
lola: sara is running 70 secs || 2345094 markings, 22121874 edges, 28398 markings/sec, 70 secs
lola: sara is running 75 secs || 2484563 markings, 23457265 edges, 27894 markings/sec, 75 secs
lola: sara is running 80 secs || 2612450 markings, 24789612 edges, 25577 markings/sec, 80 secs
lola: sara is running 85 secs || 2769979 markings, 26155771 edges, 31506 markings/sec, 85 secs
lola: sara is running 90 secs || 2912271 markings, 27499685 edges, 28458 markings/sec, 90 secs
lola: sara is running 95 secs || 3046547 markings, 28807777 edges, 26855 markings/sec, 95 secs
lola: sara is running 100 secs || 3173393 markings, 30083375 edges, 25369 markings/sec, 100 secs
lola: sara is running 105 secs || 3324986 markings, 31412863 edges, 30319 markings/sec, 105 secs
lola: sara is running 110 secs || 3465049 markings, 32744449 edges, 28013 markings/sec, 110 secs
lola: sara is running 115 secs || 3600336 markings, 34093262 edges, 27057 markings/sec, 115 secs
lola: sara is running 120 secs || 3771603 markings, 35692427 edges, 34253 markings/sec, 120 secs
lola: sara is running 125 secs || 3944168 markings, 37315020 edges, 34513 markings/sec, 125 secs
lola: sara is running 130 secs || 4108894 markings, 38904627 edges, 32945 markings/sec, 130 secs
lola: sara is running 135 secs || 4271767 markings, 40459997 edges, 32575 markings/sec, 135 secs
lola: sara is running 140 secs || 4445590 markings, 42079311 edges, 34765 markings/sec, 140 secs
lola: sara is running 145 secs || 4611905 markings, 43672240 edges, 33263 markings/sec, 145 secs
lola: sara is running 150 secs || 4772584 markings, 45241124 edges, 32136 markings/sec, 150 secs
lola: sara is running 155 secs || 4946814 markings, 46826848 edges, 34846 markings/sec, 155 secs
lola: sara is running 160 secs || 5110462 markings, 48412480 edges, 32730 markings/sec, 160 secs
lola: sara is running 165 secs || 5263774 markings, 49952646 edges, 30662 markings/sec, 165 secs
lola: sara is running 170 secs || 5446326 markings, 51566547 edges, 36510 markings/sec, 170 secs
lola: sara is running 175 secs || 5616067 markings, 53189797 edges, 33948 markings/sec, 175 secs
lola: sara is running 180 secs || 5765853 markings, 54768417 edges, 29957 markings/sec, 180 secs
lola: sara is running 185 secs || 5947972 markings, 56331770 edges, 36424 markings/sec, 185 secs
lola: sara is running 190 secs || 6107945 markings, 57849828 edges, 31995 markings/sec, 190 secs
lola: sara is running 195 secs || 6255639 markings, 59353163 edges, 29539 markings/sec, 195 secs
lola: sara is running 200 secs || 6422423 markings, 60880260 edges, 33357 markings/sec, 200 secs
lola: sara is running 205 secs || 6585405 markings, 62394936 edges, 32596 markings/sec, 205 secs
lola: sara is running 210 secs || 6737806 markings, 63886838 edges, 30480 markings/sec, 210 secs
lola: sara is running 215 secs || 6900232 markings, 65423350 edges, 32485 markings/sec, 215 secs
lola: sara is running 220 secs || 7067816 markings, 66991764 edges, 33517 markings/sec, 220 secs
lola: sara is running 225 secs || 7230748 markings, 68549207 edges, 32586 markings/sec, 225 secs
lola: sara is running 230 secs || 7384575 markings, 70064437 edges, 30765 markings/sec, 230 secs
lola: sara is running 235 secs || 7556359 markings, 71609736 edges, 34357 markings/sec, 235 secs
lola: sara is running 240 secs || 7720340 markings, 73187319 edges, 32796 markings/sec, 240 secs
lola: sara is running 245 secs || 7865319 markings, 74715367 edges, 28996 markings/sec, 245 secs
lola: sara is running 250 secs || 8049405 markings, 76293681 edges, 36817 markings/sec, 250 secs
lola: sara is running 255 secs || 8216703 markings, 77885667 edges, 33460 markings/sec, 255 secs
lola: sara is running 260 secs || 8367257 markings, 79434271 edges, 30111 markings/sec, 260 secs
lola: sara is running 265 secs || 8543226 markings, 80995220 edges, 35194 markings/sec, 265 secs
lola: sara is running 270 secs || 8707864 markings, 82550899 edges, 32928 markings/sec, 270 secs
lola: sara is running 275 secs || 8860027 markings, 84072932 edges, 30433 markings/sec, 275 secs
lola: sara is running 280 secs || 9026650 markings, 85611358 edges, 33325 markings/sec, 280 secs
lola: sara is running 285 secs || 9194244 markings, 87183300 edges, 33519 markings/sec, 285 secs
lola: sara is running 290 secs || 9359548 markings, 88793826 edges, 33061 markings/sec, 290 secs
lola: sara is running 295 secs || 9525259 markings, 90357799 edges, 33142 markings/sec, 295 secs
lola: sara is running 300 secs || 9699145 markings, 92008543 edges, 34777 markings/sec, 300 secs
lola: sara is running 305 secs || 9864975 markings, 93583036 edges, 33166 markings/sec, 305 secs
lola: sara is running 310 secs || 10016897 markings, 95061199 edges, 30384 markings/sec, 310 secs
lola: sara is running 315 secs || 10183091 markings, 96565893 edges, 33239 markings/sec, 315 secs
lola: sara is running 320 secs || 10337997 markings, 98052999 edges, 30981 markings/sec, 320 secs
lola: sara is running 325 secs || 10475652 markings, 99487031 edges, 27531 markings/sec, 325 secs
lola: sara is running 330 secs || 10649098 markings, 101000363 edges, 34689 markings/sec, 330 secs
lola: sara is running 335 secs || 10811177 markings, 102536460 edges, 32416 markings/sec, 335 secs
lola: sara is running 340 secs || 10960655 markings, 104033934 edges, 29896 markings/sec, 340 secs
lola: sara is running 345 secs || 11126748 markings, 105561650 edges, 33219 markings/sec, 345 secs
lola: sara is running 350 secs || 11289224 markings, 107089372 edges, 32495 markings/sec, 350 secs
lola: sara is running 355 secs || 11443857 markings, 108583576 edges, 30927 markings/sec, 355 secs
lola: sara is running 360 secs || 11600222 markings, 110101713 edges, 31273 markings/sec, 360 secs
lola: sara is running 365 secs || 11766915 markings, 111618278 edges, 33339 markings/sec, 365 secs
lola: sara is running 370 secs || 11929601 markings, 113195030 edges, 32537 markings/sec, 370 secs
lola: sara is running 375 secs || 12085286 markings, 114747722 edges, 31137 markings/sec, 375 secs
lola: sara is running 380 secs || 12267090 markings, 116361692 edges, 36361 markings/sec, 380 secs
lola: sara is running 385 secs || 12433269 markings, 117954681 edges, 33236 markings/sec, 385 secs
lola: sara is running 390 secs || 12577384 markings, 119464660 edges, 28823 markings/sec, 390 secs
lola: sara is running 395 secs || 12761952 markings, 121063536 edges, 36914 markings/sec, 395 secs
lola: sara is running 400 secs || 12933488 markings, 122692914 edges, 34307 markings/sec, 400 secs
lola: sara is running 405 secs || 13086119 markings, 124263821 edges, 30526 markings/sec, 405 secs
lola: sara is running 410 secs || 13266562 markings, 125864915 edges, 36089 markings/sec, 410 secs
lola: sara is running 415 secs || 13429239 markings, 127404598 edges, 32535 markings/sec, 415 secs
lola: sara is running 420 secs || 13578273 markings, 128896041 edges, 29807 markings/sec, 420 secs
lola: sara is running 425 secs || 13745114 markings, 130436445 edges, 33368 markings/sec, 425 secs
lola: sara is running 430 secs || 13916744 markings, 132043656 edges, 34326 markings/sec, 430 secs
lola: sara is running 435 secs || 14081382 markings, 133655204 edges, 32928 markings/sec, 435 secs
lola: sara is running 440 secs || 14247555 markings, 135217609 edges, 33235 markings/sec, 440 secs
lola: sara is running 445 secs || 14416462 markings, 136819016 edges, 33781 markings/sec, 445 secs
lola: sara is running 450 secs || 14580188 markings, 138375796 edges, 32745 markings/sec, 450 secs
lola: sara is running 455 secs || 14737984 markings, 139910503 edges, 31559 markings/sec, 455 secs
lola: sara is running 460 secs || 14904758 markings, 141422802 edges, 33355 markings/sec, 460 secs
lola: sara is running 465 secs || 15060112 markings, 142914882 edges, 31071 markings/sec, 465 secs
lola: sara is running 470 secs || 15197855 markings, 144356638 edges, 27549 markings/sec, 470 secs
lola: sara is running 475 secs || 15372672 markings, 145868703 edges, 34963 markings/sec, 475 secs
lola: sara is running 480 secs || 15535947 markings, 147420290 edges, 32655 markings/sec, 480 secs
lola: sara is running 485 secs || 15682522 markings, 148892996 edges, 29315 markings/sec, 485 secs
lola: sara is running 490 secs || 15848870 markings, 150421226 edges, 33270 markings/sec, 490 secs
lola: sara is running 495 secs || 16010436 markings, 151936637 edges, 32313 markings/sec, 495 secs
lola: sara is running 500 secs || 16163800 markings, 153423295 edges, 30673 markings/sec, 500 secs
lola: sara is running 505 secs || 16317423 markings, 154914323 edges, 30725 markings/sec, 505 secs
lola: sara is running 510 secs || 16486878 markings, 156457879 edges, 33891 markings/sec, 510 secs
lola: sara is running 515 secs || 16646335 markings, 158007753 edges, 31891 markings/sec, 515 secs
lola: sara is running 520 secs || 16795590 markings, 159510129 edges, 29851 markings/sec, 520 secs
lola: sara is running 525 secs || 16978453 markings, 161123304 edges, 36573 markings/sec, 525 secs
lola: sara is running 530 secs || 17148618 markings, 162746929 edges, 34033 markings/sec, 530 secs
lola: sara is running 535 secs || 17297839 markings, 164314532 edges, 29844 markings/sec, 535 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p785 + p784 + p783 + p782 + p781 + p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771 + p770 + p769 + p768 + p767)))
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 1180 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-18-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 12 will run for 679 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + 1 <= p364) OR (p363 <= 2))))
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 1180 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-18-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-12.sara.
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 13 will run for 905 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p808 + p807 + p806 + p805 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 <= p785 + p784 + p783 + p782 + p781 + p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771 + p770 + p769 + p768 + p767) OR (p1262 <= p808 + p807 + p806 + p805 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + ... (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 1180 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: ========================================
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-18-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1340 + p1339 + p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 <= p1359 + p1358 + p1357 + p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341)))
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 1180 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-18-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 15 will run for 2716 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1260 + p1259 + p1258 + p1257 + p1256 + p1255 + p1254 + p1253 + p1252 + p1251 + p1250 + p1249 + p1248 + p1247 + p1246 + p1245 + p1244 + p1243 + p1242 + 1 <= p364) AND (2 <= p1261) AND (p1340 + p1339 + p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 <= p365))))
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 1180 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 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: no no no unknown yes yes yes no yes no unknown yes yes no yes no
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/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 irma4mcc-structural"
echo " Input is QuasiCertifProtocol-COL-18, 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 r139-qhx2-152673581100033"
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 '
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 ;