Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872400805.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is QuasiCertifProtocol-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400805
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 26K Apr 12 06:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 06:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 07:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 07:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 10 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 9 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 9 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 27K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 686K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591182460211

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 11:07:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 11:07:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 11:07:41] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2020-06-03 11:07:41] [INFO ] Transformed 1398 places.
[2020-06-03 11:07:41] [INFO ] Transformed 296 transitions.
[2020-06-03 11:07:41] [INFO ] Parsed PT model containing 1398 places and 296 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 24 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2020-06-03 11:07:42] [INFO ] Flatten gal took : 107 ms
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 296 rows 1398 cols
[2020-06-03 11:07:42] [INFO ] Computed 1103 place invariants in 49 ms
Support contains 749 out of 1398 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1398/1398 places, 296/296 transitions.
Discarding 59 places :
Also discarding 0 output transitions
Graph (complete) has 9608 edges and 1398 vertex of which 1339 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.14 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1339 transition count 295
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 23 place count 1339 transition count 274
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 44 place count 1318 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 1317 transition count 273
Applied a total of 45 rules in 173 ms. Remains 1317 /1398 variables (removed 81) and now considering 273/296 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 1317/1398 places, 273/296 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 273 rows 1317 cols
[2020-06-03 11:07:42] [INFO ] Computed 1046 place invariants in 39 ms
Support contains 749 out of 1317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1317/1317 places, 273/273 transitions.
Applied a total of 0 rules in 30 ms. Remains 1317 /1317 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1317/1317 places, 273/273 transitions.
Starting structural reductions, iteration 0 : 1317/1317 places, 273/273 transitions.
Applied a total of 0 rules in 29 ms. Remains 1317 /1317 variables (removed 0) and now considering 273/273 (removed 0) transitions.
// Phase 1: matrix 273 rows 1317 cols
[2020-06-03 11:07:42] [INFO ] Computed 1046 place invariants in 36 ms
[2020-06-03 11:07:46] [INFO ] Implicit Places using invariants in 4118 ms returned []
// Phase 1: matrix 273 rows 1317 cols
[2020-06-03 11:07:46] [INFO ] Computed 1046 place invariants in 79 ms
[2020-06-03 11:07:55] [INFO ] Implicit Places using invariants and state equation in 8645 ms returned [794, 795, 796, 797, 798, 799, 800, 801, 803, 907, 908, 909, 910, 911, 912, 913, 914, 915, 1156, 1157, 1158, 1159, 1160, 1161, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1277, 1278, 1279, 1280, 1283]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 12774 ms to find 37 implicit places.
[2020-06-03 11:07:55] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 273 rows 1280 cols
[2020-06-03 11:07:55] [INFO ] Computed 1010 place invariants in 37 ms
[2020-06-03 11:07:57] [INFO ] Dead Transitions using invariants and state equation in 2206 ms returned []
Starting structural reductions, iteration 1 : 1280/1317 places, 273/273 transitions.
Applied a total of 0 rules in 41 ms. Remains 1280 /1280 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2020-06-03 11:07:57] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 273 rows 1280 cols
[2020-06-03 11:07:57] [INFO ] Computed 1010 place invariants in 22 ms
[2020-06-03 11:07:59] [INFO ] Dead Transitions using invariants and state equation in 2208 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1280/1317 places, 273/273 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 273 rows 1280 cols
[2020-06-03 11:07:59] [INFO ] Computed 1010 place invariants in 15 ms
Support contains 749 out of 1280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1280/1280 places, 273/273 transitions.
Applied a total of 0 rules in 17 ms. Remains 1280 /1280 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1280/1280 places, 273/273 transitions.
Starting structural reductions, iteration 0 : 1280/1280 places, 273/273 transitions.
Applied a total of 0 rules in 14 ms. Remains 1280 /1280 variables (removed 0) and now considering 273/273 (removed 0) transitions.
// Phase 1: matrix 273 rows 1280 cols
[2020-06-03 11:07:59] [INFO ] Computed 1010 place invariants in 15 ms
[2020-06-03 11:08:03] [INFO ] Implicit Places using invariants in 3552 ms returned []
// Phase 1: matrix 273 rows 1280 cols
[2020-06-03 11:08:03] [INFO ] Computed 1010 place invariants in 18 ms
[2020-06-03 11:08:11] [INFO ] Implicit Places using invariants and state equation in 8293 ms returned []
Implicit Place search using SMT with State Equation took 11853 ms to find 0 implicit places.
[2020-06-03 11:08:11] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 273 rows 1280 cols
[2020-06-03 11:08:11] [INFO ] Computed 1010 place invariants in 38 ms
[2020-06-03 11:08:14] [INFO ] Dead Transitions using invariants and state equation in 2204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1280/1280 places, 273/273 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Applied a total of 0 rules in 29 ms. Remains 1280 /1280 variables (removed 0) and now considering 273/273 (removed 0) transitions.
// Phase 1: matrix 273 rows 1280 cols
[2020-06-03 11:08:14] [INFO ] Computed 1010 place invariants in 27 ms
[2020-06-03 11:08:14] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2020-06-03 11:08:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ QuasiCertifProtocol-PT-18 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-03 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-04 361 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-02 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-00 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-05 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-07 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-06 361 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for UpperBounds @ QuasiCertifProtocol-PT-18

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=UpperBounds.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--timelimit=3570",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 11:08:14 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": -1,
"cont": 1,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "MAX(p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222 + p1221 + p1264 + p1265 + p1266 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279)",
"processed_size": 154,
"rewrites": 0
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "search",
"value": 19
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": -1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 1,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "MAX(p862 + p861 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p860 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + 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 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1147 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203)",
"processed_size": 2733,
"rewrites": 0
},
"result":
{
"edges": 78,
"markings": 79,
"produced_by": "search",
"value": 361
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p0)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 10
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p0)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 10
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p110)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p19)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 79,
"markings": 80,
"produced_by": "search",
"value": 10
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p19)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 79,
"markings": 80,
"produced_by": "search",
"value": 10
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p620)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p567)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p1227)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p703)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p794)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p667)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p1184)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 60,
"markings": 61,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p454)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 80,
"markings": 81,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 361,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 361,
"visible_transitions": 0
},
"processed": "MAX(p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p143 + p144 + p145 + p146 + p151 + p167 + p184 + p215 + p231 + p235 + p263 + p275 + p295 + p327 + p328 + p455 + p435 + p423 + p391 + p360 + p359 + p358 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p357 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p356 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p355 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p354 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + p303 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p142 + p141 + p140 + p139 + p138 + p137 + p136)",
"processed_size": 2529,
"rewrites": 0
},
"result":
{
"edges": 116,
"markings": 117,
"produced_by": "search",
"value": 361
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 27092,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 2884,
"conflict_clusters": 25,
"places": 1280,
"places_significant": 270,
"singleton_clusters": 0,
"transitions": 273
},
"result":
{
"preliminary_value": "10 1 10 19 361 10 361 10 1 1 1 1 1 1 1 1 ",
"value": "10 1 10 19 361 10 361 10 1 1 1 1 1 1 1 1 "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1553/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 40960
lola: finding significant places
lola: 1280 places, 273 transitions, 270 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from UpperBounds.xml
lola: MAX(p0) : MAX(p110) : MAX(p0) : MAX(p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222 + p1221 + p1264 + p1265 + p1266 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279) : MAX(p862 + p861 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p860 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + 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 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1147 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203) : MAX(p19) : MAX(p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p143 + p144 + p145 + p146 + p151 + p167 + p184 + p215 + p231 + p235 + p263 + p275 + p295 + p327 + p328 + p455 + p435 + p423 + p391 + p360 + p359 + p358 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p357 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p356 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p355 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p354 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338 + p337 + p336 + p335 + p334 + p333 + p332 + p331 + p330 + p329 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304 + p303 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p294 + p293 + p292 + p291 + p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + p279 + p278 + p277 + p276 + p274 + p273 + p272 + p271 + p270 + p269 + p268 + p267 + p266 + p265 + p264 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p230 + p229 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p214 + p213 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p183 + p182 + p181 + p180 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p169 + p168 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p142 + p141 + p140 + p139 + p138 + p137 + p136) : MAX(p19) : MAX(p620) : MAX(p567) : MAX(p1227) : MAX(p703) : MAX(p794) : MAX(p667) : MAX(p1184) : MAX(p454)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222 + p1221 + p1264 + p1265 + p1266 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222 + p1221 + p1264 + p1265 + p1266 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279)
lola: processed formula length: 154
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p862 + p861 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p860 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p862 + p861 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p860 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899... (shortened)
lola: processed formula length: 2733
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 361
lola: SUBRESULT
lola: result: 361
lola: produced by: state space
lola: The maximum value of the given expression is 361
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p19)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p19)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p620)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p620)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p567)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p567)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1227)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1227)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p703)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p703)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p794)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p794)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p667)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p667)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1184)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1184)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p454)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p454)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 81 markings, 80 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p143 + p144 + p145 + p146 + p151 + p167 + p184 + p215 + p231 + p235 + p263 + p275 + p295 + p327 + p328 + p455 + p435 + p423 + p391 + p360 + p359 + p358 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p143 + p144 + p145 + p146 + p151 + p167 + p184 + p215 + p231 + p235 + p263 + p275 + p295 + p327 + p328 + p455 + p435 + p423 + p391 + p360 + p359 + p358 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379... (shortened)
lola: processed formula length: 2529
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 361
lola: SUBRESULT
lola: result: 361
lola: produced by: state space
lola: The maximum value of the given expression is 361
lola: 117 markings, 116 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 10 1 10 19 361 10 361 10 1 1 1 1 1 1 1 1
lola:
preliminary result: 10 1 10 19 361 10 361 10 1 1 1 1 1 1 1 1
lola: memory consumption: 27092 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itslola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is QuasiCertifProtocol-PT-18, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872400805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;