Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446800290.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S04J06T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717254389203

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:06:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:06:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:06:31] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2024-06-01 15:06:31] [INFO ] Transformed 618 places.
[2024-06-01 15:06:31] [INFO ] Transformed 3190 transitions.
[2024-06-01 15:06:31] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 362 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 1558
Applied a total of 12 rules in 92 ms. Remains 612 /618 variables (removed 6) and now considering 1558/1564 (removed 6) transitions.
Running 1554 sub problems to find dead transitions.
[2024-06-01 15:06:31] [INFO ] Flow matrix only has 1534 transitions (discarded 24 similar events)
// Phase 1: matrix 1534 rows 612 cols
[2024-06-01 15:06:32] [INFO ] Computed 54 invariants in 118 ms
[2024-06-01 15:06:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 20 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 104 places in 203 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/2146 variables, and 43 constraints, problems are : Problem set: 0 solved, 1554 unsolved in 20167 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/37 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1554/1554 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 4 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 5 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 2 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:07:12] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/2146 variables, and 50 constraints, problems are : Problem set: 0 solved, 1554 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/37 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1554 constraints, Known Traps: 9/9 constraints]
After SMT, in 45532ms problems are : Problem set: 0 solved, 1554 unsolved
Search for dead transitions found 0 dead transitions in 45644ms
[2024-06-01 15:07:17] [INFO ] Flow matrix only has 1534 transitions (discarded 24 similar events)
[2024-06-01 15:07:17] [INFO ] Invariant cache hit.
[2024-06-01 15:07:17] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 15:07:17] [INFO ] Flow matrix only has 1534 transitions (discarded 24 similar events)
[2024-06-01 15:07:17] [INFO ] Invariant cache hit.
[2024-06-01 15:07:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:07:28] [INFO ] Implicit Places using invariants and state equation in 10676 ms returned []
Implicit Place search using SMT with State Equation took 10974 ms to find 0 implicit places.
Running 1554 sub problems to find dead transitions.
[2024-06-01 15:07:28] [INFO ] Flow matrix only has 1534 transitions (discarded 24 similar events)
[2024-06-01 15:07:28] [INFO ] Invariant cache hit.
[2024-06-01 15:07:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/2146 variables, and 43 constraints, problems are : Problem set: 0 solved, 1554 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/37 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1554/1554 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
At refinement iteration 4 (OVERLAPS) 5/609 variables, 10/53 constraints. Problems are: Problem set: 324 solved, 1230 unsolved
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 145 places in 339 ms of which 4 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 316 places in 311 ms of which 4 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 3 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 359 places in 318 ms of which 3 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 356 places in 306 ms of which 3 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 82 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:08:31] [INFO ] Deduced a trap composed of 359 places in 302 ms of which 3 ms to minimize.
[2024-06-01 15:08:31] [INFO ] Deduced a trap composed of 312 places in 318 ms of which 3 ms to minimize.
[2024-06-01 15:08:31] [INFO ] Deduced a trap composed of 338 places in 313 ms of which 4 ms to minimize.
[2024-06-01 15:08:32] [INFO ] Deduced a trap composed of 111 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:08:32] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:08:32] [INFO ] Deduced a trap composed of 249 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:08:33] [INFO ] Deduced a trap composed of 266 places in 281 ms of which 3 ms to minimize.
[2024-06-01 15:08:33] [INFO ] Deduced a trap composed of 379 places in 298 ms of which 3 ms to minimize.
[2024-06-01 15:08:33] [INFO ] Deduced a trap composed of 288 places in 300 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/609 variables, 20/73 constraints. Problems are: Problem set: 324 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/2146 variables, and 73 constraints, problems are : Problem set: 324 solved, 1230 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1554 constraints, Known Traps: 22/22 constraints]
After SMT, in 65730ms problems are : Problem set: 324 solved, 1230 unsolved
Search for dead transitions found 324 dead transitions in 65763ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in LTL mode, iteration 1 : 612/618 places, 1234/1564 transitions.
Applied a total of 0 rules in 10 ms. Remains 612 /612 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122573 ms. Remains : 612/618 places, 1234/1564 transitions.
Support contains 362 out of 612 places after structural reductions.
[2024-06-01 15:08:34] [INFO ] Flatten gal took : 229 ms
[2024-06-01 15:08:35] [INFO ] Flatten gal took : 191 ms
[2024-06-01 15:08:35] [INFO ] Input system was already deterministic with 1234 transitions.
Support contains 356 out of 612 places (down from 362) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 77 to 76
RANDOM walk for 40001 steps (9 resets) in 2816 ms. (14 steps per ms) remains 32/76 properties
BEST_FIRST walk for 4002 steps (8 resets) in 151 ms. (26 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 149 ms. (26 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
[2024-06-01 15:08:36] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
// Phase 1: matrix 1210 rows 612 cols
[2024-06-01 15:08:36] [INFO ] Computed 54 invariants in 31 ms
[2024-06-01 15:08:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 176/279 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 4/283 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
After SMT solving in domain Real declared 607/1822 variables, and 50 constraints, problems are : Problem set: 32 solved, 0 unsolved in 1110 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1279ms problems are : Problem set: 32 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 32 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:08:38] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 15:08:38] [INFO ] Flatten gal took : 122 ms
FORMULA PolyORBLF-PT-S04J06T06-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:08:38] [INFO ] Flatten gal took : 57 ms
[2024-06-01 15:08:38] [INFO ] Input system was already deterministic with 1234 transitions.
Support contains 332 out of 612 places (down from 335) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 28 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:08:38] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 602 cols
[2024-06-01 15:08:38] [INFO ] Computed 50 invariants in 15 ms
[2024-06-01 15:08:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 268 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 348 places in 229 ms of which 6 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 411 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 396 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 406 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 361 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 401 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 418 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 382 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 337 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 308 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 304 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 379 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 404 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 395 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 392 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 392 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 363 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 377 places in 227 ms of which 2 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 335 places in 223 ms of which 2 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 344 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 318 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 9 ms to minimize.
[2024-06-01 15:08:59] [INFO ] Deduced a trap composed of 284 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:08:59] [INFO ] Deduced a trap composed of 325 places in 216 ms of which 2 ms to minimize.
SMT process timed out in 21375ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 21385ms
Finished structural reductions in LTL mode , in 1 iterations and 21416 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:09:00] [INFO ] Flatten gal took : 35 ms
[2024-06-01 15:09:00] [INFO ] Flatten gal took : 37 ms
[2024-06-01 15:09:00] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 71 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:09:00] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-06-01 15:09:00] [INFO ] Invariant cache hit.
[2024-06-01 15:09:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 409 places in 223 ms of which 2 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 346 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 396 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:09:13] [INFO ] Deduced a trap composed of 356 places in 231 ms of which 3 ms to minimize.
[2024-06-01 15:09:13] [INFO ] Deduced a trap composed of 363 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:09:13] [INFO ] Deduced a trap composed of 415 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 415 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 393 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 415 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 356 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 377 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 282 places in 223 ms of which 2 ms to minimize.
[2024-06-01 15:09:17] [INFO ] Deduced a trap composed of 412 places in 317 ms of which 3 ms to minimize.
[2024-06-01 15:09:17] [INFO ] Deduced a trap composed of 374 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:09:17] [INFO ] Deduced a trap composed of 347 places in 278 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:09:19] [INFO ] Deduced a trap composed of 348 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:09:19] [INFO ] Deduced a trap composed of 326 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:09:19] [INFO ] Deduced a trap composed of 344 places in 318 ms of which 4 ms to minimize.
[2024-06-01 15:09:19] [INFO ] Deduced a trap composed of 328 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:09:20] [INFO ] Deduced a trap composed of 356 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1806 variables, and 68 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1806 variables, and 68 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 25/25 constraints]
After SMT, in 41075ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 41098ms
Finished structural reductions in LTL mode , in 1 iterations and 41172 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:09:41] [INFO ] Flatten gal took : 32 ms
[2024-06-01 15:09:41] [INFO ] Flatten gal took : 34 ms
[2024-06-01 15:09:41] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 24 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:09:41] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-06-01 15:09:41] [INFO ] Invariant cache hit.
[2024-06-01 15:09:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:09:53] [INFO ] Deduced a trap composed of 139 places in 278 ms of which 3 ms to minimize.
[2024-06-01 15:09:53] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:09:53] [INFO ] Deduced a trap composed of 15 places in 349 ms of which 3 ms to minimize.
[2024-06-01 15:09:53] [INFO ] Deduced a trap composed of 409 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:09:54] [INFO ] Deduced a trap composed of 346 places in 264 ms of which 4 ms to minimize.
[2024-06-01 15:09:54] [INFO ] Deduced a trap composed of 396 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:09:55] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:09:55] [INFO ] Deduced a trap composed of 356 places in 290 ms of which 4 ms to minimize.
[2024-06-01 15:09:56] [INFO ] Deduced a trap composed of 363 places in 307 ms of which 5 ms to minimize.
[2024-06-01 15:09:56] [INFO ] Deduced a trap composed of 415 places in 296 ms of which 4 ms to minimize.
[2024-06-01 15:09:56] [INFO ] Deduced a trap composed of 415 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 393 places in 278 ms of which 2 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 415 places in 279 ms of which 4 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 356 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:09:58] [INFO ] Deduced a trap composed of 377 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:09:58] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:09:59] [INFO ] Deduced a trap composed of 282 places in 325 ms of which 4 ms to minimize.
[2024-06-01 15:10:00] [INFO ] Deduced a trap composed of 412 places in 309 ms of which 4 ms to minimize.
[2024-06-01 15:10:00] [INFO ] Deduced a trap composed of 374 places in 268 ms of which 4 ms to minimize.
[2024-06-01 15:10:01] [INFO ] Deduced a trap composed of 347 places in 283 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:10:02] [INFO ] Deduced a trap composed of 348 places in 313 ms of which 4 ms to minimize.
[2024-06-01 15:10:02] [INFO ] Deduced a trap composed of 326 places in 264 ms of which 4 ms to minimize.
[2024-06-01 15:10:03] [INFO ] Deduced a trap composed of 344 places in 265 ms of which 3 ms to minimize.
SMT process timed out in 21669ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 21679ms
Finished structural reductions in LTL mode , in 1 iterations and 21706 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:10:03] [INFO ] Flatten gal took : 65 ms
[2024-06-01 15:10:03] [INFO ] Flatten gal took : 63 ms
[2024-06-01 15:10:03] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 608 transition count 1222
Reduce places removed 12 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 30 rules applied. Total rules applied 42 place count 596 transition count 1204
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 60 place count 578 transition count 1204
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 60 place count 578 transition count 1138
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 192 place count 512 transition count 1138
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 216 place count 500 transition count 1126
Applied a total of 216 rules in 146 ms. Remains 500 /612 variables (removed 112) and now considering 1126/1234 (removed 108) transitions.
Running 1122 sub problems to find dead transitions.
[2024-06-01 15:10:03] [INFO ] Flow matrix only has 1102 transitions (discarded 24 similar events)
// Phase 1: matrix 1102 rows 500 cols
[2024-06-01 15:10:03] [INFO ] Computed 50 invariants in 32 ms
[2024-06-01 15:10:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-06-01 15:10:13] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:10:13] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 192 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:10:14] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 103 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 186 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:10:16] [INFO ] Deduced a trap composed of 80 places in 204 ms of which 4 ms to minimize.
[2024-06-01 15:10:17] [INFO ] Deduced a trap composed of 182 places in 352 ms of which 3 ms to minimize.
[2024-06-01 15:10:18] [INFO ] Deduced a trap composed of 193 places in 208 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 9.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 2.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 2.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 2.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 2.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 7.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 3.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 2.0)
(s366 0.0)
(s367 2.0)
(s368 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/1602 variables, and 54 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/32 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1122/1122 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-06-01 15:10:28] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:10:28] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:10:29] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:10:30] [INFO ] Deduced a trap composed of 257 places in 329 ms of which 4 ms to minimize.
[2024-06-01 15:10:30] [INFO ] Deduced a trap composed of 227 places in 270 ms of which 4 ms to minimize.
[2024-06-01 15:10:30] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 2 ms to minimize.
[2024-06-01 15:10:31] [INFO ] Deduced a trap composed of 215 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:10:31] [INFO ] Deduced a trap composed of 221 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:10:32] [INFO ] Deduced a trap composed of 248 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:10:32] [INFO ] Deduced a trap composed of 214 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:10:32] [INFO ] Deduced a trap composed of 246 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:10:32] [INFO ] Deduced a trap composed of 221 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:10:33] [INFO ] Deduced a trap composed of 216 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:10:33] [INFO ] Deduced a trap composed of 212 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:10:33] [INFO ] Deduced a trap composed of 242 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:10:33] [INFO ] Deduced a trap composed of 229 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:10:34] [INFO ] Deduced a trap composed of 232 places in 233 ms of which 4 ms to minimize.
[2024-06-01 15:10:34] [INFO ] Deduced a trap composed of 227 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:10:34] [INFO ] Deduced a trap composed of 250 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:10:34] [INFO ] Deduced a trap composed of 219 places in 209 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/1602 variables, and 75 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 27/32 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1122 constraints, Known Traps: 31/31 constraints]
After SMT, in 41587ms problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 41598ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41747 ms. Remains : 500/612 places, 1126/1234 transitions.
[2024-06-01 15:10:45] [INFO ] Flatten gal took : 28 ms
[2024-06-01 15:10:45] [INFO ] Flatten gal took : 33 ms
[2024-06-01 15:10:45] [INFO ] Input system was already deterministic with 1126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 51 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:10:45] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 602 cols
[2024-06-01 15:10:45] [INFO ] Computed 50 invariants in 20 ms
[2024-06-01 15:10:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:10:57] [INFO ] Deduced a trap composed of 268 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:10:57] [INFO ] Deduced a trap composed of 139 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:10:57] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 15:10:57] [INFO ] Deduced a trap composed of 348 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:10:58] [INFO ] Deduced a trap composed of 411 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:10:58] [INFO ] Deduced a trap composed of 396 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:10:58] [INFO ] Deduced a trap composed of 406 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:10:58] [INFO ] Deduced a trap composed of 361 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:10:59] [INFO ] Deduced a trap composed of 401 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:10:59] [INFO ] Deduced a trap composed of 418 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:10:59] [INFO ] Deduced a trap composed of 382 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:11:00] [INFO ] Deduced a trap composed of 337 places in 308 ms of which 4 ms to minimize.
[2024-06-01 15:11:00] [INFO ] Deduced a trap composed of 308 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:11:00] [INFO ] Deduced a trap composed of 304 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:11:01] [INFO ] Deduced a trap composed of 379 places in 354 ms of which 4 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 404 places in 283 ms of which 4 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 395 places in 305 ms of which 4 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 392 places in 299 ms of which 4 ms to minimize.
[2024-06-01 15:11:02] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2024-06-01 15:11:04] [INFO ] Deduced a trap composed of 392 places in 304 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:11:05] [INFO ] Deduced a trap composed of 363 places in 299 ms of which 4 ms to minimize.
[2024-06-01 15:11:06] [INFO ] Deduced a trap composed of 377 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:11:06] [INFO ] Deduced a trap composed of 335 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:11:06] [INFO ] Deduced a trap composed of 344 places in 230 ms of which 3 ms to minimize.
SMT process timed out in 21322ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 21335ms
Finished structural reductions in LTL mode , in 1 iterations and 21399 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:11:06] [INFO ] Flatten gal took : 29 ms
[2024-06-01 15:11:06] [INFO ] Flatten gal took : 49 ms
[2024-06-01 15:11:06] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 29 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:11:07] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-06-01 15:11:07] [INFO ] Invariant cache hit.
[2024-06-01 15:11:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:11:19] [INFO ] Deduced a trap composed of 409 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:11:19] [INFO ] Deduced a trap composed of 346 places in 338 ms of which 3 ms to minimize.
[2024-06-01 15:11:19] [INFO ] Deduced a trap composed of 396 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:11:20] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:11:21] [INFO ] Deduced a trap composed of 356 places in 353 ms of which 4 ms to minimize.
[2024-06-01 15:11:21] [INFO ] Deduced a trap composed of 363 places in 317 ms of which 4 ms to minimize.
[2024-06-01 15:11:21] [INFO ] Deduced a trap composed of 415 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 415 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 393 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 415 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 356 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 377 places in 223 ms of which 2 ms to minimize.
[2024-06-01 15:11:23] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:11:24] [INFO ] Deduced a trap composed of 282 places in 322 ms of which 4 ms to minimize.
[2024-06-01 15:11:25] [INFO ] Deduced a trap composed of 412 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:11:25] [INFO ] Deduced a trap composed of 374 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:11:26] [INFO ] Deduced a trap composed of 347 places in 254 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:11:27] [INFO ] Deduced a trap composed of 348 places in 309 ms of which 4 ms to minimize.
[2024-06-01 15:11:27] [INFO ] Deduced a trap composed of 326 places in 291 ms of which 4 ms to minimize.
[2024-06-01 15:11:28] [INFO ] Deduced a trap composed of 344 places in 259 ms of which 4 ms to minimize.
[2024-06-01 15:11:28] [INFO ] Deduced a trap composed of 328 places in 301 ms of which 3 ms to minimize.
SMT process timed out in 21361ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 21378ms
Finished structural reductions in LTL mode , in 1 iterations and 21411 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:11:28] [INFO ] Flatten gal took : 31 ms
[2024-06-01 15:11:28] [INFO ] Flatten gal took : 35 ms
[2024-06-01 15:11:28] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 15 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:11:28] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-06-01 15:11:28] [INFO ] Invariant cache hit.
[2024-06-01 15:11:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:11:39] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:11:39] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 3 ms to minimize.
[2024-06-01 15:11:39] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:11:40] [INFO ] Deduced a trap composed of 409 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:11:40] [INFO ] Deduced a trap composed of 346 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:11:40] [INFO ] Deduced a trap composed of 396 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:11:41] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:11:41] [INFO ] Deduced a trap composed of 356 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 363 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 415 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 415 places in 305 ms of which 4 ms to minimize.
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 393 places in 297 ms of which 4 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 415 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 356 places in 204 ms of which 3 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 377 places in 323 ms of which 4 ms to minimize.
[2024-06-01 15:11:44] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:11:45] [INFO ] Deduced a trap composed of 282 places in 357 ms of which 4 ms to minimize.
[2024-06-01 15:11:46] [INFO ] Deduced a trap composed of 412 places in 318 ms of which 4 ms to minimize.
[2024-06-01 15:11:46] [INFO ] Deduced a trap composed of 374 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:11:46] [INFO ] Deduced a trap composed of 347 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:11:48] [INFO ] Deduced a trap composed of 348 places in 315 ms of which 4 ms to minimize.
[2024-06-01 15:11:48] [INFO ] Deduced a trap composed of 326 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:11:48] [INFO ] Deduced a trap composed of 344 places in 231 ms of which 3 ms to minimize.
[2024-06-01 15:11:49] [INFO ] Deduced a trap composed of 328 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:11:49] [INFO ] Deduced a trap composed of 356 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1806 variables, and 68 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1806 variables, and 68 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 25/25 constraints]
After SMT, in 41089ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 41099ms
Finished structural reductions in LTL mode , in 1 iterations and 41116 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:12:09] [INFO ] Flatten gal took : 34 ms
[2024-06-01 15:12:09] [INFO ] Flatten gal took : 40 ms
[2024-06-01 15:12:09] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Applied a total of 0 rules in 7 ms. Remains 612 /612 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Running 1230 sub problems to find dead transitions.
[2024-06-01 15:12:09] [INFO ] Flow matrix only has 1210 transitions (discarded 24 similar events)
// Phase 1: matrix 1210 rows 612 cols
[2024-06-01 15:12:09] [INFO ] Computed 54 invariants in 65 ms
[2024-06-01 15:12:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 15:12:21] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:12:22] [INFO ] Deduced a trap composed of 139 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:12:22] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 4 ms to minimize.
[2024-06-01 15:12:22] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 4 ms to minimize.
[2024-06-01 15:12:23] [INFO ] Deduced a trap composed of 376 places in 322 ms of which 4 ms to minimize.
[2024-06-01 15:12:23] [INFO ] Deduced a trap composed of 344 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:12:23] [INFO ] Deduced a trap composed of 389 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:12:23] [INFO ] Deduced a trap composed of 353 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:12:25] [INFO ] Deduced a trap composed of 377 places in 344 ms of which 4 ms to minimize.
[2024-06-01 15:12:26] [INFO ] Deduced a trap composed of 402 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:12:26] [INFO ] Deduced a trap composed of 333 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:12:26] [INFO ] Deduced a trap composed of 380 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:12:26] [INFO ] Deduced a trap composed of 376 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:12:27] [INFO ] Deduced a trap composed of 352 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:12:27] [INFO ] Deduced a trap composed of 334 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:12:28] [INFO ] Deduced a trap composed of 345 places in 260 ms of which 4 ms to minimize.
[2024-06-01 15:12:28] [INFO ] Deduced a trap composed of 334 places in 346 ms of which 4 ms to minimize.
[2024-06-01 15:12:29] [INFO ] Deduced a trap composed of 352 places in 297 ms of which 4 ms to minimize.
[2024-06-01 15:12:29] [INFO ] Deduced a trap composed of 308 places in 262 ms of which 2 ms to minimize.
[2024-06-01 15:12:29] [INFO ] Deduced a trap composed of 288 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 15:12:31] [INFO ] Deduced a trap composed of 359 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/1822 variables, and 65 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 15:12:39] [INFO ] Deduced a trap composed of 409 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:12:39] [INFO ] Deduced a trap composed of 346 places in 294 ms of which 3 ms to minimize.
[2024-06-01 15:12:39] [INFO ] Deduced a trap composed of 386 places in 280 ms of which 4 ms to minimize.
[2024-06-01 15:12:40] [INFO ] Deduced a trap composed of 367 places in 353 ms of which 4 ms to minimize.
[2024-06-01 15:12:40] [INFO ] Deduced a trap composed of 369 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:12:40] [INFO ] Deduced a trap composed of 385 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:12:41] [INFO ] Deduced a trap composed of 82 places in 315 ms of which 3 ms to minimize.
[2024-06-01 15:12:41] [INFO ] Deduced a trap composed of 82 places in 315 ms of which 4 ms to minimize.
[2024-06-01 15:12:41] [INFO ] Deduced a trap composed of 82 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:12:42] [INFO ] Deduced a trap composed of 82 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:12:42] [INFO ] Deduced a trap composed of 290 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:12:42] [INFO ] Deduced a trap composed of 339 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:12:42] [INFO ] Deduced a trap composed of 327 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 342 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 387 places in 316 ms of which 4 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 333 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 310 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 337 places in 326 ms of which 3 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 339 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 325 places in 232 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/1822 variables, and 85 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 41/41 constraints]
After SMT, in 41522ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 41538ms
Finished structural reductions in LTL mode , in 1 iterations and 41548 ms. Remains : 612/612 places, 1234/1234 transitions.
[2024-06-01 15:12:51] [INFO ] Flatten gal took : 58 ms
[2024-06-01 15:12:51] [INFO ] Flatten gal took : 51 ms
[2024-06-01 15:12:51] [INFO ] Input system was already deterministic with 1234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 21 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:12:51] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 602 cols
[2024-06-01 15:12:51] [INFO ] Computed 50 invariants in 33 ms
[2024-06-01 15:12:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:13:02] [INFO ] Deduced a trap composed of 268 places in 251 ms of which 6 ms to minimize.
[2024-06-01 15:13:02] [INFO ] Deduced a trap composed of 139 places in 239 ms of which 4 ms to minimize.
[2024-06-01 15:13:02] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:13:02] [INFO ] Deduced a trap composed of 348 places in 234 ms of which 6 ms to minimize.
[2024-06-01 15:13:03] [INFO ] Deduced a trap composed of 411 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:13:03] [INFO ] Deduced a trap composed of 396 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:13:03] [INFO ] Deduced a trap composed of 406 places in 237 ms of which 4 ms to minimize.
[2024-06-01 15:13:03] [INFO ] Deduced a trap composed of 361 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:13:04] [INFO ] Deduced a trap composed of 401 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:13:04] [INFO ] Deduced a trap composed of 418 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:13:04] [INFO ] Deduced a trap composed of 382 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:13:05] [INFO ] Deduced a trap composed of 337 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:13:05] [INFO ] Deduced a trap composed of 308 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:13:05] [INFO ] Deduced a trap composed of 304 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:13:06] [INFO ] Deduced a trap composed of 379 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:13:06] [INFO ] Deduced a trap composed of 404 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:13:07] [INFO ] Deduced a trap composed of 395 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:13:07] [INFO ] Deduced a trap composed of 392 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:13:07] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:13:08] [INFO ] Deduced a trap composed of 392 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:13:09] [INFO ] Deduced a trap composed of 363 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 377 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 335 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:13:10] [INFO ] Deduced a trap composed of 344 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:13:11] [INFO ] Deduced a trap composed of 318 places in 288 ms of which 3 ms to minimize.
[2024-06-01 15:13:11] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 4 ms to minimize.
[2024-06-01 15:13:13] [INFO ] Deduced a trap composed of 284 places in 308 ms of which 3 ms to minimize.
SMT process timed out in 21763ms, After SMT, problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 21774ms
Finished structural reductions in LTL mode , in 1 iterations and 21800 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:13:13] [INFO ] Flatten gal took : 37 ms
[2024-06-01 15:13:13] [INFO ] Flatten gal took : 39 ms
[2024-06-01 15:13:13] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 15 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:13:13] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-06-01 15:13:13] [INFO ] Invariant cache hit.
[2024-06-01 15:13:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:13:24] [INFO ] Deduced a trap composed of 139 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:13:25] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 4 ms to minimize.
[2024-06-01 15:13:25] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:13:25] [INFO ] Deduced a trap composed of 409 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:13:25] [INFO ] Deduced a trap composed of 346 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:13:25] [INFO ] Deduced a trap composed of 396 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:13:26] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:13:27] [INFO ] Deduced a trap composed of 356 places in 319 ms of which 4 ms to minimize.
[2024-06-01 15:13:27] [INFO ] Deduced a trap composed of 363 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:13:27] [INFO ] Deduced a trap composed of 415 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:13:27] [INFO ] Deduced a trap composed of 415 places in 312 ms of which 4 ms to minimize.
[2024-06-01 15:13:28] [INFO ] Deduced a trap composed of 393 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:13:28] [INFO ] Deduced a trap composed of 415 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:13:28] [INFO ] Deduced a trap composed of 356 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:13:28] [INFO ] Deduced a trap composed of 377 places in 329 ms of which 4 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 282 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 412 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 374 places in 300 ms of which 4 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 347 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:13:32] [INFO ] Deduced a trap composed of 348 places in 310 ms of which 3 ms to minimize.
[2024-06-01 15:13:33] [INFO ] Deduced a trap composed of 326 places in 277 ms of which 4 ms to minimize.
[2024-06-01 15:13:33] [INFO ] Deduced a trap composed of 344 places in 313 ms of which 4 ms to minimize.
[2024-06-01 15:13:33] [INFO ] Deduced a trap composed of 328 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:13:33] [INFO ] Deduced a trap composed of 356 places in 264 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1806 variables, and 68 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1806 variables, and 68 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 25/25 constraints]
After SMT, in 41238ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 41247ms
Finished structural reductions in LTL mode , in 1 iterations and 41265 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:13:54] [INFO ] Flatten gal took : 51 ms
[2024-06-01 15:13:54] [INFO ] Flatten gal took : 45 ms
[2024-06-01 15:13:55] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1234/1234 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 608 transition count 1234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 602 transition count 1228
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 602 transition count 1228
Applied a total of 16 rules in 22 ms. Remains 602 /612 variables (removed 10) and now considering 1228/1234 (removed 6) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 15:13:55] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
[2024-06-01 15:13:55] [INFO ] Invariant cache hit.
[2024-06-01 15:13:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:14:05] [INFO ] Deduced a trap composed of 139 places in 277 ms of which 4 ms to minimize.
[2024-06-01 15:14:05] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:14:06] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 4 ms to minimize.
[2024-06-01 15:14:06] [INFO ] Deduced a trap composed of 409 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:14:06] [INFO ] Deduced a trap composed of 346 places in 204 ms of which 3 ms to minimize.
[2024-06-01 15:14:07] [INFO ] Deduced a trap composed of 396 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:14:07] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 356 places in 317 ms of which 4 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 363 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 415 places in 262 ms of which 3 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 415 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 393 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 415 places in 275 ms of which 2 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 356 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:14:10] [INFO ] Deduced a trap composed of 377 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:14:10] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:14:11] [INFO ] Deduced a trap composed of 282 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:14:12] [INFO ] Deduced a trap composed of 412 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:14:12] [INFO ] Deduced a trap composed of 374 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:14:12] [INFO ] Deduced a trap composed of 347 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 15:14:13] [INFO ] Deduced a trap composed of 348 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 326 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 344 places in 253 ms of which 2 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 328 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 356 places in 243 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1806 variables, and 68 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1806 variables, and 68 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 25/25 constraints]
After SMT, in 41287ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 41304ms
Finished structural reductions in LTL mode , in 1 iterations and 41330 ms. Remains : 602/612 places, 1228/1234 transitions.
[2024-06-01 15:14:36] [INFO ] Flatten gal took : 31 ms
[2024-06-01 15:14:36] [INFO ] Flatten gal took : 62 ms
[2024-06-01 15:14:36] [INFO ] Input system was already deterministic with 1228 transitions.
[2024-06-01 15:14:36] [INFO ] Flatten gal took : 49 ms
[2024-06-01 15:14:36] [INFO ] Flatten gal took : 51 ms
[2024-06-01 15:14:36] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 34 ms.
[2024-06-01 15:14:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 1234 transitions and 5532 arcs took 8 ms.
Total runtime 485965 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLFireability-2024-15

BK_STOP 1717254877283

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1620/ctl_0_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1620/ctl_1_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1620/ctl_2_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1620/ctl_3_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1620/ctl_4_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1620/ctl_5_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1620/ctl_6_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1620/ctl_7_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1620/ctl_8_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1620/ctl_9_
ctl formula name PolyORBLF-PT-S04J06T06-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1620/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S04J06T06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S04J06T06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446800290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T06.tgz
mv PolyORBLF-PT-S04J06T06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;