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-171654447200489.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 PolyORBNT-PT-S10J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200489
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717261142685

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:59:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:59:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:59:05] [INFO ] Load time of PNML (sax parser for PT used): 862 ms
[2024-06-01 16:59:05] [INFO ] Transformed 664 places.
[2024-06-01 16:59:05] [INFO ] Transformed 12050 transitions.
[2024-06-01 16:59:05] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 1117 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 185 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Applied a total of 10 rules in 107 ms. Remains 654 /664 variables (removed 10) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-06-01 16:59:06] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 654 cols
[2024-06-01 16:59:06] [INFO ] Computed 82 invariants in 108 ms
[2024-06-01 16:59:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20099 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 56128ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 56183ms
[2024-06-01 17:00:02] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:00:02] [INFO ] Invariant cache hit.
[2024-06-01 17:00:02] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-06-01 17:00:02] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:00:03] [INFO ] Invariant cache hit.
[2024-06-01 17:00:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:00:08] [INFO ] Implicit Places using invariants and state equation in 5948 ms returned []
Implicit Place search using SMT with State Equation took 6742 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-06-01 17:00:09] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:00:09] [INFO ] Invariant cache hit.
[2024-06-01 17:00:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1764 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/654 variables, 11/82 constraints. Problems are: Problem set: 539 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/2585 variables, and 82 constraints, problems are : Problem set: 539 solved, 1390 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 78324ms problems are : Problem set: 539 solved, 1390 unsolved
Search for dead transitions found 539 dead transitions in 78372ms
Found 539 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 539 transitions
Dead transitions reduction (with SMT) removed 539 transitions
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1401/1940 transitions.
Applied a total of 0 rules in 15 ms. Remains 654 /654 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141491 ms. Remains : 654/664 places, 1401/1940 transitions.
Support contains 185 out of 654 places after structural reductions.
[2024-06-01 17:01:27] [INFO ] Flatten gal took : 221 ms
[2024-06-01 17:01:27] [INFO ] Flatten gal took : 139 ms
[2024-06-01 17:01:28] [INFO ] Input system was already deterministic with 1401 transitions.
RANDOM walk for 40000 steps (2239 resets) in 2313 ms. (17 steps per ms) remains 65/71 properties
BEST_FIRST walk for 4004 steps (39 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (41 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (12 resets) in 54 ms. (72 steps per ms) remains 60/65 properties
BEST_FIRST walk for 4003 steps (40 resets) in 101 ms. (39 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 64 ms. (61 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (48 resets) in 56 ms. (70 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (40 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (38 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 70 ms. (56 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (39 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (40 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (39 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (42 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (41 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (41 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (39 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (41 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (40 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
[2024-06-01 17:01:29] [INFO ] Flow matrix only has 1392 transitions (discarded 9 similar events)
// Phase 1: matrix 1392 rows 654 cols
[2024-06-01 17:01:29] [INFO ] Computed 82 invariants in 55 ms
[2024-06-01 17:01:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 347/515 variables, 53/53 constraints. Problems are: Problem set: 24 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 2/55 constraints. Problems are: Problem set: 24 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 0/55 constraints. Problems are: Problem set: 24 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 90/605 variables, 9/64 constraints. Problems are: Problem set: 24 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 0/64 constraints. Problems are: Problem set: 24 solved, 36 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 6 (OVERLAPS) 48/653 variables, 17/81 constraints. Problems are: Problem set: 41 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/81 constraints. Problems are: Problem set: 41 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/654 variables, 1/82 constraints. Problems are: Problem set: 41 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/82 constraints. Problems are: Problem set: 41 solved, 19 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 10 (OVERLAPS) 1392/2046 variables, 654/736 constraints. Problems are: Problem set: 42 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2046 variables, 1/737 constraints. Problems are: Problem set: 42 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2046 variables, 0/737 constraints. Problems are: Problem set: 42 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/2046 variables, 0/737 constraints. Problems are: Problem set: 42 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2046/2046 variables, and 737 constraints, problems are : Problem set: 42 solved, 18 unsolved in 3738 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 654/654 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 316/407 variables, 43/43 constraints. Problems are: Problem set: 42 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/43 constraints. Problems are: Problem set: 42 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 170/577 variables, 17/60 constraints. Problems are: Problem set: 42 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 0/60 constraints. Problems are: Problem set: 42 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 73/650 variables, 19/79 constraints. Problems are: Problem set: 42 solved, 18 unsolved
[2024-06-01 17:01:34] [INFO ] Deduced a trap composed of 299 places in 455 ms of which 32 ms to minimize.
[2024-06-01 17:01:35] [INFO ] Deduced a trap composed of 328 places in 488 ms of which 6 ms to minimize.
[2024-06-01 17:01:35] [INFO ] Deduced a trap composed of 308 places in 340 ms of which 5 ms to minimize.
[2024-06-01 17:01:35] [INFO ] Deduced a trap composed of 303 places in 345 ms of which 5 ms to minimize.
[2024-06-01 17:01:36] [INFO ] Deduced a trap composed of 318 places in 308 ms of which 3 ms to minimize.
[2024-06-01 17:01:36] [INFO ] Deduced a trap composed of 299 places in 321 ms of which 3 ms to minimize.
[2024-06-01 17:01:36] [INFO ] Deduced a trap composed of 303 places in 296 ms of which 4 ms to minimize.
[2024-06-01 17:01:37] [INFO ] Deduced a trap composed of 275 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:01:37] [INFO ] Deduced a trap composed of 305 places in 282 ms of which 3 ms to minimize.
[2024-06-01 17:01:37] [INFO ] Deduced a trap composed of 297 places in 284 ms of which 3 ms to minimize.
[2024-06-01 17:01:38] [INFO ] Deduced a trap composed of 303 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:01:38] [INFO ] Deduced a trap composed of 316 places in 324 ms of which 3 ms to minimize.
[2024-06-01 17:01:38] [INFO ] Deduced a trap composed of 307 places in 334 ms of which 3 ms to minimize.
SMT process timed out in 9092ms, After SMT, problems are : Problem set: 42 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 654 transition count 1373
Reduce places removed 28 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 33 rules applied. Total rules applied 61 place count 626 transition count 1368
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 621 transition count 1368
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 66 place count 621 transition count 1339
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 124 place count 592 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 591 transition count 1338
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 591 transition count 1338
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 589 transition count 1336
Applied a total of 130 rules in 202 ms. Remains 589 /654 variables (removed 65) and now considering 1336/1401 (removed 65) transitions.
Running 1325 sub problems to find dead transitions.
[2024-06-01 17:01:38] [INFO ] Flow matrix only has 1327 transitions (discarded 9 similar events)
// Phase 1: matrix 1327 rows 589 cols
[2024-06-01 17:01:38] [INFO ] Computed 82 invariants in 30 ms
[2024-06-01 17:01:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 (/ 1.0 3.0))
(s5 2.0)
(s6 0.0)
(s7 (/ 1.0 3.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 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 (/ 2.0 3.0))
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.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 9.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 3.0)
(s101 0.0)
(s102 3.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 timeout
0.0)
(s117 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1916 variables, and 71 constraints, problems are : Problem set: 0 solved, 1325 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/589 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Problem TDEAD550 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1010 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/589 variables, 11/82 constraints. Problems are: Problem set: 76 solved, 1249 unsolved
[2024-06-01 17:02:23] [INFO ] Deduced a trap composed of 242 places in 333 ms of which 4 ms to minimize.
[2024-06-01 17:02:23] [INFO ] Deduced a trap composed of 248 places in 330 ms of which 3 ms to minimize.
[2024-06-01 17:02:23] [INFO ] Deduced a trap composed of 242 places in 299 ms of which 3 ms to minimize.
[2024-06-01 17:02:24] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 4 ms to minimize.
[2024-06-01 17:02:24] [INFO ] Deduced a trap composed of 243 places in 297 ms of which 3 ms to minimize.
[2024-06-01 17:02:24] [INFO ] Deduced a trap composed of 248 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:02:24] [INFO ] Deduced a trap composed of 248 places in 293 ms of which 3 ms to minimize.
SMT process timed out in 46025ms, After SMT, problems are : Problem set: 76 solved, 1249 unsolved
Search for dead transitions found 76 dead transitions in 46038ms
Found 76 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 76 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 589/654 places, 1260/1401 transitions.
Applied a total of 0 rules in 44 ms. Remains 589 /589 variables (removed 0) and now considering 1260/1260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46289 ms. Remains : 589/654 places, 1260/1401 transitions.
RANDOM walk for 40000 steps (2888 resets) in 1906 ms. (20 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40003 steps (429 resets) in 127 ms. (312 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (432 resets) in 116 ms. (341 steps per ms) remains 1/2 properties
BEST_FIRST walk for 35544 steps (382 resets) in 105 ms. (335 steps per ms) remains 0/1 properties
Successfully simplified 42 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:02:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 17:02:25] [INFO ] Flatten gal took : 103 ms
[2024-06-01 17:02:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:02:25] [INFO ] Flatten gal took : 69 ms
[2024-06-01 17:02:26] [INFO ] Input system was already deterministic with 1401 transitions.
Support contains 59 out of 654 places (down from 61) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1400
Applied a total of 2 rules in 26 ms. Remains 653 /654 variables (removed 1) and now considering 1400/1401 (removed 1) transitions.
Running 1389 sub problems to find dead transitions.
[2024-06-01 17:02:26] [INFO ] Flow matrix only has 1391 transitions (discarded 9 similar events)
// Phase 1: matrix 1391 rows 653 cols
[2024-06-01 17:02:26] [INFO ] Computed 82 invariants in 21 ms
[2024-06-01 17:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2044 variables, and 71 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1389/1389 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:02:55] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 2 ms to minimize.
[2024-06-01 17:02:57] [INFO ] Deduced a trap composed of 83 places in 285 ms of which 4 ms to minimize.
[2024-06-01 17:02:57] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 2 ms to minimize.
[2024-06-01 17:02:57] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 2 ms to minimize.
[2024-06-01 17:02:58] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 3 ms to minimize.
[2024-06-01 17:02:58] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 4 ms to minimize.
[2024-06-01 17:02:58] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:02:59] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 2 ms to minimize.
[2024-06-01 17:02:59] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 2 ms to minimize.
[2024-06-01 17:03:00] [INFO ] Deduced a trap composed of 82 places in 236 ms of which 3 ms to minimize.
[2024-06-01 17:03:03] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:03:04] [INFO ] Deduced a trap composed of 83 places in 177 ms of which 3 ms to minimize.
[2024-06-01 17:03:04] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 2 ms to minimize.
[2024-06-01 17:03:04] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 2 ms to minimize.
[2024-06-01 17:03:04] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 2 ms to minimize.
[2024-06-01 17:03:04] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 3 ms to minimize.
[2024-06-01 17:03:05] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 3 ms to minimize.
[2024-06-01 17:03:05] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 1 ms to minimize.
[2024-06-01 17:03:06] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 2 ms to minimize.
[2024-06-01 17:03:07] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:03:08] [INFO ] Deduced a trap composed of 83 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:03:09] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2044 variables, and 93 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1389 constraints, Known Traps: 22/22 constraints]
After SMT, in 46081ms problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 46095ms
Finished structural reductions in LTL mode , in 1 iterations and 46124 ms. Remains : 653/654 places, 1400/1401 transitions.
[2024-06-01 17:03:12] [INFO ] Flatten gal took : 89 ms
[2024-06-01 17:03:12] [INFO ] Flatten gal took : 81 ms
[2024-06-01 17:03:12] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1366
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1366
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 70 place count 619 transition count 1333
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 136 place count 586 transition count 1333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 585 transition count 1332
Applied a total of 138 rules in 114 ms. Remains 585 /654 variables (removed 69) and now considering 1332/1401 (removed 69) transitions.
Running 1321 sub problems to find dead transitions.
[2024-06-01 17:03:12] [INFO ] Flow matrix only has 1323 transitions (discarded 9 similar events)
// Phase 1: matrix 1323 rows 585 cols
[2024-06-01 17:03:12] [INFO ] Computed 82 invariants in 22 ms
[2024-06-01 17:03:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1321 unsolved
[2024-06-01 17:03:31] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:03:32] [INFO ] Deduced a trap composed of 156 places in 244 ms of which 4 ms to minimize.
[2024-06-01 17:03:32] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 4 ms to minimize.
[2024-06-01 17:03:33] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 3 ms to minimize.
[2024-06-01 17:03:33] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:03:34] [INFO ] Deduced a trap composed of 236 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:03:34] [INFO ] Deduced a trap composed of 256 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:03:34] [INFO ] Deduced a trap composed of 253 places in 211 ms of which 2 ms to minimize.
[2024-06-01 17:03:35] [INFO ] Deduced a trap composed of 166 places in 244 ms of which 4 ms to minimize.
[2024-06-01 17:03:35] [INFO ] Deduced a trap composed of 147 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:03:38] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 3 ms to minimize.
SMT process timed out in 25987ms, After SMT, problems are : Problem set: 0 solved, 1321 unsolved
Search for dead transitions found 0 dead transitions in 26003ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 26122 ms. Remains : 585/654 places, 1332/1401 transitions.
[2024-06-01 17:03:38] [INFO ] Flatten gal took : 55 ms
[2024-06-01 17:03:38] [INFO ] Flatten gal took : 58 ms
[2024-06-01 17:03:38] [INFO ] Input system was already deterministic with 1332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1365
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1365
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1331
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 584 transition count 1331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1330
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1330
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 581 transition count 1328
Applied a total of 146 rules in 83 ms. Remains 581 /654 variables (removed 73) and now considering 1328/1401 (removed 73) transitions.
Running 1317 sub problems to find dead transitions.
[2024-06-01 17:03:39] [INFO ] Flow matrix only has 1319 transitions (discarded 9 similar events)
// Phase 1: matrix 1319 rows 581 cols
[2024-06-01 17:03:39] [INFO ] Computed 82 invariants in 17 ms
[2024-06-01 17:03:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
[2024-06-01 17:03:56] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 4 ms to minimize.
[2024-06-01 17:03:56] [INFO ] Deduced a trap composed of 157 places in 234 ms of which 4 ms to minimize.
[2024-06-01 17:03:56] [INFO ] Deduced a trap composed of 152 places in 251 ms of which 4 ms to minimize.
[2024-06-01 17:03:57] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 9 ms to minimize.
[2024-06-01 17:03:58] [INFO ] Deduced a trap composed of 152 places in 233 ms of which 3 ms to minimize.
[2024-06-01 17:03:59] [INFO ] Deduced a trap composed of 153 places in 259 ms of which 3 ms to minimize.
[2024-06-01 17:04:00] [INFO ] Deduced a trap composed of 167 places in 239 ms of which 4 ms to minimize.
[2024-06-01 17:04:00] [INFO ] Deduced a trap composed of 152 places in 260 ms of which 4 ms to minimize.
[2024-06-01 17:04:01] [INFO ] Deduced a trap composed of 152 places in 228 ms of which 4 ms to minimize.
[2024-06-01 17:04:01] [INFO ] Deduced a trap composed of 157 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:04:01] [INFO ] Deduced a trap composed of 167 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:04:02] [INFO ] Deduced a trap composed of 157 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:04:02] [INFO ] Deduced a trap composed of 153 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:04:03] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1900 variables, and 86 constraints, problems are : Problem set: 0 solved, 1317 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1317/1317 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
[2024-06-01 17:04:07] [INFO ] Deduced a trap composed of 152 places in 187 ms of which 3 ms to minimize.
[2024-06-01 17:04:07] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 3 ms to minimize.
[2024-06-01 17:04:07] [INFO ] Deduced a trap composed of 80 places in 233 ms of which 3 ms to minimize.
[2024-06-01 17:04:07] [INFO ] Deduced a trap composed of 157 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:04:07] [INFO ] Deduced a trap composed of 79 places in 187 ms of which 3 ms to minimize.
[2024-06-01 17:04:08] [INFO ] Deduced a trap composed of 182 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:04:08] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:04:08] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:04:08] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:04:08] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 3 ms to minimize.
[2024-06-01 17:04:09] [INFO ] Deduced a trap composed of 143 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:04:09] [INFO ] Deduced a trap composed of 112 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:04:09] [INFO ] Deduced a trap composed of 123 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:04:09] [INFO ] Deduced a trap composed of 106 places in 283 ms of which 3 ms to minimize.
[2024-06-01 17:04:10] [INFO ] Deduced a trap composed of 117 places in 281 ms of which 3 ms to minimize.
[2024-06-01 17:04:10] [INFO ] Deduced a trap composed of 107 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:04:10] [INFO ] Deduced a trap composed of 157 places in 285 ms of which 3 ms to minimize.
[2024-06-01 17:04:11] [INFO ] Deduced a trap composed of 153 places in 348 ms of which 4 ms to minimize.
[2024-06-01 17:04:11] [INFO ] Deduced a trap composed of 137 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:04:11] [INFO ] Deduced a trap composed of 142 places in 304 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
[2024-06-01 17:04:12] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:04:13] [INFO ] Deduced a trap composed of 142 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:04:13] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 3 ms to minimize.
[2024-06-01 17:04:13] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 3 ms to minimize.
[2024-06-01 17:04:13] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 4 ms to minimize.
[2024-06-01 17:04:13] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 3 ms to minimize.
[2024-06-01 17:04:14] [INFO ] Deduced a trap composed of 79 places in 187 ms of which 3 ms to minimize.
[2024-06-01 17:04:14] [INFO ] Deduced a trap composed of 80 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:04:14] [INFO ] Deduced a trap composed of 130 places in 260 ms of which 3 ms to minimize.
[2024-06-01 17:04:14] [INFO ] Deduced a trap composed of 124 places in 238 ms of which 3 ms to minimize.
[2024-06-01 17:04:15] [INFO ] Deduced a trap composed of 130 places in 239 ms of which 4 ms to minimize.
[2024-06-01 17:04:15] [INFO ] Deduced a trap composed of 142 places in 223 ms of which 3 ms to minimize.
[2024-06-01 17:04:15] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:04:15] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:04:16] [INFO ] Deduced a trap composed of 79 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:04:16] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 4 ms to minimize.
[2024-06-01 17:04:16] [INFO ] Deduced a trap composed of 80 places in 218 ms of which 3 ms to minimize.
[2024-06-01 17:04:16] [INFO ] Deduced a trap composed of 152 places in 238 ms of which 4 ms to minimize.
[2024-06-01 17:04:17] [INFO ] Deduced a trap composed of 157 places in 240 ms of which 3 ms to minimize.
[2024-06-01 17:04:17] [INFO ] Deduced a trap composed of 153 places in 219 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 1317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1900 variables, and 126 constraints, problems are : Problem set: 0 solved, 1317 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1317 constraints, Known Traps: 54/54 constraints]
After SMT, in 46539ms problems are : Problem set: 0 solved, 1317 unsolved
Search for dead transitions found 0 dead transitions in 46552ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46638 ms. Remains : 581/654 places, 1328/1401 transitions.
[2024-06-01 17:04:25] [INFO ] Flatten gal took : 53 ms
[2024-06-01 17:04:25] [INFO ] Flatten gal took : 64 ms
[2024-06-01 17:04:25] [INFO ] Input system was already deterministic with 1328 transitions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1400
Applied a total of 2 rules in 32 ms. Remains 653 /654 variables (removed 1) and now considering 1400/1401 (removed 1) transitions.
Running 1389 sub problems to find dead transitions.
[2024-06-01 17:04:25] [INFO ] Flow matrix only has 1391 transitions (discarded 9 similar events)
// Phase 1: matrix 1391 rows 653 cols
[2024-06-01 17:04:25] [INFO ] Computed 82 invariants in 21 ms
[2024-06-01 17:04:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2044 variables, and 71 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1389/1389 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:04:55] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 2 ms to minimize.
[2024-06-01 17:04:57] [INFO ] Deduced a trap composed of 83 places in 316 ms of which 3 ms to minimize.
[2024-06-01 17:04:57] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 2 ms to minimize.
[2024-06-01 17:04:58] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 2 ms to minimize.
[2024-06-01 17:04:58] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 2 ms to minimize.
[2024-06-01 17:04:58] [INFO ] Deduced a trap composed of 82 places in 219 ms of which 2 ms to minimize.
[2024-06-01 17:04:59] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:04:59] [INFO ] Deduced a trap composed of 82 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:05:00] [INFO ] Deduced a trap composed of 82 places in 180 ms of which 2 ms to minimize.
[2024-06-01 17:05:01] [INFO ] Deduced a trap composed of 82 places in 243 ms of which 3 ms to minimize.
[2024-06-01 17:05:03] [INFO ] Deduced a trap composed of 82 places in 172 ms of which 2 ms to minimize.
[2024-06-01 17:05:04] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 2 ms to minimize.
[2024-06-01 17:05:04] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-06-01 17:05:05] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 2 ms to minimize.
[2024-06-01 17:05:05] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2024-06-01 17:05:05] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 2 ms to minimize.
[2024-06-01 17:05:05] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:05:06] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 2 ms to minimize.
[2024-06-01 17:05:06] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 2 ms to minimize.
[2024-06-01 17:05:08] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:05:09] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:05:10] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2044 variables, and 93 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1389 constraints, Known Traps: 22/22 constraints]
After SMT, in 46921ms problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 46936ms
Finished structural reductions in LTL mode , in 1 iterations and 46971 ms. Remains : 653/654 places, 1400/1401 transitions.
[2024-06-01 17:05:12] [INFO ] Flatten gal took : 89 ms
[2024-06-01 17:05:13] [INFO ] Flatten gal took : 96 ms
[2024-06-01 17:05:13] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1367
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1367
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 68 place count 620 transition count 1332
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 138 place count 585 transition count 1332
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1331
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 583 transition count 1330
Applied a total of 142 rules in 130 ms. Remains 583 /654 variables (removed 71) and now considering 1330/1401 (removed 71) transitions.
Running 1319 sub problems to find dead transitions.
[2024-06-01 17:05:13] [INFO ] Flow matrix only has 1321 transitions (discarded 9 similar events)
// Phase 1: matrix 1321 rows 583 cols
[2024-06-01 17:05:13] [INFO ] Computed 82 invariants in 20 ms
[2024-06-01 17:05:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1904 variables, and 71 constraints, problems are : Problem set: 0 solved, 1319 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1319/1319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1319 unsolved
[2024-06-01 17:05:41] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 1 ms to minimize.
[2024-06-01 17:05:42] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 1 ms to minimize.
[2024-06-01 17:05:43] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 1 ms to minimize.
[2024-06-01 17:05:43] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 1319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/1904 variables, and 75 constraints, problems are : Problem set: 0 solved, 1319 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1319 constraints, Known Traps: 4/4 constraints]
After SMT, in 46561ms problems are : Problem set: 0 solved, 1319 unsolved
Search for dead transitions found 0 dead transitions in 46577ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46711 ms. Remains : 583/654 places, 1330/1401 transitions.
[2024-06-01 17:05:59] [INFO ] Flatten gal took : 65 ms
[2024-06-01 17:06:00] [INFO ] Flatten gal took : 60 ms
[2024-06-01 17:06:00] [INFO ] Input system was already deterministic with 1330 transitions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1400
Applied a total of 2 rules in 37 ms. Remains 653 /654 variables (removed 1) and now considering 1400/1401 (removed 1) transitions.
Running 1389 sub problems to find dead transitions.
[2024-06-01 17:06:00] [INFO ] Flow matrix only has 1391 transitions (discarded 9 similar events)
// Phase 1: matrix 1391 rows 653 cols
[2024-06-01 17:06:00] [INFO ] Computed 82 invariants in 36 ms
[2024-06-01 17:06:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2044 variables, and 71 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1389/1389 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:06:29] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-06-01 17:06:31] [INFO ] Deduced a trap composed of 83 places in 299 ms of which 3 ms to minimize.
[2024-06-01 17:06:32] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 2 ms to minimize.
[2024-06-01 17:06:32] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 2 ms to minimize.
[2024-06-01 17:06:33] [INFO ] Deduced a trap composed of 82 places in 195 ms of which 2 ms to minimize.
[2024-06-01 17:06:33] [INFO ] Deduced a trap composed of 82 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:06:33] [INFO ] Deduced a trap composed of 82 places in 225 ms of which 2 ms to minimize.
[2024-06-01 17:06:34] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 2 ms to minimize.
[2024-06-01 17:06:34] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 2 ms to minimize.
[2024-06-01 17:06:35] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 4 ms to minimize.
[2024-06-01 17:06:37] [INFO ] Deduced a trap composed of 82 places in 189 ms of which 2 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 83 places in 209 ms of which 2 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 3 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 2 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 3 ms to minimize.
[2024-06-01 17:06:39] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 3 ms to minimize.
[2024-06-01 17:06:40] [INFO ] Deduced a trap composed of 82 places in 196 ms of which 3 ms to minimize.
[2024-06-01 17:06:40] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 2 ms to minimize.
[2024-06-01 17:06:41] [INFO ] Deduced a trap composed of 82 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:06:42] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:06:43] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 3 ms to minimize.
[2024-06-01 17:06:43] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2044 variables, and 93 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1389 constraints, Known Traps: 22/22 constraints]
After SMT, in 46549ms problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 46565ms
Finished structural reductions in LTL mode , in 1 iterations and 46607 ms. Remains : 653/654 places, 1400/1401 transitions.
[2024-06-01 17:06:46] [INFO ] Flatten gal took : 69 ms
[2024-06-01 17:06:46] [INFO ] Flatten gal took : 72 ms
[2024-06-01 17:06:46] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1365
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1365
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1330
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1329
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1329
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1327
Applied a total of 148 rules in 108 ms. Remains 580 /654 variables (removed 74) and now considering 1327/1401 (removed 74) transitions.
Running 1316 sub problems to find dead transitions.
[2024-06-01 17:06:47] [INFO ] Flow matrix only has 1318 transitions (discarded 9 similar events)
// Phase 1: matrix 1318 rows 580 cols
[2024-06-01 17:06:47] [INFO ] Computed 82 invariants in 32 ms
[2024-06-01 17:06:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
[2024-06-01 17:07:04] [INFO ] Deduced a trap composed of 161 places in 229 ms of which 4 ms to minimize.
[2024-06-01 17:07:05] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 3 ms to minimize.
[2024-06-01 17:07:05] [INFO ] Deduced a trap composed of 161 places in 222 ms of which 4 ms to minimize.
[2024-06-01 17:07:05] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:07:05] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:07:06] [INFO ] Deduced a trap composed of 176 places in 304 ms of which 4 ms to minimize.
[2024-06-01 17:07:06] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 4 ms to minimize.
[2024-06-01 17:07:07] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:07:07] [INFO ] Deduced a trap composed of 161 places in 218 ms of which 3 ms to minimize.
[2024-06-01 17:07:07] [INFO ] Deduced a trap composed of 156 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:07:08] [INFO ] Deduced a trap composed of 151 places in 218 ms of which 4 ms to minimize.
[2024-06-01 17:07:08] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 5 ms to minimize.
[2024-06-01 17:07:09] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 4 ms to minimize.
[2024-06-01 17:07:10] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 3 ms to minimize.
[2024-06-01 17:07:11] [INFO ] Deduced a trap composed of 146 places in 245 ms of which 3 ms to minimize.
[2024-06-01 17:07:11] [INFO ] Deduced a trap composed of 116 places in 230 ms of which 4 ms to minimize.
[2024-06-01 17:07:12] [INFO ] Deduced a trap composed of 131 places in 267 ms of which 4 ms to minimize.
[2024-06-01 17:07:12] [INFO ] Deduced a trap composed of 151 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:07:12] [INFO ] Deduced a trap composed of 151 places in 181 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1898 variables, and 91 constraints, problems are : Problem set: 0 solved, 1316 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1316/1316 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
[2024-06-01 17:07:15] [INFO ] Deduced a trap composed of 181 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:07:15] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 4 ms to minimize.
[2024-06-01 17:07:16] [INFO ] Deduced a trap composed of 230 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:07:16] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:07:16] [INFO ] Deduced a trap composed of 181 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:07:16] [INFO ] Deduced a trap composed of 161 places in 191 ms of which 4 ms to minimize.
[2024-06-01 17:07:17] [INFO ] Deduced a trap composed of 151 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:07:17] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:07:18] [INFO ] Deduced a trap composed of 153 places in 363 ms of which 5 ms to minimize.
[2024-06-01 17:07:18] [INFO ] Deduced a trap composed of 238 places in 329 ms of which 3 ms to minimize.
[2024-06-01 17:07:19] [INFO ] Deduced a trap composed of 228 places in 324 ms of which 3 ms to minimize.
[2024-06-01 17:07:19] [INFO ] Deduced a trap composed of 152 places in 345 ms of which 4 ms to minimize.
[2024-06-01 17:07:19] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2024-06-01 17:07:20] [INFO ] Deduced a trap composed of 244 places in 345 ms of which 4 ms to minimize.
[2024-06-01 17:07:20] [INFO ] Deduced a trap composed of 240 places in 354 ms of which 4 ms to minimize.
[2024-06-01 17:07:21] [INFO ] Deduced a trap composed of 251 places in 358 ms of which 4 ms to minimize.
[2024-06-01 17:07:21] [INFO ] Deduced a trap composed of 244 places in 293 ms of which 3 ms to minimize.
[2024-06-01 17:07:21] [INFO ] Deduced a trap composed of 264 places in 267 ms of which 3 ms to minimize.
[2024-06-01 17:07:22] [INFO ] Deduced a trap composed of 260 places in 323 ms of which 4 ms to minimize.
[2024-06-01 17:07:22] [INFO ] Deduced a trap composed of 269 places in 286 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
[2024-06-01 17:07:23] [INFO ] Deduced a trap composed of 146 places in 250 ms of which 3 ms to minimize.
[2024-06-01 17:07:23] [INFO ] Deduced a trap composed of 141 places in 216 ms of which 4 ms to minimize.
[2024-06-01 17:07:23] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 4 ms to minimize.
[2024-06-01 17:07:24] [INFO ] Deduced a trap composed of 141 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:07:24] [INFO ] Deduced a trap composed of 151 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:07:24] [INFO ] Deduced a trap composed of 146 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:07:24] [INFO ] Deduced a trap composed of 151 places in 179 ms of which 3 ms to minimize.
[2024-06-01 17:07:25] [INFO ] Deduced a trap composed of 146 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:07:25] [INFO ] Deduced a trap composed of 156 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:07:25] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 5 ms to minimize.
[2024-06-01 17:07:26] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:07:26] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:07:26] [INFO ] Deduced a trap composed of 146 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:07:26] [INFO ] Deduced a trap composed of 248 places in 246 ms of which 2 ms to minimize.
[2024-06-01 17:07:27] [INFO ] Deduced a trap composed of 121 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:07:28] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 4 ms to minimize.
[2024-06-01 17:07:29] [INFO ] Deduced a trap composed of 78 places in 370 ms of which 4 ms to minimize.
[2024-06-01 17:07:29] [INFO ] Deduced a trap composed of 116 places in 360 ms of which 4 ms to minimize.
[2024-06-01 17:07:30] [INFO ] Deduced a trap composed of 126 places in 345 ms of which 4 ms to minimize.
[2024-06-01 17:07:30] [INFO ] Deduced a trap composed of 146 places in 381 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 106 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 146 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 146 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 121 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 116 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 106 places in 248 ms of which 4 ms to minimize.
SMT process timed out in 46861ms, After SMT, problems are : Problem set: 0 solved, 1316 unsolved
Search for dead transitions found 0 dead transitions in 46890ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 47003 ms. Remains : 580/654 places, 1327/1401 transitions.
[2024-06-01 17:07:34] [INFO ] Flatten gal took : 52 ms
[2024-06-01 17:07:34] [INFO ] Flatten gal took : 56 ms
[2024-06-01 17:07:34] [INFO ] Input system was already deterministic with 1327 transitions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1400
Applied a total of 2 rules in 25 ms. Remains 653 /654 variables (removed 1) and now considering 1400/1401 (removed 1) transitions.
Running 1389 sub problems to find dead transitions.
[2024-06-01 17:07:34] [INFO ] Flow matrix only has 1391 transitions (discarded 9 similar events)
// Phase 1: matrix 1391 rows 653 cols
[2024-06-01 17:07:34] [INFO ] Computed 82 invariants in 35 ms
[2024-06-01 17:07:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2044 variables, and 71 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1389/1389 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:08:04] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 2 ms to minimize.
[2024-06-01 17:08:06] [INFO ] Deduced a trap composed of 83 places in 318 ms of which 3 ms to minimize.
[2024-06-01 17:08:07] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 2 ms to minimize.
[2024-06-01 17:08:07] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 1 ms to minimize.
[2024-06-01 17:08:07] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 2 ms to minimize.
[2024-06-01 17:08:08] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:08:08] [INFO ] Deduced a trap composed of 82 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:08:08] [INFO ] Deduced a trap composed of 82 places in 232 ms of which 7 ms to minimize.
[2024-06-01 17:08:09] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-06-01 17:08:10] [INFO ] Deduced a trap composed of 82 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:08:12] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-06-01 17:08:13] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 2 ms to minimize.
[2024-06-01 17:08:13] [INFO ] Deduced a trap composed of 83 places in 168 ms of which 2 ms to minimize.
[2024-06-01 17:08:13] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 2 ms to minimize.
[2024-06-01 17:08:13] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 3 ms to minimize.
[2024-06-01 17:08:13] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 3 ms to minimize.
[2024-06-01 17:08:14] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 2 ms to minimize.
[2024-06-01 17:08:14] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-06-01 17:08:15] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 2 ms to minimize.
[2024-06-01 17:08:16] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:08:17] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-06-01 17:08:17] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-06-01 17:08:20] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 1 ms to minimize.
[2024-06-01 17:08:20] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2044 variables, and 95 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1389 constraints, Known Traps: 24/24 constraints]
After SMT, in 46801ms problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 46813ms
Finished structural reductions in LTL mode , in 1 iterations and 46841 ms. Remains : 653/654 places, 1400/1401 transitions.
[2024-06-01 17:08:21] [INFO ] Flatten gal took : 51 ms
[2024-06-01 17:08:21] [INFO ] Flatten gal took : 55 ms
[2024-06-01 17:08:21] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1400
Applied a total of 2 rules in 34 ms. Remains 653 /654 variables (removed 1) and now considering 1400/1401 (removed 1) transitions.
Running 1389 sub problems to find dead transitions.
[2024-06-01 17:08:21] [INFO ] Flow matrix only has 1391 transitions (discarded 9 similar events)
[2024-06-01 17:08:21] [INFO ] Invariant cache hit.
[2024-06-01 17:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2044 variables, and 71 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1389/1389 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:08:49] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-06-01 17:08:49] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 1 ms to minimize.
[2024-06-01 17:08:51] [INFO ] Deduced a trap composed of 82 places in 218 ms of which 2 ms to minimize.
[2024-06-01 17:08:51] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-06-01 17:08:52] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:08:53] [INFO ] Deduced a trap composed of 82 places in 212 ms of which 2 ms to minimize.
[2024-06-01 17:08:53] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:08:53] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 3 ms to minimize.
[2024-06-01 17:08:54] [INFO ] Deduced a trap composed of 82 places in 196 ms of which 2 ms to minimize.
[2024-06-01 17:08:54] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:08:55] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 3 ms to minimize.
[2024-06-01 17:08:57] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 3 ms to minimize.
[2024-06-01 17:08:57] [INFO ] Deduced a trap composed of 90 places in 255 ms of which 2 ms to minimize.
[2024-06-01 17:08:58] [INFO ] Deduced a trap composed of 82 places in 238 ms of which 3 ms to minimize.
[2024-06-01 17:08:58] [INFO ] Deduced a trap composed of 90 places in 275 ms of which 2 ms to minimize.
[2024-06-01 17:08:58] [INFO ] Deduced a trap composed of 82 places in 250 ms of which 2 ms to minimize.
[2024-06-01 17:09:00] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 1 ms to minimize.
[2024-06-01 17:09:00] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-06-01 17:09:01] [INFO ] Deduced a trap composed of 83 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:09:01] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:09:02] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 2 ms to minimize.
[2024-06-01 17:09:02] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2024-06-01 17:09:06] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 2 ms to minimize.
[2024-06-01 17:09:06] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 9)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 3)
(s140 0)
(s141 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s174 1)
(s175 1)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 10)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2044 variables, and 95 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1389 constraints, Known Traps: 24/24 constraints]
After SMT, in 46524ms problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 46540ms
Finished structural reductions in LTL mode , in 1 iterations and 46579 ms. Remains : 653/654 places, 1400/1401 transitions.
[2024-06-01 17:09:07] [INFO ] Flatten gal took : 47 ms
[2024-06-01 17:09:08] [INFO ] Flatten gal took : 50 ms
[2024-06-01 17:09:08] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1401/1401 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1400
Applied a total of 2 rules in 49 ms. Remains 653 /654 variables (removed 1) and now considering 1400/1401 (removed 1) transitions.
Running 1389 sub problems to find dead transitions.
[2024-06-01 17:09:08] [INFO ] Flow matrix only has 1391 transitions (discarded 9 similar events)
[2024-06-01 17:09:08] [INFO ] Invariant cache hit.
[2024-06-01 17:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2044 variables, and 71 constraints, problems are : Problem set: 0 solved, 1389 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1389/1389 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:09:36] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-06-01 17:09:36] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 1 ms to minimize.
[2024-06-01 17:09:37] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 2 ms to minimize.
[2024-06-01 17:09:38] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 2 ms to minimize.
[2024-06-01 17:09:39] [INFO ] Deduced a trap composed of 83 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:09:39] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:09:39] [INFO ] Deduced a trap composed of 82 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:09:40] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 3 ms to minimize.
[2024-06-01 17:09:40] [INFO ] Deduced a trap composed of 82 places in 185 ms of which 2 ms to minimize.
[2024-06-01 17:09:41] [INFO ] Deduced a trap composed of 82 places in 245 ms of which 3 ms to minimize.
[2024-06-01 17:09:42] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-06-01 17:09:43] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 3 ms to minimize.
[2024-06-01 17:09:44] [INFO ] Deduced a trap composed of 90 places in 327 ms of which 3 ms to minimize.
[2024-06-01 17:09:44] [INFO ] Deduced a trap composed of 82 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:09:44] [INFO ] Deduced a trap composed of 90 places in 298 ms of which 3 ms to minimize.
[2024-06-01 17:09:45] [INFO ] Deduced a trap composed of 82 places in 273 ms of which 3 ms to minimize.
[2024-06-01 17:09:46] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2024-06-01 17:09:47] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 2 ms to minimize.
[2024-06-01 17:09:47] [INFO ] Deduced a trap composed of 83 places in 223 ms of which 2 ms to minimize.
[2024-06-01 17:09:47] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
[2024-06-01 17:09:48] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 17:09:49] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-06-01 17:09:51] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:09:52] [INFO ] Deduced a trap composed of 82 places in 250 ms of which 2 ms to minimize.
[2024-06-01 17:09:54] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 3 ms to minimize.
SMT process timed out in 46461ms, After SMT, problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 46481ms
Finished structural reductions in LTL mode , in 1 iterations and 46535 ms. Remains : 653/654 places, 1400/1401 transitions.
[2024-06-01 17:09:54] [INFO ] Flatten gal took : 63 ms
[2024-06-01 17:09:54] [INFO ] Flatten gal took : 67 ms
[2024-06-01 17:09:54] [INFO ] Input system was already deterministic with 1400 transitions.
[2024-06-01 17:09:55] [INFO ] Flatten gal took : 67 ms
[2024-06-01 17:09:55] [INFO ] Flatten gal took : 68 ms
[2024-06-01 17:09:55] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 17:09:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 654 places, 1401 transitions and 8728 arcs took 16 ms.
Total runtime 650626 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 : PolyORBNT-PT-S10J30-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-12
Could not compute solution for formula : PolyORBNT-PT-S10J30-CTLCardinality-2024-14

BK_STOP 1717261795512

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1534/ctl_0_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1534/ctl_1_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1534/ctl_2_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1534/ctl_3_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1534/ctl_4_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1534/ctl_5_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1534/ctl_6_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1534/ctl_7_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1534/ctl_8_
ctl formula name PolyORBNT-PT-S10J30-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1534/ctl_9_
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="PolyORBNT-PT-S10J30"
export BK_EXAMINATION="CTLCardinality"
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 PolyORBNT-PT-S10J30, examination is CTLCardinality"
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-171654447200489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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