About the Execution of Irma.full for QuasiCertifProtocol-COL-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8030.880 | 877020.00 | 1730993.00 | 2654.20 | 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
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 r138-qhx2-152673580400033
=====================================================================
--------------------
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 1527140546503
BK_STOP 1527141423523
--------------------
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-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...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 ((p1143 + p1142 + p1141 + p1140 + p1139 + p1138 + p1137 + p1136 + p1135 + p1134 + p1133 + p1132 + p1131 + p1130 + p1129 + p1128 + p1127 + p1126 + p1125 <= p1339))) : A (G (((p1225 + p1224 + p1223 + p1222 + p1221 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + 1 <= p1241) OR (p1162 + p1161 + p1160 + p1159 + p1158 + p1157 + p1156 + p1155 + p1154 + p1153 + p1152 + p1151 + p1150 + p1149 + p1148 + p1147 + p1146 + p1145 + p1144 + 1 <= p1300)))) : A (G ((p1163 <= p973 + p954 + p935 + p916 + p897 + p878 + p859 + p840 + p821 + p802 + p783 + p764 + p745 + p1087 + p1068 + p1049 + p1030 + p1011 + p1010 + p1009 + p1008 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + 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 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p898 + p899 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p974 + 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))) : E (F (((p22 <= 0) AND (p1240 + 1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (2 <= p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1397) AND (2 <= p726 + p707 + p688 + p669 + p650 + p631 + p612 + p593 + p574 + p555 + p536 + p517 + p498 + p479 + p460 + p441 + p422 + p403 + p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385 + p384 + p400 + p401 + p402 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744) AND ((p1225 + p1224 + p1223 + p1222 + p1221 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 <= p22) OR (p973 + p954 + p935 + p916 + p897 + p878 + p859 + p840 + p821 + p802 + p783 + p764 + p745 + p1087 + p1068 + p1049 + p1030 + p1011 + p1010 + p1009 + p1008 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + 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 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p898 + p899 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p974 + 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 <= p1162 + p1161 + p1160 + p1159 + p1158 + p1157 + p1156 + p1155 + p1154 + p1153 + p1152 + p1151 + p1150 + p1149 + p1148 + p1147 + p1146 + p1145 + p1144))))) : E (F ((1 <= p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1378))) : E (F ((3 <= p1201 + p1200 + p1199 + p1198 + p1197 + p1196 + p1195 + p1194 + p1193 + p1192 + p1191 + p1190 + p1189 + p1188 + p1187 + p1186 + p1185 + p1184 + p1183))) : E (F (((2 <= p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182) AND (p1280 <= 0) AND ((3 <= p1340) OR (p1143 + p1142 + p1141 + p1140 + p1139 + p1138 + p1137 + p1136 + p1135 + p1134 + p1133 + p1132 + p1131 + p1130 + p1129 + p1128 + p1127 + p1126 + p1125 <= p1340) OR (p1340 <= 1))))) : E (F (((p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= 0) AND (p1241 + 1 <= p2) AND ((p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + 1 <= p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1397) OR (p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1397 + 1 <= p726 + p707 + p688 + p669 + p650 + p631 + p612 + p593 + p574 + p555 + p536 + p517 + p498 + p479 + p460 + p441 + p422 + p403 + p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385 + p384 + p400 + p401 + p402 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744))))) : A (G (((2 <= p1300) OR (p0 <= 0) OR (p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1397 <= p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321 + p1320)))) : E (F ((((p1220 + p1219 + p1218 + p1217 + p1216 + p1215 + p1214 + p1213 + p1212 + p1211 + p1210 + p1209 + p1208 + p1207 + p1206 + p1205 + p1204 + p1203 + p1202 + 1 <= p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307) OR (p1 <= p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299)) AND (3 <= p1241)))) : A (G (((3 <= p1241) OR (p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1397 <= p973 + p954 + p935 + p916 + p897 + p878 + p859 + p840 + p821 + p802 + p783 + p764 + p745 + p1087 + p1068 + p1049 + p1030 + p1011 + p1010 + p1009 + p1008 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + 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 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p898 + p899 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p974 + p975 + p976 + p977 + p978 + p979 + p980 + p981 + p98
2 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999) OR ((p1163 <= p1280) AND (1 <= p1241)) OR (((2 <= p1124 + p1123 + p1122 + p1121 + p1120 + p1119 + p1118 + p1117 + p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106) OR (p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 <= p1162 + p1161 + p1160 + p1159 + p1158 + p1157 + p1156 + p1155 + p1154 + p1153 + p1152 + p1151 + p1150 + p1149 + p1148 + p1147 + p1146 + p1145 + p1144)) AND ((p1340 <= p1341 + p1342 + p1343 + p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359) OR (p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 <= p2)))))) : E (F ((3 <= p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321 + p1320))) : A (G (((p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + 1 <= p1339) OR (p1280 <= 2)))) : A (G (((p1225 + p1224 + p1223 + p1222 + p1221 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 <= p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321 + p1320) OR (p1300 <= p1225 + p1224 + p1223 + p1222 + p1221 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239)))) : E (F ((p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 <= p1220 + p1219 + p1218 + p1217 + p1216 + p1215 + p1214 + p1213 + p1212 + p1211 + p1210 + p1209 + p1208 + p1207 + p1206 + p1205 + p1204 + p1203 + p1202))) : E (F (((p1124 + p1123 + p1122 + p1121 + p1120 + p1119 + p1118 + p1117 + p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106 + 1 <= p1339) AND (2 <= p1241) AND (p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 <= p22))))
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 ((p1143 + p1142 + p1141 + p1140 + p1139 + p1138 + p1137 + p1136 + p1135 + p1134 + p1133 + p1132 + p1131 + p1130 + p1129 + p1128 + p1127 + p1126 + p1125 <= p1339)))
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: 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 (((p1225 + p1224 + p1223 + p1222 + p1221 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + 1 <= p1241) OR (p1162 + p1161 + p1160 + p1159 + p1158 + p1157 + p1156 + p1155 + p1154 + p1153 + p1152 + p1151 + p1150 + p1149 + p1148 + p1147 + p1146 + p1145 + p1144 + 1 <= p1300))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1163 <= p973 + p954 + p935 + p916 + p897 + p878 + p859 + p840 + p821 + p802 + p783 + p764 + p745 + p1087 + p1068 + p1049 + p1030 + p1011 + p1010 + p1009 + p1008 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1031 + p1032 + p1033... (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
sara: try reading problem file 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: 64 markings, 63 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 <= 0) AND (p1240 + 1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (2 <= p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1397) AND (2 <= p726 + p707 + p688 + p669 + p650 + p631 + p612 + p593 + p574 + p555 + p536 + p517 + p49... (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
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 159175 markings, 361879 edges, 31835 markings/sec, 0 secs
lola: sara is running 5 secs || 336278 markings, 797669 edges, 35421 markings/sec, 5 secs
lola: sara is running 10 secs || 510898 markings, 1269718 edges, 34924 markings/sec, 10 secs
lola: sara is running 15 secs || 647256 markings, 1886202 edges, 27272 markings/sec, 15 secs
lola: sara is running 20 secs || 779133 markings, 2518126 edges, 26375 markings/sec, 20 secs
lola: sara is running 25 secs || 908783 markings, 3169379 edges, 25930 markings/sec, 25 secs
lola: sara is running 30 secs || 1036249 markings, 3813598 edges, 25493 markings/sec, 30 secs
lola: sara is running 35 secs || 1162132 markings, 4471828 edges, 25177 markings/sec, 35 secs
lola: sara is running 40 secs || 1286416 markings, 5164676 edges, 24857 markings/sec, 40 secs
lola: sara is running 45 secs || 1453267 markings, 5636738 edges, 33370 markings/sec, 45 secs
lola: sara is running 50 secs || 1613772 markings, 6182008 edges, 32101 markings/sec, 50 secs
lola: sara is running 55 secs || 1748542 markings, 6798992 edges, 26954 markings/sec, 55 secs
lola: sara is running 60 secs || 1881070 markings, 7472313 edges, 26506 markings/sec, 60 secs
lola: sara is running 65 secs || 2045909 markings, 7981542 edges, 32968 markings/sec, 65 secs
lola: sara is running 70 secs || 2196348 markings, 8459397 edges, 30088 markings/sec, 70 secs
lola: sara is running 75 secs || 2348386 markings, 9017045 edges, 30408 markings/sec, 75 secs
lola: sara is running 80 secs || 2476131 markings, 9732675 edges, 25549 markings/sec, 80 secs
lola: sara is running 85 secs || 2579082 markings, 10537009 edges, 20590 markings/sec, 85 secs
lola: sara is running 90 secs || 2674735 markings, 11320730 edges, 19131 markings/sec, 90 secs
lola: sara is running 95 secs || 2778840 markings, 12156642 edges, 20821 markings/sec, 95 secs
lola: sara is running 100 secs || 2881742 markings, 12916849 edges, 20580 markings/sec, 100 secs
lola: sara is running 105 secs || 2981614 markings, 13679188 edges, 19974 markings/sec, 105 secs
lola: sara is running 110 secs || 3080992 markings, 14483395 edges, 19876 markings/sec, 110 secs
lola: sara is running 115 secs || 3192791 markings, 15217413 edges, 22360 markings/sec, 115 secs
lola: sara is running 120 secs || 3318643 markings, 15846671 edges, 25170 markings/sec, 120 secs
lola: sara is running 125 secs || 3443571 markings, 16525096 edges, 24986 markings/sec, 125 secs
lola: sara is running 130 secs || 3568429 markings, 17174286 edges, 24972 markings/sec, 130 secs
lola: sara is running 135 secs || 3691324 markings, 17853229 edges, 24579 markings/sec, 135 secs
lola: sara is running 140 secs || 3812631 markings, 18550260 edges, 24261 markings/sec, 140 secs
lola: sara is running 145 secs || 3936348 markings, 19259347 edges, 24743 markings/sec, 145 secs
lola: sara is running 150 secs || 4058487 markings, 19951664 edges, 24428 markings/sec, 150 secs
lola: sara is running 155 secs || 4178249 markings, 20665173 edges, 23952 markings/sec, 155 secs
lola: sara is running 160 secs || 4305895 markings, 21405111 edges, 25529 markings/sec, 160 secs
lola: sara is running 165 secs || 4429521 markings, 22117282 edges, 24725 markings/sec, 165 secs
lola: sara is running 170 secs || 4526825 markings, 22940387 edges, 19461 markings/sec, 170 secs
lola: sara is running 175 secs || 4612017 markings, 23839635 edges, 17038 markings/sec, 175 secs
lola: sara is running 180 secs || 4730870 markings, 24458186 edges, 23771 markings/sec, 180 secs
lola: sara is running 185 secs || 4847146 markings, 25096342 edges, 23255 markings/sec, 185 secs
lola: sara is running 190 secs || 4953643 markings, 25845630 edges, 21299 markings/sec, 190 secs
lola: sara is running 195 secs || 5042012 markings, 26673576 edges, 17674 markings/sec, 195 secs
lola: sara is running 200 secs || 5124697 markings, 27556075 edges, 16537 markings/sec, 200 secs
lola: sara is running 205 secs || 5201177 markings, 28421630 edges, 15296 markings/sec, 205 secs
lola: sara is running 210 secs || 5279280 markings, 29393671 edges, 15621 markings/sec, 210 secs
lola: sara is running 215 secs || 5438812 markings, 30002923 edges, 31906 markings/sec, 215 secs
lola: sara is running 220 secs || 5605148 markings, 30496331 edges, 33267 markings/sec, 220 secs
lola: sara is running 225 secs || 5753591 markings, 31020840 edges, 29689 markings/sec, 225 secs
lola: sara is running 230 secs || 5895362 markings, 31533377 edges, 28354 markings/sec, 230 secs
lola: sara is running 235 secs || 6036344 markings, 32083634 edges, 28196 markings/sec, 235 secs
lola: sara is running 240 secs || 6163864 markings, 32673341 edges, 25504 markings/sec, 240 secs
lola: sara is running 245 secs || 6284692 markings, 33297613 edges, 24166 markings/sec, 245 secs
lola: sara is running 250 secs || 6407728 markings, 33921393 edges, 24607 markings/sec, 250 secs
lola: sara is running 255 secs || 6528272 markings, 34572862 edges, 24109 markings/sec, 255 secs
lola: sara is running 260 secs || 6648560 markings, 35271112 edges, 24058 markings/sec, 260 secs
lola: sara is running 265 secs || 6779333 markings, 35932049 edges, 26155 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 <= p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1378)))
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 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1201 + p1200 + p1199 + p1198 + p1197 + p1196 + p1195 + p1194 + p1193 + p1192 + p1191 + p1190 + p1189 + p1188 + p1187 + p1186 + p1185 + p1184 + p1183)))
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: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182) AND (p1280 <= 0) AND ((3 <= p1340) OR (p1143 + p1142 + p1141 + p1140 + p1139 + p1138 + p1137 + p1136 + p1135 + p1134 + p1133 + p1132 + p1131 + p1130 + p1129 + p1128 + p1127 + p1126 + p1125 <= p1340) OR (p1340 <= 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: 23 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= 0) AND (p1241 + 1 <= p2) AND ((p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + 1 <= p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + ... (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 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
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p1300) OR (p0 <= 0) OR (p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1397 <= p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321 + p1320))))
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: 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 ((((p1220 + p1219 + p1218 + p1217 + p1216 + p1215 + p1214 + p1213 + p1212 + p1211 + p1210 + p1209 + p1208 + p1207 + p1206 + p1205 + p1204 + p1203 + p1202 + 1 <= p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307) OR (p1 <= p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + ... (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 <= p1241) OR (p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1397 <= p973 + p954 + p935 + p916 + p897 + p878 + p859 + p840 + p821 + p802 + p783 + p764 + p745 + p1087 + p1068 + p1049 + p1030 + p1011 + p1010 + p1009 + p1008 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p10... (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 || 138867 markings, 1170977 edges, 27773 markings/sec, 0 secs
lola: sara is running 5 secs || 279764 markings, 2498424 edges, 28179 markings/sec, 5 secs
lola: sara is running 10 secs || 423178 markings, 3882782 edges, 28683 markings/sec, 10 secs
lola: sara is running 15 secs || 565527 markings, 5289086 edges, 28470 markings/sec, 15 secs
lola: sara is running 20 secs || 727448 markings, 6737494 edges, 32384 markings/sec, 20 secs
lola: sara is running 25 secs || 879632 markings, 8184061 edges, 30437 markings/sec, 25 secs
lola: sara is running 30 secs || 1022208 markings, 9648811 edges, 28515 markings/sec, 30 secs
lola: sara is running 35 secs || 1180619 markings, 11080718 edges, 31682 markings/sec, 35 secs
lola: sara is running 40 secs || 1337682 markings, 12540926 edges, 31413 markings/sec, 40 secs
lola: sara is running 45 secs || 1487994 markings, 14006644 edges, 30062 markings/sec, 45 secs
lola: sara is running 50 secs || 1638250 markings, 15463669 edges, 30051 markings/sec, 50 secs
lola: sara is running 55 secs || 1797768 markings, 16907018 edges, 31904 markings/sec, 55 secs
lola: sara is running 60 secs || 1950292 markings, 18370829 edges, 30505 markings/sec, 60 secs
lola: sara is running 65 secs || 2091539 markings, 19849156 edges, 28249 markings/sec, 65 secs
lola: sara is running 70 secs || 2257598 markings, 21279857 edges, 33212 markings/sec, 70 secs
lola: sara is running 75 secs || 2410866 markings, 22727922 edges, 30654 markings/sec, 75 secs
lola: sara is running 80 secs || 2554226 markings, 24160321 edges, 28672 markings/sec, 80 secs
lola: sara is running 85 secs || 2706970 markings, 25586328 edges, 30549 markings/sec, 85 secs
lola: sara is running 90 secs || 2863141 markings, 27037046 edges, 31234 markings/sec, 90 secs
lola: sara is running 95 secs || 3017611 markings, 28529825 edges, 30894 markings/sec, 95 secs
lola: sara is running 100 secs || 3164362 markings, 30013043 edges, 29350 markings/sec, 100 secs
lola: sara is running 105 secs || 3333644 markings, 31495538 edges, 33856 markings/sec, 105 secs
lola: sara is running 110 secs || 3489671 markings, 32978431 edges, 31205 markings/sec, 110 secs
lola: sara is running 115 secs || 3633278 markings, 34439525 edges, 28721 markings/sec, 115 secs
lola: sara is running 120 secs || 3790678 markings, 35868877 edges, 31480 markings/sec, 120 secs
lola: sara is running 125 secs || 3942343 markings, 37299858 edges, 30333 markings/sec, 125 secs
lola: sara is running 130 secs || 4094010 markings, 38756939 edges, 30333 markings/sec, 130 secs
lola: sara is running 135 secs || 4243120 markings, 40218113 edges, 29822 markings/sec, 135 secs
lola: sara is running 140 secs || 4403952 markings, 41661952 edges, 32166 markings/sec, 140 secs
lola: sara is running 145 secs || 4553876 markings, 43094586 edges, 29985 markings/sec, 145 secs
lola: sara is running 150 secs || 4694866 markings, 44543125 edges, 28198 markings/sec, 150 secs
lola: sara is running 155 secs || 4853406 markings, 45965524 edges, 31708 markings/sec, 155 secs
lola: sara is running 160 secs || 5008063 markings, 47409198 edges, 30931 markings/sec, 160 secs
lola: sara is running 165 secs || 5159482 markings, 48887626 edges, 30284 markings/sec, 165 secs
lola: sara is running 170 secs || 5307994 markings, 50325677 edges, 29702 markings/sec, 170 secs
lola: sara is running 175 secs || 5471087 markings, 51807417 edges, 32619 markings/sec, 175 secs
lola: sara is running 180 secs || 5621827 markings, 53250717 edges, 30148 markings/sec, 180 secs
lola: sara is running 185 secs || 5762009 markings, 54719725 edges, 28036 markings/sec, 185 secs
lola: sara is running 190 secs || 5910614 markings, 55996278 edges, 29721 markings/sec, 190 secs
lola: sara is running 195 secs || 6053773 markings, 57345730 edges, 28632 markings/sec, 195 secs
lola: sara is running 200 secs || 6193136 markings, 58702343 edges, 27873 markings/sec, 200 secs
lola: sara is running 205 secs || 6330455 markings, 60058501 edges, 27464 markings/sec, 205 secs
lola: sara is running 210 secs || 6479484 markings, 61381137 edges, 29806 markings/sec, 210 secs
lola: sara is running 215 secs || 6622048 markings, 62739196 edges, 28513 markings/sec, 215 secs
lola: sara is running 220 secs || 6758440 markings, 64105759 edges, 27278 markings/sec, 220 secs
lola: sara is running 225 secs || 6898360 markings, 65408814 edges, 27984 markings/sec, 225 secs
lola: sara is running 230 secs || 7045426 markings, 66766238 edges, 29413 markings/sec, 230 secs
lola: sara is running 235 secs || 7187563 markings, 68117624 edges, 28427 markings/sec, 235 secs
lola: sara is running 240 secs || 7322886 markings, 69522296 edges, 27065 markings/sec, 240 secs
lola: sara is running 245 secs || 7466416 markings, 70791455 edges, 28706 markings/sec, 245 secs
lola: sara is running 250 secs || 7596401 markings, 72019625 edges, 25997 markings/sec, 250 secs
lola: sara is running 255 secs || 7734095 markings, 73339749 edges, 27539 markings/sec, 255 secs
lola: sara is running 260 secs || 7862192 markings, 74680838 edges, 25619 markings/sec, 260 secs
lola: sara is running 265 secs || 8009570 markings, 75934188 edges, 29476 markings/sec, 265 secs
lola: sara is running 270 secs || 8155934 markings, 77313877 edges, 29273 markings/sec, 270 secs
lola: sara is running 275 secs || 8297139 markings, 78688752 edges, 28241 markings/sec, 275 secs
lola: sara is running 280 secs || 8435386 markings, 80045001 edges, 27649 markings/sec, 280 secs
lola: sara is running 285 secs || 8587774 markings, 81414039 edges, 30478 markings/sec, 285 secs
lola: sara is running 290 secs || 8732937 markings, 82789463 edges, 29033 markings/sec, 290 secs
lola: sara is running 295 secs || 8870106 markings, 84179042 edges, 27434 markings/sec, 295 secs
lola: sara is running 300 secs || 9020917 markings, 85556452 edges, 30162 markings/sec, 300 secs
lola: sara is running 305 secs || 9170535 markings, 86976268 edges, 29924 markings/sec, 305 secs
lola: sara is running 310 secs || 9317723 markings, 88375448 edges, 29438 markings/sec, 310 secs
lola: sara is running 315 secs || 9456356 markings, 89785408 edges, 27727 markings/sec, 315 secs
lola: sara is running 320 secs || 9613211 markings, 91150090 edges, 31371 markings/sec, 320 secs
lola: sara is running 325 secs || 9756580 markings, 92513967 edges, 28674 markings/sec, 325 secs
lola: sara is running 330 secs || 9897141 markings, 93921879 edges, 28112 markings/sec, 330 secs
lola: sara is running 335 secs || 10042645 markings, 95280605 edges, 29101 markings/sec, 335 secs
lola: sara is running 340 secs || 10192038 markings, 96657884 edges, 29879 markings/sec, 340 secs
lola: sara is running 345 secs || 10335251 markings, 98022438 edges, 28643 markings/sec, 345 secs
lola: sara is running 350 secs || 10470114 markings, 99424149 edges, 26973 markings/sec, 350 secs
lola: sara is running 355 secs || 10605055 markings, 100605209 edges, 26988 markings/sec, 355 secs
lola: sara is running 360 secs || 10728402 markings, 101757254 edges, 24669 markings/sec, 360 secs
lola: sara is running 365 secs || 10850186 markings, 102909518 edges, 24357 markings/sec, 365 secs
lola: sara is running 370 secs || 10962106 markings, 104048316 edges, 22384 markings/sec, 370 secs
lola: sara is running 375 secs || 11085990 markings, 105196945 edges, 24777 markings/sec, 375 secs
lola: sara is running 380 secs || 11216877 markings, 106385130 edges, 26177 markings/sec, 380 secs
lola: sara is running 385 secs || 11340320 markings, 107563139 edges, 24689 markings/sec, 385 secs
lola: sara is running 390 secs || 11457015 markings, 108719709 edges, 23339 markings/sec, 390 secs
lola: sara is running 395 secs || 11580372 markings, 109922931 edges, 24671 markings/sec, 395 secs
lola: sara is running 400 secs || 11717612 markings, 111141584 edges, 27448 markings/sec, 400 secs
lola: sara is running 405 secs || 11843074 markings, 112333492 edges, 25092 markings/sec, 405 secs
lola: sara is running 410 secs || 11965669 markings, 113539101 edges, 24519 markings/sec, 410 secs
lola: sara is running 415 secs || 12084181 markings, 114738967 edges, 23702 markings/sec, 415 secs
lola: sara is running 420 secs || 12225682 markings, 115973417 edges, 28300 markings/sec, 420 secs
lola: sara is running 425 secs || 12353447 markings, 117192331 edges, 25553 markings/sec, 425 secs
lola: sara is running 430 secs || 12478844 markings, 118408634 edges, 25079 markings/sec, 430 secs
lola: sara is running 435 secs || 12595827 markings, 119622980 edges, 23397 markings/sec, 435 secs
lola: sara is running 440 secs || 12737323 markings, 120839045 edges, 28299 markings/sec, 440 secs
lola: sara is running 445 secs || 12868340 markings, 122083741 edges, 26203 markings/sec, 445 secs
lola: sara is running 450 secs || 12995836 markings, 123317493 edges, 25499 markings/sec, 450 secs
lola: sara is running 455 secs || 13115476 markings, 124571375 edges, 23928 markings/sec, 455 secs
lola: sara is running 460 secs || 13258950 markings, 125796948 edges, 28695 markings/sec, 460 secs
lola: sara is running 465 secs || 13392513 markings, 127063495 edges, 26713 markings/sec, 465 secs
lola: sara is running 470 secs || 13522874 markings, 128324635 edges, 26072 markings/sec, 470 secs
lola: sara is running 475 secs || 13651468 markings, 129637307 edges, 25719 markings/sec, 475 secs
lola: sara is running 480 secs || 13794427 markings, 130880671 edges, 28592 markings/sec, 480 secs
lola: sara is running 485 secs || 13927824 markings, 132146192 edges, 26679 markings/sec, 485 secs
lola: sara is running 490 secs || 14057099 markings, 133408844 edges, 25855 markings/sec, 490 secs
lola: sara is running 495 secs || 14187521 markings, 134714240 edges, 26084 markings/sec, 495 secs
lola: sara is running 500 secs || 14334252 markings, 136000114 edges, 29346 markings/sec, 500 secs
lola: sara is running 505 secs || 14473243 markings, 137320484 edges, 27798 markings/sec, 505 secs
lola: sara is running 510 secs || 14605522 markings, 138634252 edges, 26456 markings/sec, 510 secs
lola: sara is running 515 secs || 14743979 markings, 139966240 edges, 27691 markings/sec, 515 secs
lola: sara is running 520 secs || 14893925 markings, 141317806 edges, 29989 markings/sec, 520 secs
lola: sara is running 525 secs || 15039570 markings, 142708336 edges, 29129 markings/sec, 525 secs
lola: sara is running 530 secs || 15175951 markings, 144106874 edges, 27276 markings/sec, 530 secs
lola: sara is running 535 secs || 15312805 markings, 145329117 edges, 27371 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 <= p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321 + p1320)))
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 (((p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + 1 <= p1339) OR (p1280 <= 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: ========================================
lola: subprocess 13 will run for 905 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1225 + p1224 + p1223 + p1222 + p1221 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 <= p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321 + p1320) OR (p1300 <= p1225 + p1224 + p1223 + p1222 + p1221 + p1226 + p1227 + p1228 + p1229 + p1... (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 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 ((p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 <= p1220 + p1219 + p1218 + p1217 + p1216 + p1215 + p1214 + p1213 + p1212 + p1211 + p1210 + p1209 + p1208 + p1207 + p1206 + p1205 + p1204 + p1203 + p1202)))
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: state equation: calling and running sara
sara: try reading problem file 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 (((p1124 + p1123 + p1122 + p1121 + p1120 + p1119 + p1118 + p1117 + p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106 + 1 <= p1339) AND (2 <= p1241) AND (p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 <= p22))))
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 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-18"
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-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-full"
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 r138-qhx2-152673580400033"
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 ;