MCC'2021- Execution of r159-oct2-162089268100275

About the Execution of ITS-Tools for PolyORBLF-PT-S04J04T08

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16247.812	3600000.00	3205330.00	252264.90	10 1 1 10 1 4 1 4 1 1 ? 1 1 1 ? 4	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268100275.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-PT-S04J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268100275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.2M
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 523K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 456K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 27 09:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Mar 27 09:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 48K Mar 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K Mar 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.8M May 5 16:51 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 PolyORBLF-PT-S04J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621200681337

Running Version 0
[2021-05-16 21:31:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 21:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 21:31:23] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2021-05-16 21:31:23] [INFO ] Transformed 712 places.
[2021-05-16 21:31:23] [INFO ] Transformed 4012 transitions.
[2021-05-16 21:31:23] [INFO ] Parsed PT model containing 712 places and 4012 transitions in 345 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Normalized transition count is 1812 out of 1844 initially.
// Phase 1: matrix 1812 rows 712 cols
[2021-05-16 21:31:23] [INFO ] Computed 54 place invariants in 154 ms
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :32
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :31
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :30
[2021-05-16 21:31:24] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2021-05-16 21:31:24] [INFO ] Computed 54 place invariants in 64 ms
[2021-05-16 21:31:24] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2021-05-16 21:31:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned unsat
[2021-05-16 21:31:24] [INFO ] [Real]Absence check using 13 positive place invariants in 97 ms returned sat
[2021-05-16 21:31:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 40 ms returned unsat
[2021-05-16 21:31:24] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2021-05-16 21:31:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 69 ms returned unsat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 62 ms returned unsat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 21 ms returned unsat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned unsat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned unsat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 40 ms returned unsat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-16 21:31:25] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 27 ms returned sat
[2021-05-16 21:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:31:27] [INFO ] [Real]Absence check using state equation in 1729 ms returned sat
[2021-05-16 21:31:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:31:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2021-05-16 21:31:27] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned sat
[2021-05-16 21:31:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:31:32] [INFO ] [Nat]Absence check using state equation in 4915 ms returned unknown
[2021-05-16 21:31:32] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-16 21:31:32] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 31 ms returned unsat
[2021-05-16 21:31:32] [INFO ] [Real]Absence check using 13 positive place invariants in 36 ms returned sat
[2021-05-16 21:31:32] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 21 ms returned unsat
[2021-05-16 21:31:32] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-16 21:31:32] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 29 ms returned sat
[2021-05-16 21:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:31:34] [INFO ] [Real]Absence check using state equation in 1742 ms returned sat
[2021-05-16 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:31:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2021-05-16 21:31:34] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 61 ms returned sat
[2021-05-16 21:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:31:39] [INFO ] [Nat]Absence check using state equation in 4792 ms returned unknown
[2021-05-16 21:31:39] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-16 21:31:39] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 29 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 1, 4, 1, 4, 1, 1, -1, 1, 1, -1, 4] Max seen :[10, 1, 1, 4, 1, 4, 1, 1, 1, 1, 1, 1, 4]
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 712 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 148 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 308 place count 556 transition count 1692
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 468 place count 476 transition count 1612
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 484 place count 476 transition count 1596
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 500 place count 460 transition count 1596
Applied a total of 500 rules in 276 ms. Remains 460 /712 variables (removed 252) and now considering 1596/1844 (removed 248) transitions.
[2021-05-16 21:31:40] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
// Phase 1: matrix 1564 rows 460 cols
[2021-05-16 21:31:40] [INFO ] Computed 50 place invariants in 31 ms
[2021-05-16 21:31:40] [INFO ] Dead Transitions using invariants and state equation in 858 ms returned [1016, 1018, 1019, 1020, 1021, 1023, 1024, 1025, 1027, 1028, 1029, 1030, 1031, 1032, 1034, 1035, 1036, 1037, 1038, 1039, 1041, 1042, 1043, 1044, 1046, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1059, 1060, 1061, 1062, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1072, 1073, 1074, 1075, 1076, 1078, 1080, 1081, 1083, 1084, 1089, 1090, 1093, 1094, 1095, 1096, 1097, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1114, 1116, 1117, 1119, 1120, 1122, 1124, 1125, 1126, 1128, 1129, 1131, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1141, 1142, 1143, 1144, 1146, 1147, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1157, 1158, 1159, 1161, 1162, 1164, 1165, 1166, 1167, 1168, 1171, 1174, 1175, 1177, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1192, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1213, 1214, 1215, 1217, 1218, 1219, 1221, 1223, 1224, 1225, 1226, 1235, 1236, 1238, 1239, 1241, 1242, 1244, 1245, 1246, 1247, 1248, 1249, 1251, 1254, 1255, 1256, 1257, 1258, 1260, 1261, 1263, 1264, 1265, 1266, 1268, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1279, 1280, 1281, 1283, 1284, 1285, 1286, 1287, 1288, 1290, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1300, 1301, 1302, 1303, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1317, 1319, 1322, 1323, 1324, 1325, 1329, 1330, 1331, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1355, 1357, 1358, 1359, 1360, 1361, 1363, 1364, 1365, 1366, 1367, 1369, 1370, 1371, 1372, 1377, 1378, 1379, 1380, 1381, 1383, 1384, 1385, 1389, 1390, 1391, 1392, 1393, 1395, 1396, 1397, 1398, 1399, 1401, 1402, 1403, 1405, 1406, 1407, 1408, 1410, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1421, 1423, 1424, 1425, 1426, 1428, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1438, 1440, 1441, 1442, 1443, 1444, 1445, 1447, 1448, 1449, 1450, 1451, 1452, 1454, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1466, 1470, 1472, 1473, 1474, 1475, 1476, 1477, 1479, 1480, 1481, 1482, 1483, 1485, 1486, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1510, 1511, 1512, 1513, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1532, 1533, 1535, 1537, 1538, 1539, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1558, 1559, 1560, 1561, 1562, 1563, 1564, 1566, 1568, 1569, 1570, 1571, 1573, 1574, 1575, 1577, 1578, 1579, 1581, 1582, 1583, 1585, 1586, 1587]
Found 432 dead transitions using SMT.
Drop transitions removed 432 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 432 transitions :[1587, 1586, 1585, 1583, 1582, 1581, 1579, 1578, 1577, 1575, 1574, 1573, 1571, 1570, 1569, 1568, 1566, 1564, 1563, 1562, 1561, 1560, 1559, 1558, 1554, 1553, 1552, 1551, 1550, 1549, 1548, 1547, 1546, 1545, 1544, 1543, 1539, 1538, 1537, 1535, 1533, 1532, 1530, 1529, 1528, 1527, 1526, 1525, 1524, 1523, 1522, 1521, 1520, 1519, 1513, 1512, 1511, 1510, 1508, 1507, 1506, 1505, 1504, 1503, 1502, 1501, 1500, 1499, 1497, 1496, 1495, 1494, 1493, 1492, 1491, 1490, 1489, 1486, 1485, 1483, 1482, 1481, 1480, 1479, 1477, 1476, 1475, 1474, 1473, 1472, 1470, 1466, 1464, 1463, 1462, 1461, 1460, 1459, 1458, 1457, 1456, 1454, 1452, 1451, 1450, 1449, 1448, 1447, 1445, 1444, 1443, 1442, 1441, 1440, 1438, 1436, 1435, 1434, 1433, 1432, 1431, 1430, 1428, 1426, 1425, 1424, 1423, 1421, 1419, 1418, 1417, 1416, 1415, 1414, 1413, 1412, 1410, 1408, 1407, 1406, 1405, 1403, 1402, 1401, 1399, 1398, 1397, 1396, 1395, 1393, 1392, 1391, 1390, 1389, 1385, 1384, 1383, 1381, 1380, 1379, 1378, 1377, 1372, 1371, 1370, 1369, 1367, 1366, 1365, 1364, 1363, 1361, 1360, 1359, 1358, 1357, 1355, 1352, 1351, 1350, 1349, 1348, 1347, 1346, 1345, 1344, 1343, 1342, 1340, 1339, 1338, 1337, 1336, 1335, 1334, 1333, 1331, 1330, 1329, 1325, 1324, 1323, 1322, 1319, 1317, 1315, 1314, 1313, 1312, 1311, 1310, 1309, 1308, 1307, 1306, 1305, 1303, 1302, 1301, 1300, 1298, 1297, 1296, 1295, 1294, 1293, 1292, 1290, 1288, 1287, 1286, 1285, 1284, 1283, 1281, 1280, 1279, 1277, 1276, 1275, 1274, 1273, 1272, 1271, 1270, 1268, 1266, 1265, 1264, 1263, 1261, 1260, 1258, 1257, 1256, 1255, 1254, 1251, 1249, 1248, 1247, 1246, 1245, 1244, 1242, 1241, 1239, 1238, 1236, 1235, 1226, 1225, 1224, 1223, 1221, 1219, 1218, 1217, 1215, 1214, 1213, 1211, 1210, 1209, 1208, 1207, 1206, 1205, 1204, 1203, 1202, 1201, 1200, 1199, 1198, 1197, 1196, 1195, 1192, 1190, 1189, 1188, 1187, 1186, 1185, 1184, 1183, 1182, 1181, 1180, 1179, 1177, 1175, 1174, 1171, 1168, 1167, 1166, 1165, 1164, 1162, 1161, 1159, 1158, 1157, 1155, 1154, 1153, 1152, 1151, 1150, 1149, 1147, 1146, 1144, 1143, 1142, 1141, 1140, 1139, 1138, 1137, 1136, 1135, 1134, 1131, 1129, 1128, 1126, 1125, 1124, 1122, 1120, 1119, 1117, 1116, 1114, 1112, 1111, 1110, 1109, 1108, 1107, 1106, 1105, 1104, 1103, 1102, 1101, 1100, 1099, 1097, 1096, 1095, 1094, 1093, 1090, 1089, 1084, 1083, 1081, 1080, 1078, 1076, 1075, 1074, 1073, 1072, 1070, 1069, 1068, 1067, 1066, 1065, 1064, 1062, 1061, 1060, 1059, 1055, 1054, 1053, 1052, 1051, 1050, 1049, 1048, 1046, 1044, 1043, 1042, 1041, 1039, 1038, 1037, 1036, 1035, 1034, 1032, 1031, 1030, 1029, 1028, 1027, 1025, 1024, 1023, 1021, 1020, 1019, 1018, 1016]
Starting structural reductions, iteration 1 : 460/712 places, 1164/1844 transitions.
Applied a total of 0 rules in 25 ms. Remains 460 /460 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 460/712 places, 1164/1844 transitions.
Normalized transition count is 1132 out of 1164 initially.
// Phase 1: matrix 1132 rows 460 cols
[2021-05-16 21:31:40] [INFO ] Computed 50 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 93 resets, run finished after 4251 ms. (steps per millisecond=235 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1633 ms. (steps per millisecond=612 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1650 ms. (steps per millisecond=606 ) properties (out of 2) seen :2
[2021-05-16 21:31:48] [INFO ] Flow matrix only has 1132 transitions (discarded 32 similar events)
// Phase 1: matrix 1132 rows 460 cols
[2021-05-16 21:31:48] [INFO ] Computed 50 place invariants in 15 ms
[2021-05-16 21:31:48] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-16 21:31:48] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 26 ms returned sat
[2021-05-16 21:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:31:49] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2021-05-16 21:31:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:31:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-16 21:31:49] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 13 ms returned sat
[2021-05-16 21:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:31:50] [INFO ] [Nat]Absence check using state equation in 1264 ms returned sat
[2021-05-16 21:31:50] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:31:50] [INFO ] [Nat]Added 168 Read/Feed constraints in 319 ms returned sat
[2021-05-16 21:31:51] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 8 ms to minimize.
[2021-05-16 21:31:51] [INFO ] Deduced a trap composed of 45 places in 315 ms of which 12 ms to minimize.
[2021-05-16 21:31:52] [INFO ] Deduced a trap composed of 211 places in 373 ms of which 13 ms to minimize.
[2021-05-16 21:31:52] [INFO ] Deduced a trap composed of 130 places in 265 ms of which 2 ms to minimize.
[2021-05-16 21:31:52] [INFO ] Deduced a trap composed of 219 places in 236 ms of which 1 ms to minimize.
[2021-05-16 21:31:52] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 0 ms to minimize.
[2021-05-16 21:31:53] [INFO ] Deduced a trap composed of 234 places in 841 ms of which 32 ms to minimize.
[2021-05-16 21:31:54] [INFO ] Deduced a trap composed of 114 places in 277 ms of which 1 ms to minimize.
[2021-05-16 21:31:54] [INFO ] Deduced a trap composed of 210 places in 197 ms of which 0 ms to minimize.
[2021-05-16 21:31:54] [INFO ] Deduced a trap composed of 120 places in 186 ms of which 0 ms to minimize.
[2021-05-16 21:31:54] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 1 ms to minimize.
[2021-05-16 21:31:55] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 0 ms to minimize.
[2021-05-16 21:31:55] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 0 ms to minimize.
[2021-05-16 21:31:55] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:31:55] [INFO ] Deduced a trap composed of 103 places in 183 ms of which 1 ms to minimize.
[2021-05-16 21:31:55] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 0 ms to minimize.
[2021-05-16 21:31:56] [INFO ] Deduced a trap composed of 184 places in 208 ms of which 0 ms to minimize.
[2021-05-16 21:31:56] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 1 ms to minimize.
[2021-05-16 21:31:56] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 1 ms to minimize.
[2021-05-16 21:31:56] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 1 ms to minimize.
[2021-05-16 21:31:57] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 2 ms to minimize.
[2021-05-16 21:31:57] [INFO ] Deduced a trap composed of 127 places in 184 ms of which 8 ms to minimize.
[2021-05-16 21:31:57] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:31:57] [INFO ] Deduced a trap composed of 206 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:31:57] [INFO ] Deduced a trap composed of 199 places in 170 ms of which 0 ms to minimize.
[2021-05-16 21:31:58] [INFO ] Deduced a trap composed of 205 places in 156 ms of which 0 ms to minimize.
[2021-05-16 21:31:58] [INFO ] Deduced a trap composed of 216 places in 148 ms of which 1 ms to minimize.
[2021-05-16 21:31:58] [INFO ] Deduced a trap composed of 203 places in 169 ms of which 0 ms to minimize.
[2021-05-16 21:31:58] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 1 ms to minimize.
[2021-05-16 21:31:59] [INFO ] Deduced a trap composed of 244 places in 178 ms of which 1 ms to minimize.
[2021-05-16 21:31:59] [INFO ] Deduced a trap composed of 208 places in 175 ms of which 0 ms to minimize.
[2021-05-16 21:31:59] [INFO ] Deduced a trap composed of 225 places in 153 ms of which 1 ms to minimize.
[2021-05-16 21:31:59] [INFO ] Deduced a trap composed of 220 places in 154 ms of which 0 ms to minimize.
[2021-05-16 21:32:00] [INFO ] Deduced a trap composed of 218 places in 169 ms of which 1 ms to minimize.
[2021-05-16 21:32:00] [INFO ] Deduced a trap composed of 234 places in 196 ms of which 4 ms to minimize.
[2021-05-16 21:32:00] [INFO ] Deduced a trap composed of 202 places in 166 ms of which 1 ms to minimize.
[2021-05-16 21:32:00] [INFO ] Deduced a trap composed of 186 places in 166 ms of which 1 ms to minimize.
[2021-05-16 21:32:00] [INFO ] Deduced a trap composed of 183 places in 158 ms of which 1 ms to minimize.
[2021-05-16 21:32:01] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 1 ms to minimize.
[2021-05-16 21:32:01] [INFO ] Deduced a trap composed of 198 places in 168 ms of which 1 ms to minimize.
[2021-05-16 21:32:01] [INFO ] Deduced a trap composed of 209 places in 197 ms of which 1 ms to minimize.
[2021-05-16 21:32:01] [INFO ] Deduced a trap composed of 192 places in 174 ms of which 0 ms to minimize.
[2021-05-16 21:32:02] [INFO ] Deduced a trap composed of 187 places in 187 ms of which 1 ms to minimize.
[2021-05-16 21:32:02] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 0 ms to minimize.
[2021-05-16 21:32:02] [INFO ] Deduced a trap composed of 185 places in 179 ms of which 1 ms to minimize.
[2021-05-16 21:32:02] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 1 ms to minimize.
[2021-05-16 21:32:03] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 0 ms to minimize.
[2021-05-16 21:32:03] [INFO ] Deduced a trap composed of 180 places in 154 ms of which 1 ms to minimize.
[2021-05-16 21:32:03] [INFO ] Deduced a trap composed of 196 places in 155 ms of which 0 ms to minimize.
[2021-05-16 21:32:03] [INFO ] Deduced a trap composed of 94 places in 169 ms of which 0 ms to minimize.
[2021-05-16 21:32:03] [INFO ] Deduced a trap composed of 88 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:32:04] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 1 ms to minimize.
[2021-05-16 21:32:04] [INFO ] Deduced a trap composed of 211 places in 206 ms of which 1 ms to minimize.
[2021-05-16 21:32:04] [INFO ] Deduced a trap composed of 183 places in 174 ms of which 1 ms to minimize.
[2021-05-16 21:32:05] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 1 ms to minimize.
[2021-05-16 21:32:05] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:32:05] [INFO ] Deduced a trap composed of 184 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:32:05] [INFO ] Deduced a trap composed of 95 places in 188 ms of which 0 ms to minimize.
[2021-05-16 21:32:06] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:32:06] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 1 ms to minimize.
[2021-05-16 21:32:06] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 1 ms to minimize.
[2021-05-16 21:32:06] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 0 ms to minimize.
[2021-05-16 21:32:07] [INFO ] Deduced a trap composed of 119 places in 156 ms of which 0 ms to minimize.
[2021-05-16 21:32:07] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 1 ms to minimize.
[2021-05-16 21:32:07] [INFO ] Deduced a trap composed of 74 places in 287 ms of which 1 ms to minimize.
[2021-05-16 21:32:07] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 2 ms to minimize.
[2021-05-16 21:32:08] [INFO ] Deduced a trap composed of 186 places in 182 ms of which 2 ms to minimize.
[2021-05-16 21:32:08] [INFO ] Deduced a trap composed of 215 places in 187 ms of which 7 ms to minimize.
[2021-05-16 21:32:08] [INFO ] Deduced a trap composed of 85 places in 265 ms of which 1 ms to minimize.
[2021-05-16 21:32:08] [INFO ] Deduced a trap composed of 88 places in 232 ms of which 1 ms to minimize.
[2021-05-16 21:32:09] [INFO ] Deduced a trap composed of 78 places in 299 ms of which 1 ms to minimize.
[2021-05-16 21:32:09] [INFO ] Deduced a trap composed of 91 places in 221 ms of which 0 ms to minimize.
[2021-05-16 21:32:09] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 1 ms to minimize.
[2021-05-16 21:32:10] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 1 ms to minimize.
[2021-05-16 21:32:10] [INFO ] Deduced a trap composed of 201 places in 174 ms of which 0 ms to minimize.
[2021-05-16 21:32:10] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 0 ms to minimize.
[2021-05-16 21:32:10] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 1 ms to minimize.
[2021-05-16 21:32:10] [INFO ] Deduced a trap composed of 109 places in 157 ms of which 1 ms to minimize.
[2021-05-16 21:32:11] [INFO ] Trap strengthening (SAT) tested/added 79/78 trap constraints in 20141 ms
[2021-05-16 21:32:11] [INFO ] Computed and/alt/rep : 576/2988/552 causal constraints (skipped 576 transitions) in 87 ms.
[2021-05-16 21:32:18] [INFO ] Added : 35 causal constraints over 7 iterations in 7507 ms. Result :unknown
[2021-05-16 21:32:18] [INFO ] [Real]Absence check using 14 positive place invariants in 37 ms returned sat
[2021-05-16 21:32:18] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 16 ms returned sat
[2021-05-16 21:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:32:19] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2021-05-16 21:32:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:32:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-16 21:32:19] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 39 ms returned sat
[2021-05-16 21:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:32:21] [INFO ] [Nat]Absence check using state equation in 1594 ms returned sat
[2021-05-16 21:32:21] [INFO ] [Nat]Added 168 Read/Feed constraints in 430 ms returned sat
[2021-05-16 21:32:21] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 0 ms to minimize.
[2021-05-16 21:32:22] [INFO ] Deduced a trap composed of 204 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:32:22] [INFO ] Deduced a trap composed of 199 places in 191 ms of which 0 ms to minimize.
[2021-05-16 21:32:22] [INFO ] Deduced a trap composed of 208 places in 174 ms of which 1 ms to minimize.
[2021-05-16 21:32:22] [INFO ] Deduced a trap composed of 189 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:32:23] [INFO ] Deduced a trap composed of 214 places in 222 ms of which 0 ms to minimize.
[2021-05-16 21:32:23] [INFO ] Deduced a trap composed of 195 places in 181 ms of which 0 ms to minimize.
[2021-05-16 21:32:23] [INFO ] Deduced a trap composed of 215 places in 252 ms of which 0 ms to minimize.
[2021-05-16 21:32:23] [INFO ] Deduced a trap composed of 222 places in 249 ms of which 0 ms to minimize.
[2021-05-16 21:32:24] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 0 ms to minimize.
[2021-05-16 21:32:24] [INFO ] Deduced a trap composed of 202 places in 275 ms of which 1 ms to minimize.
[2021-05-16 21:32:24] [INFO ] Deduced a trap composed of 92 places in 343 ms of which 1 ms to minimize.
[2021-05-16 21:32:25] [INFO ] Deduced a trap composed of 99 places in 311 ms of which 1 ms to minimize.
[2021-05-16 21:32:25] [INFO ] Deduced a trap composed of 90 places in 442 ms of which 1 ms to minimize.
[2021-05-16 21:32:26] [INFO ] Deduced a trap composed of 208 places in 343 ms of which 0 ms to minimize.
[2021-05-16 21:32:26] [INFO ] Deduced a trap composed of 203 places in 331 ms of which 1 ms to minimize.
[2021-05-16 21:32:26] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 1 ms to minimize.
[2021-05-16 21:32:27] [INFO ] Deduced a trap composed of 177 places in 183 ms of which 1 ms to minimize.
[2021-05-16 21:33:04] [INFO ] Deduced a trap composed of 2 places in 190 ms of which 0 ms to minimize.
[2021-05-16 21:33:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[1, 1]
Incomplete Parikh walk after 294300 steps, including 1002 resets, run finished after 1257 ms. (steps per millisecond=234 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 460 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 460/460 places, 1164/1164 transitions.
Applied a total of 0 rules in 20 ms. Remains 460 /460 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 460/460 places, 1164/1164 transitions.
Starting structural reductions, iteration 0 : 460/460 places, 1164/1164 transitions.
Applied a total of 0 rules in 19 ms. Remains 460 /460 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
[2021-05-16 21:33:06] [INFO ] Flow matrix only has 1132 transitions (discarded 32 similar events)
// Phase 1: matrix 1132 rows 460 cols
[2021-05-16 21:33:06] [INFO ] Computed 50 place invariants in 13 ms
[2021-05-16 21:33:06] [INFO ] Implicit Places using invariants in 475 ms returned [93, 145, 163, 227, 312, 351, 359, 447]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 478 ms to find 8 implicit places.
[2021-05-16 21:33:06] [INFO ] Redundant transitions in 63 ms returned []
[2021-05-16 21:33:06] [INFO ] Flow matrix only has 1132 transitions (discarded 32 similar events)
// Phase 1: matrix 1132 rows 452 cols
[2021-05-16 21:33:06] [INFO ] Computed 42 place invariants in 21 ms
[2021-05-16 21:33:07] [INFO ] Dead Transitions using invariants and state equation in 658 ms returned []
Starting structural reductions, iteration 1 : 452/460 places, 1164/1164 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 446 transition count 1158
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 446 transition count 1158
Applied a total of 12 rules in 96 ms. Remains 446 /452 variables (removed 6) and now considering 1158/1164 (removed 6) transitions.
[2021-05-16 21:33:07] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:33:07] [INFO ] Computed 42 place invariants in 15 ms
[2021-05-16 21:33:07] [INFO ] Implicit Places using invariants in 437 ms returned []
[2021-05-16 21:33:07] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:33:07] [INFO ] Computed 42 place invariants in 15 ms
[2021-05-16 21:33:08] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:33:20] [INFO ] Implicit Places using invariants and state equation in 12895 ms returned []
Implicit Place search using SMT with State Equation took 13337 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 446/460 places, 1158/1164 transitions.
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:33:20] [INFO ] Computed 42 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 104 resets, run finished after 3912 ms. (steps per millisecond=255 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties (out of 2) seen :2
[2021-05-16 21:33:27] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:33:27] [INFO ] Computed 42 place invariants in 22 ms
[2021-05-16 21:33:27] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 21:33:27] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2021-05-16 21:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:33:28] [INFO ] [Real]Absence check using state equation in 1142 ms returned sat
[2021-05-16 21:33:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:33:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 21:33:28] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2021-05-16 21:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:33:31] [INFO ] [Nat]Absence check using state equation in 2211 ms returned sat
[2021-05-16 21:33:31] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:33:31] [INFO ] [Nat]Added 168 Read/Feed constraints in 513 ms returned sat
[2021-05-16 21:33:31] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:33:32] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 1 ms to minimize.
[2021-05-16 21:33:32] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:33:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1041 ms
[2021-05-16 21:33:32] [INFO ] Computed and/alt/rep : 564/2927/540 causal constraints (skipped 582 transitions) in 83 ms.
[2021-05-16 21:33:38] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 1 ms to minimize.
[2021-05-16 21:33:39] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 0 ms to minimize.
[2021-05-16 21:33:39] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 0 ms to minimize.
[2021-05-16 21:33:39] [INFO ] Deduced a trap composed of 200 places in 168 ms of which 1 ms to minimize.
[2021-05-16 21:33:39] [INFO ] Deduced a trap composed of 188 places in 159 ms of which 1 ms to minimize.
[2021-05-16 21:33:40] [INFO ] Deduced a trap composed of 191 places in 154 ms of which 0 ms to minimize.
[2021-05-16 21:33:40] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2021-05-16 21:33:40] [INFO ] Deduced a trap composed of 212 places in 147 ms of which 0 ms to minimize.
[2021-05-16 21:33:40] [INFO ] Deduced a trap composed of 177 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:33:41] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 1 ms to minimize.
[2021-05-16 21:33:41] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2021-05-16 21:33:41] [INFO ] Deduced a trap composed of 202 places in 180 ms of which 1 ms to minimize.
[2021-05-16 21:33:41] [INFO ] Deduced a trap composed of 181 places in 150 ms of which 0 ms to minimize.
[2021-05-16 21:33:41] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 0 ms to minimize.
[2021-05-16 21:33:42] [INFO ] Deduced a trap composed of 190 places in 159 ms of which 0 ms to minimize.
[2021-05-16 21:33:42] [INFO ] Deduced a trap composed of 184 places in 181 ms of which 0 ms to minimize.
[2021-05-16 21:33:42] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 0 ms to minimize.
[2021-05-16 21:33:42] [INFO ] Deduced a trap composed of 193 places in 171 ms of which 0 ms to minimize.
[2021-05-16 21:33:43] [INFO ] Deduced a trap composed of 189 places in 168 ms of which 0 ms to minimize.
[2021-05-16 21:33:43] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:33:43] [INFO ] Deduced a trap composed of 159 places in 208 ms of which 1 ms to minimize.
[2021-05-16 21:33:43] [INFO ] Deduced a trap composed of 190 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:33:44] [INFO ] Deduced a trap composed of 193 places in 169 ms of which 1 ms to minimize.
[2021-05-16 21:33:44] [INFO ] Deduced a trap composed of 196 places in 184 ms of which 0 ms to minimize.
[2021-05-16 21:33:44] [INFO ] Deduced a trap composed of 120 places in 154 ms of which 0 ms to minimize.
[2021-05-16 21:33:45] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 0 ms to minimize.
[2021-05-16 21:33:45] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 0 ms to minimize.
[2021-05-16 21:33:45] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 0 ms to minimize.
[2021-05-16 21:33:45] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 1 ms to minimize.
[2021-05-16 21:33:46] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 1 ms to minimize.
[2021-05-16 21:33:46] [INFO ] Deduced a trap composed of 190 places in 138 ms of which 1 ms to minimize.
[2021-05-16 21:33:46] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 1 ms to minimize.
[2021-05-16 21:33:47] [INFO ] Deduced a trap composed of 172 places in 157 ms of which 0 ms to minimize.
[2021-05-16 21:33:48] [INFO ] Deduced a trap composed of 210 places in 161 ms of which 0 ms to minimize.
[2021-05-16 21:33:48] [INFO ] Deduced a trap composed of 85 places in 177 ms of which 0 ms to minimize.
[2021-05-16 21:33:48] [INFO ] Deduced a trap composed of 186 places in 207 ms of which 0 ms to minimize.
[2021-05-16 21:33:49] [INFO ] Deduced a trap composed of 165 places in 188 ms of which 0 ms to minimize.
[2021-05-16 21:33:49] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 1 ms to minimize.
[2021-05-16 21:33:49] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 1 ms to minimize.
[2021-05-16 21:33:49] [INFO ] Deduced a trap composed of 169 places in 165 ms of which 0 ms to minimize.
[2021-05-16 21:33:50] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 0 ms to minimize.
[2021-05-16 21:33:50] [INFO ] Deduced a trap composed of 197 places in 145 ms of which 0 ms to minimize.
[2021-05-16 21:33:50] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:33:50] [INFO ] Deduced a trap composed of 99 places in 184 ms of which 0 ms to minimize.
[2021-05-16 21:33:51] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 0 ms to minimize.
[2021-05-16 21:33:51] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 0 ms to minimize.
[2021-05-16 21:33:51] [INFO ] Deduced a trap composed of 198 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:33:51] [INFO ] Deduced a trap composed of 194 places in 159 ms of which 0 ms to minimize.
[2021-05-16 21:33:52] [INFO ] Deduced a trap composed of 120 places in 235 ms of which 0 ms to minimize.
[2021-05-16 21:33:52] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 0 ms to minimize.
[2021-05-16 21:33:52] [INFO ] Deduced a trap composed of 85 places in 165 ms of which 0 ms to minimize.
[2021-05-16 21:33:53] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 1 ms to minimize.
[2021-05-16 21:33:53] [INFO ] Deduced a trap composed of 178 places in 139 ms of which 0 ms to minimize.
[2021-05-16 21:33:53] [INFO ] Deduced a trap composed of 174 places in 170 ms of which 0 ms to minimize.
[2021-05-16 21:33:53] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 15081 ms
[2021-05-16 21:33:53] [INFO ] Added : 419 causal constraints over 84 iterations in 21195 ms.(timeout) Result :sat
Minimization took 3002 ms.
[2021-05-16 21:33:56] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 21:33:57] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 18 ms returned sat
[2021-05-16 21:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:33:57] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2021-05-16 21:33:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:33:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 21:33:57] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2021-05-16 21:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:33:58] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2021-05-16 21:33:58] [INFO ] [Nat]Added 168 Read/Feed constraints in 477 ms returned sat
[2021-05-16 21:33:59] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 0 ms to minimize.
[2021-05-16 21:33:59] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2021-05-16 21:33:59] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2021-05-16 21:33:59] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2021-05-16 21:33:59] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2021-05-16 21:33:59] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 0 ms to minimize.
[2021-05-16 21:33:59] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2021-05-16 21:33:59] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2021-05-16 21:33:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 987 ms
[2021-05-16 21:33:59] [INFO ] Computed and/alt/rep : 564/2927/540 causal constraints (skipped 582 transitions) in 46 ms.
[2021-05-16 21:34:05] [INFO ] Deduced a trap composed of 177 places in 177 ms of which 0 ms to minimize.
[2021-05-16 21:34:05] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 1 ms to minimize.
[2021-05-16 21:34:06] [INFO ] Deduced a trap composed of 125 places in 184 ms of which 1 ms to minimize.
[2021-05-16 21:34:06] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 1 ms to minimize.
[2021-05-16 21:34:06] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 1 ms to minimize.
[2021-05-16 21:34:06] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 1 ms to minimize.
[2021-05-16 21:34:07] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 0 ms to minimize.
[2021-05-16 21:34:07] [INFO ] Deduced a trap composed of 67 places in 158 ms of which 0 ms to minimize.
[2021-05-16 21:34:07] [INFO ] Deduced a trap composed of 108 places in 180 ms of which 0 ms to minimize.
[2021-05-16 21:34:07] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 0 ms to minimize.
[2021-05-16 21:34:08] [INFO ] Deduced a trap composed of 112 places in 157 ms of which 1 ms to minimize.
[2021-05-16 21:34:08] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 0 ms to minimize.
[2021-05-16 21:34:08] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 1 ms to minimize.
[2021-05-16 21:34:08] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 0 ms to minimize.
[2021-05-16 21:34:09] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 0 ms to minimize.
[2021-05-16 21:34:09] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2021-05-16 21:34:09] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 1 ms to minimize.
[2021-05-16 21:34:09] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 1 ms to minimize.
[2021-05-16 21:34:10] [INFO ] Deduced a trap composed of 126 places in 183 ms of which 1 ms to minimize.
[2021-05-16 21:34:10] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:34:10] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 1 ms to minimize.
[2021-05-16 21:34:10] [INFO ] Deduced a trap composed of 118 places in 204 ms of which 1 ms to minimize.
[2021-05-16 21:34:11] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:34:11] [INFO ] Deduced a trap composed of 121 places in 156 ms of which 0 ms to minimize.
[2021-05-16 21:34:11] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 1 ms to minimize.
[2021-05-16 21:34:11] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 1 ms to minimize.
[2021-05-16 21:34:12] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 0 ms to minimize.
[2021-05-16 21:34:12] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 1 ms to minimize.
[2021-05-16 21:34:12] [INFO ] Deduced a trap composed of 233 places in 158 ms of which 0 ms to minimize.
[2021-05-16 21:34:12] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 1 ms to minimize.
[2021-05-16 21:34:13] [INFO ] Deduced a trap composed of 178 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:34:13] [INFO ] Deduced a trap composed of 119 places in 172 ms of which 0 ms to minimize.
[2021-05-16 21:34:14] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 0 ms to minimize.
[2021-05-16 21:34:14] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 0 ms to minimize.
[2021-05-16 21:34:14] [INFO ] Deduced a trap composed of 122 places in 165 ms of which 0 ms to minimize.
[2021-05-16 21:34:14] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 0 ms to minimize.
[2021-05-16 21:34:15] [INFO ] Deduced a trap composed of 114 places in 196 ms of which 0 ms to minimize.
[2021-05-16 21:34:15] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 0 ms to minimize.
[2021-05-16 21:34:15] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 0 ms to minimize.
[2021-05-16 21:34:16] [INFO ] Deduced a trap composed of 155 places in 171 ms of which 0 ms to minimize.
[2021-05-16 21:34:16] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 1 ms to minimize.
[2021-05-16 21:34:16] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 1 ms to minimize.
[2021-05-16 21:34:16] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 1 ms to minimize.
[2021-05-16 21:34:17] [INFO ] Deduced a trap composed of 175 places in 172 ms of which 1 ms to minimize.
[2021-05-16 21:34:17] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 1 ms to minimize.
[2021-05-16 21:34:17] [INFO ] Deduced a trap composed of 68 places in 184 ms of which 1 ms to minimize.
[2021-05-16 21:34:18] [INFO ] Deduced a trap composed of 111 places in 191 ms of which 0 ms to minimize.
[2021-05-16 21:34:18] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 1 ms to minimize.
[2021-05-16 21:34:18] [INFO ] Deduced a trap composed of 117 places in 177 ms of which 0 ms to minimize.
[2021-05-16 21:34:19] [INFO ] Deduced a trap composed of 151 places in 188 ms of which 0 ms to minimize.
[2021-05-16 21:34:19] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 0 ms to minimize.
[2021-05-16 21:34:19] [INFO ] Deduced a trap composed of 107 places in 200 ms of which 1 ms to minimize.
[2021-05-16 21:34:20] [INFO ] Deduced a trap composed of 89 places in 191 ms of which 0 ms to minimize.
[2021-05-16 21:34:20] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 1 ms to minimize.
[2021-05-16 21:34:20] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2021-05-16 21:34:21] [INFO ] Deduced a trap composed of 95 places in 211 ms of which 0 ms to minimize.
[2021-05-16 21:34:21] [INFO ] Deduced a trap composed of 178 places in 164 ms of which 1 ms to minimize.
[2021-05-16 21:34:21] [INFO ] Deduced a trap composed of 143 places in 177 ms of which 1 ms to minimize.
[2021-05-16 21:34:21] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 1 ms to minimize.
[2021-05-16 21:34:22] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 1 ms to minimize.
[2021-05-16 21:34:22] [INFO ] Deduced a trap composed of 110 places in 182 ms of which 0 ms to minimize.
[2021-05-16 21:34:22] [INFO ] Deduced a trap composed of 83 places in 181 ms of which 1 ms to minimize.
[2021-05-16 21:34:23] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 0 ms to minimize.
[2021-05-16 21:34:23] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:34:23] [INFO ] Deduced a trap composed of 112 places in 190 ms of which 0 ms to minimize.
[2021-05-16 21:34:24] [INFO ] Deduced a trap composed of 117 places in 164 ms of which 0 ms to minimize.
[2021-05-16 21:34:24] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 0 ms to minimize.
[2021-05-16 21:34:24] [INFO ] Deduced a trap composed of 238 places in 165 ms of which 0 ms to minimize.
[2021-05-16 21:34:25] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 11 ms to minimize.
[2021-05-16 21:34:25] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 0 ms to minimize.
[2021-05-16 21:34:25] [INFO ] Deduced a trap composed of 221 places in 191 ms of which 0 ms to minimize.
[2021-05-16 21:34:26] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 1 ms to minimize.
[2021-05-16 21:34:26] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 0 ms to minimize.
[2021-05-16 21:34:26] [INFO ] Deduced a trap composed of 128 places in 167 ms of which 0 ms to minimize.
[2021-05-16 21:34:27] [INFO ] Deduced a trap composed of 188 places in 218 ms of which 0 ms to minimize.
[2021-05-16 21:34:27] [INFO ] Deduced a trap composed of 119 places in 167 ms of which 1 ms to minimize.
[2021-05-16 21:34:27] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 0 ms to minimize.
[2021-05-16 21:34:27] [INFO ] Deduced a trap composed of 108 places in 203 ms of which 0 ms to minimize.
[2021-05-16 21:34:28] [INFO ] Deduced a trap composed of 96 places in 181 ms of which 1 ms to minimize.
[2021-05-16 21:34:28] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:34:28] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:34:28] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 0 ms to minimize.
[2021-05-16 21:34:29] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 1 ms to minimize.
[2021-05-16 21:34:31] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:34:31] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 1 ms to minimize.
[2021-05-16 21:34:31] [INFO ] Deduced a trap composed of 118 places in 181 ms of which 3 ms to minimize.
[2021-05-16 21:34:31] [INFO ] Deduced a trap composed of 126 places in 186 ms of which 1 ms to minimize.
[2021-05-16 21:34:32] [INFO ] Deduced a trap composed of 115 places in 154 ms of which 0 ms to minimize.
[2021-05-16 21:34:32] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 0 ms to minimize.
[2021-05-16 21:34:32] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 1 ms to minimize.
[2021-05-16 21:34:32] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 1 ms to minimize.
[2021-05-16 21:34:32] [INFO ] Deduced a trap composed of 143 places in 190 ms of which 1 ms to minimize.
[2021-05-16 21:34:33] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 1 ms to minimize.
[2021-05-16 21:34:34] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 2 ms to minimize.
[2021-05-16 21:34:34] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:34:35] [INFO ] Deduced a trap composed of 98 places in 181 ms of which 0 ms to minimize.
[2021-05-16 21:34:35] [INFO ] Deduced a trap composed of 95 places in 180 ms of which 1 ms to minimize.
[2021-05-16 21:34:36] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 0 ms to minimize.
[2021-05-16 21:34:36] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 1 ms to minimize.
[2021-05-16 21:34:36] [INFO ] Deduced a trap composed of 182 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:34:37] [INFO ] Deduced a trap composed of 112 places in 159 ms of which 1 ms to minimize.
[2021-05-16 21:34:37] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 1 ms to minimize.
[2021-05-16 21:34:37] [INFO ] Deduced a trap composed of 113 places in 164 ms of which 1 ms to minimize.
[2021-05-16 21:34:37] [INFO ] Deduced a trap composed of 163 places in 206 ms of which 0 ms to minimize.
[2021-05-16 21:34:38] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 0 ms to minimize.
[2021-05-16 21:34:38] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:34:38] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 0 ms to minimize.
[2021-05-16 21:34:38] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 0 ms to minimize.
[2021-05-16 21:34:39] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 1 ms to minimize.
[2021-05-16 21:34:39] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 0 ms to minimize.
[2021-05-16 21:34:40] [INFO ] Deduced a trap composed of 159 places in 153 ms of which 0 ms to minimize.
[2021-05-16 21:34:40] [INFO ] Deduced a trap composed of 157 places in 155 ms of which 1 ms to minimize.
[2021-05-16 21:34:41] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:34:41] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 1 ms to minimize.
[2021-05-16 21:34:42] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:34:42] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:34:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[1, 1]
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 19 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 446/446 places, 1158/1158 transitions.
Starting structural reductions, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 19 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2021-05-16 21:34:42] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:34:42] [INFO ] Computed 42 place invariants in 14 ms
[2021-05-16 21:34:43] [INFO ] Implicit Places using invariants in 451 ms returned []
[2021-05-16 21:34:43] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:34:43] [INFO ] Computed 42 place invariants in 17 ms
[2021-05-16 21:34:43] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:34:55] [INFO ] Implicit Places using invariants and state equation in 12482 ms returned []
Implicit Place search using SMT with State Equation took 12969 ms to find 0 implicit places.
[2021-05-16 21:34:55] [INFO ] Redundant transitions in 22 ms returned []
[2021-05-16 21:34:55] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:34:55] [INFO ] Computed 42 place invariants in 13 ms
[2021-05-16 21:34:56] [INFO ] Dead Transitions using invariants and state equation in 651 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/446 places, 1158/1158 transitions.
Starting property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-10
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:34:56] [INFO ] Computed 42 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
[2021-05-16 21:34:56] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:34:56] [INFO ] Computed 42 place invariants in 19 ms
[2021-05-16 21:34:56] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-16 21:34:56] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2021-05-16 21:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:34:57] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2021-05-16 21:34:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:34:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-16 21:34:57] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2021-05-16 21:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:34:59] [INFO ] [Nat]Absence check using state equation in 2198 ms returned sat
[2021-05-16 21:34:59] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:35:00] [INFO ] [Nat]Added 168 Read/Feed constraints in 498 ms returned sat
[2021-05-16 21:35:00] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 1 ms to minimize.
[2021-05-16 21:35:00] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 1 ms to minimize.
[2021-05-16 21:35:01] [INFO ] Deduced a trap composed of 193 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:35:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1017 ms
[2021-05-16 21:35:01] [INFO ] Computed and/alt/rep : 564/2927/540 causal constraints (skipped 582 transitions) in 54 ms.
[2021-05-16 21:35:02] [INFO ] Added : 30 causal constraints over 6 iterations in 1221 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 276700 steps, including 1002 resets, run finished after 1152 ms. (steps per millisecond=240 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 446/446 places, 1158/1158 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 445 transition count 1157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 1157
Applied a total of 2 rules in 23 ms. Remains 445 /446 variables (removed 1) and now considering 1157/1158 (removed 1) transitions.
[2021-05-16 21:35:03] [INFO ] Flow matrix only has 1125 transitions (discarded 32 similar events)
// Phase 1: matrix 1125 rows 445 cols
[2021-05-16 21:35:03] [INFO ] Computed 42 place invariants in 12 ms
[2021-05-16 21:35:04] [INFO ] Dead Transitions using invariants and state equation in 729 ms returned []
Finished structural reductions, in 1 iterations. Remains : 445/446 places, 1157/1158 transitions.
Normalized transition count is 1125 out of 1157 initially.
// Phase 1: matrix 1125 rows 445 cols
[2021-05-16 21:35:04] [INFO ] Computed 42 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 106 resets, run finished after 3971 ms. (steps per millisecond=251 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1415 ms. (steps per millisecond=706 ) properties (out of 1) seen :1
[2021-05-16 21:35:09] [INFO ] Flow matrix only has 1125 transitions (discarded 32 similar events)
// Phase 1: matrix 1125 rows 445 cols
[2021-05-16 21:35:09] [INFO ] Computed 42 place invariants in 19 ms
[2021-05-16 21:35:10] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-16 21:35:10] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 10 ms returned sat
[2021-05-16 21:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:35:11] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2021-05-16 21:35:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:35:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-16 21:35:11] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 9 ms returned sat
[2021-05-16 21:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:35:13] [INFO ] [Nat]Absence check using state equation in 2705 ms returned sat
[2021-05-16 21:35:14] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:35:14] [INFO ] [Nat]Added 168 Read/Feed constraints in 503 ms returned sat
[2021-05-16 21:35:14] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2021-05-16 21:35:14] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 1 ms to minimize.
[2021-05-16 21:35:14] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 0 ms to minimize.
[2021-05-16 21:35:15] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 1 ms to minimize.
[2021-05-16 21:35:15] [INFO ] Deduced a trap composed of 149 places in 154 ms of which 1 ms to minimize.
[2021-05-16 21:35:15] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 0 ms to minimize.
[2021-05-16 21:35:16] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 0 ms to minimize.
[2021-05-16 21:35:16] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2021-05-16 21:35:16] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 0 ms to minimize.
[2021-05-16 21:35:16] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 0 ms to minimize.
[2021-05-16 21:35:16] [INFO ] Deduced a trap composed of 211 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:35:17] [INFO ] Deduced a trap composed of 174 places in 172 ms of which 0 ms to minimize.
[2021-05-16 21:35:17] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 0 ms to minimize.
[2021-05-16 21:35:17] [INFO ] Deduced a trap composed of 184 places in 165 ms of which 0 ms to minimize.
[2021-05-16 21:35:17] [INFO ] Deduced a trap composed of 212 places in 194 ms of which 0 ms to minimize.
[2021-05-16 21:35:18] [INFO ] Deduced a trap composed of 186 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:35:18] [INFO ] Deduced a trap composed of 175 places in 134 ms of which 0 ms to minimize.
[2021-05-16 21:35:18] [INFO ] Deduced a trap composed of 207 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:35:18] [INFO ] Deduced a trap composed of 157 places in 136 ms of which 1 ms to minimize.
[2021-05-16 21:35:18] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4371 ms
[2021-05-16 21:35:18] [INFO ] Computed and/alt/rep : 562/2917/538 causal constraints (skipped 583 transitions) in 48 ms.
[2021-05-16 21:35:28] [INFO ] Added : 265 causal constraints over 53 iterations in 9881 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 796300 steps, including 1002 resets, run finished after 3321 ms. (steps per millisecond=239 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 445/445 places, 1157/1157 transitions.
Applied a total of 0 rules in 16 ms. Remains 445 /445 variables (removed 0) and now considering 1157/1157 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 445/445 places, 1157/1157 transitions.
Starting structural reductions, iteration 0 : 445/445 places, 1157/1157 transitions.
Applied a total of 0 rules in 16 ms. Remains 445 /445 variables (removed 0) and now considering 1157/1157 (removed 0) transitions.
[2021-05-16 21:35:32] [INFO ] Flow matrix only has 1125 transitions (discarded 32 similar events)
// Phase 1: matrix 1125 rows 445 cols
[2021-05-16 21:35:32] [INFO ] Computed 42 place invariants in 27 ms
[2021-05-16 21:35:32] [INFO ] Implicit Places using invariants in 567 ms returned []
[2021-05-16 21:35:32] [INFO ] Flow matrix only has 1125 transitions (discarded 32 similar events)
// Phase 1: matrix 1125 rows 445 cols
[2021-05-16 21:35:32] [INFO ] Computed 42 place invariants in 13 ms
[2021-05-16 21:35:33] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:35:44] [INFO ] Implicit Places using invariants and state equation in 11816 ms returned []
Implicit Place search using SMT with State Equation took 12384 ms to find 0 implicit places.
[2021-05-16 21:35:44] [INFO ] Redundant transitions in 17 ms returned []
[2021-05-16 21:35:44] [INFO ] Flow matrix only has 1125 transitions (discarded 32 similar events)
// Phase 1: matrix 1125 rows 445 cols
[2021-05-16 21:35:44] [INFO ] Computed 42 place invariants in 23 ms
[2021-05-16 21:35:45] [INFO ] Dead Transitions using invariants and state equation in 636 ms returned []
Finished structural reductions, in 1 iterations. Remains : 445/445 places, 1157/1157 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-10 in 48925 ms.
Starting property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-14
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:35:45] [INFO ] Computed 42 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
[2021-05-16 21:35:45] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:35:45] [INFO ] Computed 42 place invariants in 22 ms
[2021-05-16 21:35:45] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 21:35:45] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2021-05-16 21:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:35:45] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2021-05-16 21:35:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:35:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 21:35:45] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 14 ms returned sat
[2021-05-16 21:35:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:35:46] [INFO ] [Nat]Absence check using state equation in 944 ms returned sat
[2021-05-16 21:35:46] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:35:47] [INFO ] [Nat]Added 168 Read/Feed constraints in 476 ms returned sat
[2021-05-16 21:35:47] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 0 ms to minimize.
[2021-05-16 21:35:47] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2021-05-16 21:35:47] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2021-05-16 21:35:47] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 0 ms to minimize.
[2021-05-16 21:35:47] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2021-05-16 21:35:48] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2021-05-16 21:35:48] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2021-05-16 21:35:48] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 0 ms to minimize.
[2021-05-16 21:35:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1042 ms
[2021-05-16 21:35:48] [INFO ] Computed and/alt/rep : 564/2927/540 causal constraints (skipped 582 transitions) in 45 ms.
[2021-05-16 21:35:50] [INFO ] Added : 155 causal constraints over 31 iterations in 2497 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 549000 steps, including 1002 resets, run finished after 2253 ms. (steps per millisecond=243 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 24 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2021-05-16 21:35:53] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:35:53] [INFO ] Computed 42 place invariants in 12 ms
[2021-05-16 21:35:53] [INFO ] Dead Transitions using invariants and state equation in 603 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/446 places, 1158/1158 transitions.
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:35:53] [INFO ] Computed 42 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 78 resets, run finished after 3864 ms. (steps per millisecond=258 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1424 ms. (steps per millisecond=702 ) properties (out of 1) seen :1
[2021-05-16 21:35:59] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:35:59] [INFO ] Computed 42 place invariants in 21 ms
[2021-05-16 21:35:59] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-16 21:35:59] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2021-05-16 21:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:35:59] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2021-05-16 21:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:35:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-16 21:35:59] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2021-05-16 21:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:36:00] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2021-05-16 21:36:00] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:36:01] [INFO ] [Nat]Added 168 Read/Feed constraints in 486 ms returned sat
[2021-05-16 21:36:01] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 0 ms to minimize.
[2021-05-16 21:36:01] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2021-05-16 21:36:01] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2021-05-16 21:36:01] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2021-05-16 21:36:01] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2021-05-16 21:36:01] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2021-05-16 21:36:02] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 0 ms to minimize.
[2021-05-16 21:36:02] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2021-05-16 21:36:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1016 ms
[2021-05-16 21:36:02] [INFO ] Computed and/alt/rep : 564/2927/540 causal constraints (skipped 582 transitions) in 51 ms.
[2021-05-16 21:36:07] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 0 ms to minimize.
[2021-05-16 21:36:08] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 1 ms to minimize.
[2021-05-16 21:36:08] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 1 ms to minimize.
[2021-05-16 21:36:08] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 1 ms to minimize.
[2021-05-16 21:36:08] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 1 ms to minimize.
[2021-05-16 21:36:09] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 0 ms to minimize.
[2021-05-16 21:36:09] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 0 ms to minimize.
[2021-05-16 21:36:09] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 0 ms to minimize.
[2021-05-16 21:36:09] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:36:10] [INFO ] Deduced a trap composed of 125 places in 182 ms of which 0 ms to minimize.
[2021-05-16 21:36:10] [INFO ] Deduced a trap composed of 112 places in 180 ms of which 1 ms to minimize.
[2021-05-16 21:36:10] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 1 ms to minimize.
[2021-05-16 21:36:10] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 0 ms to minimize.
[2021-05-16 21:36:11] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 0 ms to minimize.
[2021-05-16 21:36:11] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 1 ms to minimize.
[2021-05-16 21:36:11] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 1 ms to minimize.
[2021-05-16 21:36:11] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 0 ms to minimize.
[2021-05-16 21:36:12] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 1 ms to minimize.
[2021-05-16 21:36:12] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 0 ms to minimize.
[2021-05-16 21:36:12] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 0 ms to minimize.
[2021-05-16 21:36:12] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 1 ms to minimize.
[2021-05-16 21:36:13] [INFO ] Deduced a trap composed of 118 places in 180 ms of which 0 ms to minimize.
[2021-05-16 21:36:13] [INFO ] Deduced a trap composed of 98 places in 173 ms of which 1 ms to minimize.
[2021-05-16 21:36:13] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 1 ms to minimize.
[2021-05-16 21:36:13] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 0 ms to minimize.
[2021-05-16 21:36:14] [INFO ] Deduced a trap composed of 112 places in 157 ms of which 0 ms to minimize.
[2021-05-16 21:36:14] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:36:14] [INFO ] Deduced a trap composed of 100 places in 192 ms of which 1 ms to minimize.
[2021-05-16 21:36:14] [INFO ] Deduced a trap composed of 233 places in 183 ms of which 1 ms to minimize.
[2021-05-16 21:36:15] [INFO ] Deduced a trap composed of 126 places in 201 ms of which 1 ms to minimize.
[2021-05-16 21:36:15] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 1 ms to minimize.
[2021-05-16 21:36:16] [INFO ] Deduced a trap composed of 119 places in 187 ms of which 1 ms to minimize.
[2021-05-16 21:36:16] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 1 ms to minimize.
[2021-05-16 21:36:16] [INFO ] Deduced a trap composed of 118 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:36:16] [INFO ] Deduced a trap composed of 122 places in 170 ms of which 0 ms to minimize.
[2021-05-16 21:36:17] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 0 ms to minimize.
[2021-05-16 21:36:17] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 1 ms to minimize.
[2021-05-16 21:36:17] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:36:18] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 0 ms to minimize.
[2021-05-16 21:36:18] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:36:18] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 1 ms to minimize.
[2021-05-16 21:36:18] [INFO ] Deduced a trap composed of 128 places in 164 ms of which 0 ms to minimize.
[2021-05-16 21:36:19] [INFO ] Deduced a trap composed of 113 places in 161 ms of which 0 ms to minimize.
[2021-05-16 21:36:19] [INFO ] Deduced a trap composed of 175 places in 151 ms of which 1 ms to minimize.
[2021-05-16 21:36:19] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 1 ms to minimize.
[2021-05-16 21:36:20] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 0 ms to minimize.
[2021-05-16 21:36:20] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 0 ms to minimize.
[2021-05-16 21:36:20] [INFO ] Deduced a trap composed of 132 places in 263 ms of which 1 ms to minimize.
[2021-05-16 21:36:21] [INFO ] Deduced a trap composed of 117 places in 206 ms of which 1 ms to minimize.
[2021-05-16 21:36:21] [INFO ] Deduced a trap composed of 151 places in 179 ms of which 0 ms to minimize.
[2021-05-16 21:36:21] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:36:22] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 0 ms to minimize.
[2021-05-16 21:36:22] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 0 ms to minimize.
[2021-05-16 21:36:22] [INFO ] Deduced a trap composed of 94 places in 177 ms of which 1 ms to minimize.
[2021-05-16 21:36:22] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2021-05-16 21:36:23] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 1 ms to minimize.
[2021-05-16 21:36:23] [INFO ] Deduced a trap composed of 178 places in 183 ms of which 0 ms to minimize.
[2021-05-16 21:36:23] [INFO ] Deduced a trap composed of 143 places in 183 ms of which 0 ms to minimize.
[2021-05-16 21:36:24] [INFO ] Deduced a trap composed of 82 places in 185 ms of which 2 ms to minimize.
[2021-05-16 21:36:24] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 1 ms to minimize.
[2021-05-16 21:36:24] [INFO ] Deduced a trap composed of 110 places in 158 ms of which 0 ms to minimize.
[2021-05-16 21:36:24] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 0 ms to minimize.
[2021-05-16 21:36:25] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 1 ms to minimize.
[2021-05-16 21:36:25] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 0 ms to minimize.
[2021-05-16 21:36:25] [INFO ] Deduced a trap composed of 112 places in 188 ms of which 0 ms to minimize.
[2021-05-16 21:36:26] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 0 ms to minimize.
[2021-05-16 21:36:26] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 0 ms to minimize.
[2021-05-16 21:36:26] [INFO ] Deduced a trap composed of 238 places in 167 ms of which 1 ms to minimize.
[2021-05-16 21:36:27] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 0 ms to minimize.
[2021-05-16 21:36:27] [INFO ] Deduced a trap composed of 151 places in 186 ms of which 1 ms to minimize.
[2021-05-16 21:36:27] [INFO ] Deduced a trap composed of 221 places in 167 ms of which 0 ms to minimize.
[2021-05-16 21:36:28] [INFO ] Deduced a trap composed of 112 places in 167 ms of which 0 ms to minimize.
[2021-05-16 21:36:28] [INFO ] Deduced a trap composed of 100 places in 194 ms of which 0 ms to minimize.
[2021-05-16 21:36:28] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 0 ms to minimize.
[2021-05-16 21:36:29] [INFO ] Deduced a trap composed of 188 places in 159 ms of which 0 ms to minimize.
[2021-05-16 21:36:29] [INFO ] Deduced a trap composed of 119 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:36:29] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 1 ms to minimize.
[2021-05-16 21:36:29] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 1 ms to minimize.
[2021-05-16 21:36:30] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 1 ms to minimize.
[2021-05-16 21:36:30] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 1 ms to minimize.
[2021-05-16 21:36:30] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 1 ms to minimize.
[2021-05-16 21:36:31] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 0 ms to minimize.
[2021-05-16 21:36:31] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 1 ms to minimize.
[2021-05-16 21:36:33] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 1 ms to minimize.
[2021-05-16 21:36:33] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 1 ms to minimize.
[2021-05-16 21:36:33] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 1 ms to minimize.
[2021-05-16 21:36:33] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 0 ms to minimize.
[2021-05-16 21:36:33] [INFO ] Deduced a trap composed of 115 places in 188 ms of which 0 ms to minimize.
[2021-05-16 21:36:34] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 0 ms to minimize.
[2021-05-16 21:36:34] [INFO ] Deduced a trap composed of 112 places in 173 ms of which 1 ms to minimize.
[2021-05-16 21:36:34] [INFO ] Deduced a trap composed of 111 places in 161 ms of which 0 ms to minimize.
[2021-05-16 21:36:34] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 1 ms to minimize.
[2021-05-16 21:36:35] [INFO ] Deduced a trap composed of 100 places in 171 ms of which 1 ms to minimize.
[2021-05-16 21:36:36] [INFO ] Deduced a trap composed of 124 places in 192 ms of which 0 ms to minimize.
[2021-05-16 21:36:36] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:36:37] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 0 ms to minimize.
[2021-05-16 21:36:37] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 1 ms to minimize.
[2021-05-16 21:36:37] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 0 ms to minimize.
[2021-05-16 21:36:38] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 0 ms to minimize.
[2021-05-16 21:36:38] [INFO ] Deduced a trap composed of 182 places in 155 ms of which 1 ms to minimize.
[2021-05-16 21:36:39] [INFO ] Deduced a trap composed of 112 places in 188 ms of which 0 ms to minimize.
[2021-05-16 21:36:39] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 0 ms to minimize.
[2021-05-16 21:36:39] [INFO ] Deduced a trap composed of 113 places in 164 ms of which 0 ms to minimize.
[2021-05-16 21:36:39] [INFO ] Deduced a trap composed of 163 places in 164 ms of which 1 ms to minimize.
[2021-05-16 21:36:40] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:36:40] [INFO ] Deduced a trap composed of 133 places in 187 ms of which 0 ms to minimize.
[2021-05-16 21:36:40] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 0 ms to minimize.
[2021-05-16 21:36:40] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 0 ms to minimize.
[2021-05-16 21:36:41] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 1 ms to minimize.
[2021-05-16 21:36:41] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 0 ms to minimize.
[2021-05-16 21:36:42] [INFO ] Deduced a trap composed of 159 places in 162 ms of which 1 ms to minimize.
[2021-05-16 21:36:42] [INFO ] Deduced a trap composed of 157 places in 150 ms of which 1 ms to minimize.
[2021-05-16 21:36:42] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 0 ms to minimize.
[2021-05-16 21:36:43] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 1 ms to minimize.
[2021-05-16 21:36:44] [INFO ] Deduced a trap composed of 159 places in 153 ms of which 0 ms to minimize.
[2021-05-16 21:36:44] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 0 ms to minimize.
[2021-05-16 21:36:44] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 0 ms to minimize.
[2021-05-16 21:36:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 17 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 446/446 places, 1158/1158 transitions.
Starting structural reductions, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 16 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2021-05-16 21:36:44] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:36:44] [INFO ] Computed 42 place invariants in 17 ms
[2021-05-16 21:36:45] [INFO ] Implicit Places using invariants in 469 ms returned []
[2021-05-16 21:36:45] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:36:45] [INFO ] Computed 42 place invariants in 18 ms
[2021-05-16 21:36:45] [INFO ] State equation strengthened by 168 read => feed constraints.
[2021-05-16 21:36:58] [INFO ] Implicit Places using invariants and state equation in 13334 ms returned []
Implicit Place search using SMT with State Equation took 13805 ms to find 0 implicit places.
[2021-05-16 21:36:58] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-16 21:36:58] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2021-05-16 21:36:58] [INFO ] Computed 42 place invariants in 14 ms
[2021-05-16 21:36:59] [INFO ] Dead Transitions using invariants and state equation in 576 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/446 places, 1158/1158 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-14 in 73897 ms.
[2021-05-16 21:36:59] [INFO ] Flatten gal took : 136 ms
[2021-05-16 21:36:59] [INFO ] Applying decomposition
[2021-05-16 21:36:59] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16534378345113795166.txt, -o, /tmp/graph16534378345113795166.bin, -w, /tmp/graph16534378345113795166.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16534378345113795166.bin, -l, -1, -v, -w, /tmp/graph16534378345113795166.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 21:36:59] [INFO ] Decomposing Gal with order
[2021-05-16 21:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:37:00] [INFO ] Removed a total of 1106 redundant transitions.
[2021-05-16 21:37:00] [INFO ] Flatten gal took : 274 ms
[2021-05-16 21:37:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 40 ms.
[2021-05-16 21:37:00] [INFO ] Time to serialize gal into /tmp/UpperBounds13240303246545431852.gal : 13 ms
[2021-05-16 21:37:00] [INFO ] Time to serialize properties into /tmp/UpperBounds10931143227030216534.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds13240303246545431852.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10931143227030216534.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds13240303246545431852.gal -t CGAL -reachable-file /tmp/UpperBounds10931143227030216534.prop --nowitness
Loading property file /tmp/UpperBounds10931143227030216534.prop.
Detected timeout of ITS tools.
[2021-05-16 21:58:56] [INFO ] Flatten gal took : 571 ms
[2021-05-16 21:58:56] [INFO ] Time to serialize gal into /tmp/UpperBounds8164644640764929734.gal : 30 ms
[2021-05-16 21:58:56] [INFO ] Time to serialize properties into /tmp/UpperBounds4517213281575616243.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8164644640764929734.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4517213281575616243.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8164644640764929734.gal -t CGAL -reachable-file /tmp/UpperBounds4517213281575616243.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds4517213281575616243.prop.
Detected timeout of ITS tools.
[2021-05-16 22:20:50] [INFO ] Flatten gal took : 793 ms
[2021-05-16 22:20:54] [INFO ] Input system was already deterministic with 1158 transitions.
[2021-05-16 22:20:54] [INFO ] Transformed 446 places.
[2021-05-16 22:20:54] [INFO ] Transformed 1158 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-16 22:21:24] [INFO ] Time to serialize gal into /tmp/UpperBounds16530002076961170119.gal : 182 ms
[2021-05-16 22:21:24] [INFO ] Time to serialize properties into /tmp/UpperBounds5707936711309105069.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16530002076961170119.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5707936711309105069.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16530002076961170119.gal -t CGAL -reachable-file /tmp/UpperBounds5707936711309105069.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5707936711309105069.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="PolyORBLF-PT-S04J04T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 itstools"
echo " Input is PolyORBLF-PT-S04J04T08, 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 r159-oct2-162089268100275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 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 ;