MCC'2026- Execution of r354-tall-178024402900220

About the Execution of ITS-Tools for SupplyChain-PT-00500

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4266.348	826501.00	1024005.00	25778.80	FFFFFFFFTTFFFFFF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402900220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is SupplyChain-PT-00500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402900220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 7.0K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 07:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 27 07:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 07:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 27 07:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 2.1M May 26 18:17 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-00
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-01
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-02
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-03
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-04
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-05
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-06
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-07
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-08
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-09
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-10
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-11
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-12
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-13
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-14
FORMULA_NAME SupplyChain-PT-00500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780258357507

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 20:12:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 20:12:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:12:39] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2026-05-31 20:12:39] [INFO ] Transformed 6504 places.
[2026-05-31 20:12:39] [INFO ] Transformed 4003 transitions.
[2026-05-31 20:12:39] [INFO ] Parsed PT model containing 6504 places and 4003 transitions and 18006 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SupplyChain-PT-00500-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00500-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 6504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6504/6504 places, 4003/4003 transitions.
Ensure Unique test removed 1582 places
Iterating post reduction 0 with 1582 rules applied. Total rules applied 1582 place count 4922 transition count 4003
Applied a total of 1582 rules in 552 ms. Remains 4922 /6504 variables (removed 1582) and now considering 4003/4003 (removed 0) transitions.
Running 3503 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4011659658735534069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14653207958115851043.kers'
[2026-05-31 20:12:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4011659658735534069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14653207958115851043.kers]
Normalized transition count is 4002 out of 4003 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 7 ms.
// Phase 1: matrix 4002 rows 4914 cols 13004 entries
Finished phase 1 with 2912 SingleSign rule and 500 generalized
[2026-05-31 20:12:40] [INFO ] Computed 1510 invariants in 35 ms
Computed 1510 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-14653207958115851043.kers
Total runtime 40 ms.
[2026-05-31 20:12:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem TDEAD1024 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2243 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2258 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2270 is UNSAT
Problem TDEAD2274 is UNSAT
Problem TDEAD2278 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2292 is UNSAT
Problem TDEAD2296 is UNSAT
Problem TDEAD2300 is UNSAT
Problem TDEAD2306 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2322 is UNSAT
Problem TDEAD2327 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2355 is UNSAT
Problem TDEAD2361 is UNSAT
Problem TDEAD2367 is UNSAT
Problem TDEAD2372 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2692 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2707 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2771 is UNSAT
Problem TDEAD2775 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2820 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2838 is UNSAT
Problem TDEAD2842 is UNSAT
Problem TDEAD2848 is UNSAT
Problem TDEAD2853 is UNSAT
Problem TDEAD2860 is UNSAT
Problem TDEAD2864 is UNSAT
Problem TDEAD2869 is UNSAT
Problem TDEAD2873 is UNSAT
Problem TDEAD2877 is UNSAT
Problem TDEAD2882 is UNSAT
Problem TDEAD2886 is UNSAT
Problem TDEAD2892 is UNSAT
Problem TDEAD2897 is UNSAT
Problem TDEAD2903 is UNSAT
Problem TDEAD2909 is UNSAT
Problem TDEAD2914 is UNSAT
Problem TDEAD2918 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2927 is UNSAT
Problem TDEAD2931 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2946 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD3290 is UNSAT
Problem TDEAD3295 is UNSAT
Problem TDEAD3302 is UNSAT
Problem TDEAD3306 is UNSAT
Problem TDEAD3310 is UNSAT
Problem TDEAD3315 is UNSAT
Problem TDEAD3319 is UNSAT
Problem TDEAD3324 is UNSAT
Problem TDEAD3328 is UNSAT
Problem TDEAD3332 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/4419 variables, 2/2 constraints. Problems are: Problem set: 410 solved, 3093 unsolved
SMT process timed out in 23317ms, After SMT, problems are : Problem set: 410 solved, 3093 unsolved
Search for dead transitions found 410 dead transitions in 23360ms
Found 410 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 410 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 410 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8042292835005039119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15374275643330157920.kers'
[2026-05-31 20:13:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8042292835005039119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15374275643330157920.kers]
Normalized transition count is 3592 out of 3593 initially.
Culling trivial invariants: removing 320 columns.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 328 columns in 3 ms.
// Phase 1: matrix 3592 rows 4594 cols 11454 entries
Finished phase 1 with 2592 SingleSign rule and 500 generalized
[2026-05-31 20:13:03] [INFO ] Computed 1830 invariants in 26 ms
Computed 1830 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-15374275643330157920.kers
Total runtime 31 ms.
[2026-05-31 20:13:10] [INFO ] Implicit Places using invariants in 7326 ms returned [505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 608, 609, 610, 611, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 964, 965, 966, 967, 968, 969, 970, 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1002, 1003, 1004, 2510, 2511, 2512, 2513, 2514, 2515, 2516, 2517, 2518, 2519, 2520, 2521, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544, 2545, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2553, 2554, 2555, 2556, 2557, 2558, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579, 2580, 2581, 2582, 2584, 2585, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2604, 2605, 2606, 2607, 2608, 2609, 2610, 2611, 2612, 2613, 2614, 2615, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2624, 2625, 2626, 2627, 2629, 2630, 2631, 2632, 2633, 2634, 2635, 2636, 2637, 2638, 2639, 2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2669, 2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726, 2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755, 2756, 2757, 2758, 2759, 2760, 2762, 2763, 2764, 2765, 2766, 2767, 2768, 2769, 2770, 2771, 2772, 2773, 2774, 2775, 2776, 2777, 2778, 2779, 2780, 2781, 2782, 2783, 2784, 2785, 2786, 2787, 2788, 2789, 2790, 2791, 2792, 2793, 2794, 2795, 2796, 2797, 2798, 2799, 2800, 2801, 2802, 2803, 2804, 2805, 2806, 2807, 2809, 2810, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2819, 2820, 2821, 2822, 2823, 2824, 2825, 2826, 2827, 2828, 2829, 2830, 2831, 2832, 2833, 2834, 2835, 2836, 2837, 2838, 2839, 2840, 2841, 2842, 2843, 2844, 2845, 2846, 2847, 2848, 2849, 2850, 2851, 2852, 2853, 2854, 2855, 2856, 2857, 2858, 2859, 2860, 2861, 2862, 2863, 2864, 2865, 2866, 2867, 2868, 2869, 2870, 2871, 2872, 2873, 2874, 2875, 2876, 2877, 2878, 2879, 2880, 2881, 2882, 2883, 2884, 2885, 2886, 2888, 2889, 2890, 2891, 2892, 2893, 2894, 2895, 2896, 2897, 2898, 2899, 2900, 2901, 2902, 2903, 2904, 2905, 2906, 2907, 2908, 2909, 2910, 2911, 2912, 2913, 2914, 2915, 2916, 2917, 2918, 2919, 2920, 2921, 2922, 2923, 2924, 2925, 2926, 2927, 2928, 2929, 2930, 2931, 2932, 2933, 2934, 2935, 2936, 2937, 2938, 2939, 2940, 2941, 2942, 2943, 2944, 2945, 2946, 2947, 2948, 2949, 2950, 2951, 2952, 2953, 2954, 2955, 2956, 2957, 2958, 2959, 2960, 2961, 2962, 2963, 2964, 2965, 2966, 2967, 2968, 2969, 2970, 2971, 2972, 2973, 2974, 2975, 2976, 2977, 2978, 2979, 2980, 2981, 2982, 2983, 2984, 2985, 2986, 2987, 2988, 2989, 2990, 2991, 2992, 2993, 2994, 2995, 2996, 2997, 2998, 2999, 3000, 3001, 3002, 3003, 3004, 3005, 3006, 3007, 3008, 3009, 3471]
Discarding 981 places :
Implicit Place search using SMT only with invariants took 7371 ms to find 981 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3941/6504 places, 3593/4003 transitions.
Reduce places removed 814 places and 90 transitions.
Iterating post reduction 0 with 814 rules applied. Total rules applied 814 place count 3127 transition count 3503
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 903 place count 3038 transition count 3503
Deduced a syphon composed of 3 places in 2 ms
Applied a total of 903 rules in 337 ms. Remains 3038 /3941 variables (removed 903) and now considering 3503/3593 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12985880356649046224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2280820096122416704.kers'
[2026-05-31 20:13:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12985880356649046224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2280820096122416704.kers]
Normalized transition count is 3502 out of 3503 initially.
Culling trivial invariants: removing 3 columns.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 11 columns in 3 ms.
// Phase 1: matrix 3502 rows 3027 cols 7170 entries
Finished phase 1 with 2899 SingleSign rule and 103 generalized
[2026-05-31 20:13:11] [INFO ] Computed 36 invariants in 16 ms
Computed 36 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-2280820096122416704.kers
Total runtime 20 ms.
[2026-05-31 20:13:17] [INFO ] Implicit Places using invariants in 5750 ms returned []
[2026-05-31 20:13:17] [INFO ] Invariant cache hit.
[2026-05-31 20:13:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:13:24] [INFO ] Implicit Places using invariants and state equation in 7393 ms returned []
Implicit Place search using SMT with State Equation took 13152 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3038/6504 places, 3503/4003 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44872 ms. Remains : 3038/6504 places, 3503/4003 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3038/3038 places, 3503/3503 transitions.
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 0 rules in 139 ms. Remains 3038 /3038 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
[2026-05-31 20:13:24] [INFO ] Invariant cache hit.
[2026-05-31 20:13:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2523/6541 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/3038 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2523/6541 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/3038 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41352ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41358ms
[2026-05-31 20:14:06] [INFO ] Invariant cache hit.
[2026-05-31 20:14:09] [INFO ] Implicit Places using invariants in 3015 ms returned []
[2026-05-31 20:14:09] [INFO ] Invariant cache hit.
[2026-05-31 20:14:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:14:16] [INFO ] Implicit Places using invariants and state equation in 7239 ms returned []
Implicit Place search using SMT with State Equation took 10263 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 51771 ms. Remains : 3038/3038 places, 3503/3503 transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Support contains 59 out of 3035 places after structural reductions.
FORMULA SupplyChain-PT-00500-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 20:14:16] [INFO ] Flatten gal took : 235 ms
[2026-05-31 20:14:16] [INFO ] Flatten gal took : 132 ms
[2026-05-31 20:14:17] [INFO ] Input system was already deterministic with 3503 transitions.
Support contains 57 out of 3035 places (down from 59) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (16 resets) in 3892 ms. (10 steps per ms) remains 5/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 399 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5334076642735828644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-82721964986850744.kers'
[2026-05-31 20:14:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5334076642735828644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-82721964986850744.kers]
Normalized transition count is 3502 out of 3503 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 2 ms.
// Phase 1: matrix 3502 rows 3027 cols 7170 entries
Finished phase 1 with 2899 SingleSign rule and 103 generalized
[2026-05-31 20:14:18] [INFO ] Computed 33 invariants in 15 ms
Computed 33 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-82721964986850744.kers
Total runtime 19 ms.
[2026-05-31 20:14:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 8/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 21/41 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 534/575 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 7/582 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 10 (OVERLAPS) 663/1245 variables, 582/600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 820/2065 variables, 411/1011 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2065 variables, 0/1011 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1235/3300 variables, 413/1424 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3300 variables, 0/1424 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 6/3306 variables, 6/1430 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3306 variables, 6/1436 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3306 variables, 0/1436 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1222/4528 variables, 412/1848 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4528 variables, 1/1849 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4528 variables, 0/1849 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 1607/6135 variables, 809/2658 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/6135 variables, 5/2663 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/6135 variables, 0/2663 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 402/6537 variables, 402/3065 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/6537 variables, 3/3068 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/6537 variables, 0/3068 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/6538 variables, 1/3069 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/6538 variables, 0/3069 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/6538 variables, 0/3069 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6538/6538 variables, and 3069 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3163 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 3035/3035 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 534/543 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 27/570 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 12/582 variables, 9/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 663/1245 variables, 582/601 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1245 variables, 2/603 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1245 variables, 0/603 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 820/2065 variables, 411/1014 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2065 variables, 2/1016 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2065/6538 variables, and 1016 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 14/29 constraints, State Equation: 993/3035 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8224ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 3035 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Graph (complete) has 4070 edges and 3035 vertex of which 469 are kept as prefixes of interest. Removing 2566 places using SCC suffix rule.5 ms
Discarding 2566 places :
Also discarding 2451 output transitions
Drop transitions (Output transitions of discarded places.) removed 2451 transitions
Drop transitions (Empty/Sink Transition effects.) removed 408 transitions
Reduce isomorphic transitions removed 408 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 495 rules applied. Total rules applied 496 place count 469 transition count 557
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 1 with 345 rules applied. Total rules applied 841 place count 382 transition count 299
Reduce places removed 171 places and 0 transitions.
Iterating post reduction 2 with 171 rules applied. Total rules applied 1012 place count 211 transition count 299
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 1012 place count 211 transition count 207
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 1199 place count 116 transition count 207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1199 place count 116 transition count 204
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1205 place count 113 transition count 204
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 1291 place count 27 transition count 32
Iterating global reduction 3 with 86 rules applied. Total rules applied 1377 place count 27 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 1383 place count 27 transition count 26
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1383 place count 27 transition count 22
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1391 place count 23 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1392 place count 23 transition count 21
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1396 place count 21 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1397 place count 20 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1397 place count 20 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1399 place count 19 transition count 18
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1400 place count 18 transition count 16
Iterating global reduction 5 with 1 rules applied. Total rules applied 1401 place count 18 transition count 16
Applied a total of 1401 rules in 68 ms. Remains 18 /3035 variables (removed 3017) and now considering 16/3503 (removed 3487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 18/3035 places, 16/3503 transitions.
RANDOM walk for 692 steps (11 resets) in 5 ms. (115 steps per ms) remains 0/4 properties
FORMULA SupplyChain-PT-00500-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 3035 stabilizing places and 3502 stable transitions
Graph (complete) has 4585 edges and 3035 vertex of which 3026 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.20 ms
FORMULA SupplyChain-PT-00500-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(p1 U (p2||G(p1)))))))'
Support contains 7 out of 3035 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 3023 transition count 3503
Applied a total of 12 rules in 136 ms. Remains 3023 /3035 variables (removed 12) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6047544010349289316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4471188148711827883.kers'
[2026-05-31 20:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6047544010349289316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4471188148711827883.kers]
Normalized transition count is 3502 out of 3503 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 3502 rows 3023 cols 7166 entries
Finished phase 1 with 2898 SingleSign rule and 104 generalized
[2026-05-31 20:14:27] [INFO ] Computed 21 invariants in 16 ms
Computed 21 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-4471188148711827883.kers
Total runtime 18 ms.
[2026-05-31 20:14:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2523/6526 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20065 ms.
Refiners :[Generalized P Invariants (flows): 20/21 constraints, State Equation: 0/3023 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2523/6526 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20050 ms.
Refiners :[Generalized P Invariants (flows): 20/21 constraints, State Equation: 0/3023 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41345ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41353ms
[2026-05-31 20:15:09] [INFO ] Invariant cache hit.
[2026-05-31 20:15:12] [INFO ] Implicit Places using invariants in 3123 ms returned [502, 503, 504, 505, 506, 507, 509, 511, 512, 514, 2016, 2017, 2018, 2019, 2020, 2021, 2022]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 3129 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3006/3035 places, 3503/3503 transitions.
Applied a total of 0 rules in 129 ms. Remains 3006 /3006 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44759 ms. Remains : 3006/3035 places, 3503/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(p1 U (p2||G(p1)))))))'
Stuttering acceptance computed with spot in 384 ms :[true, (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-03 finished in 45255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U ((F(p2) U p3)&&p1)))'
Support contains 7 out of 3035 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Graph (complete) has 4585 edges and 3035 vertex of which 3026 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.15 ms
Discarding 9 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 498 places and 495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 491 place count 2528 transition count 2518
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 490 transitions
Reduce isomorphic transitions removed 490 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 1 with 1463 rules applied. Total rules applied 1954 place count 2038 transition count 1545
Reduce places removed 483 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 484 rules applied. Total rules applied 2438 place count 1555 transition count 1544
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 2441 place count 1554 transition count 1542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2442 place count 1553 transition count 1542
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 497 Pre rules applied. Total rules applied 2442 place count 1553 transition count 1045
Deduced a syphon composed of 497 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 5 with 1005 rules applied. Total rules applied 3447 place count 1045 transition count 1045
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 3447 place count 1045 transition count 1035
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 3467 place count 1035 transition count 1035
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3468 place count 1035 transition count 1034
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3468 place count 1035 transition count 1033
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3470 place count 1034 transition count 1033
Applied a total of 3470 rules in 397 ms. Remains 1034 /3035 variables (removed 2001) and now considering 1033/3503 (removed 2470) transitions.
Running 36 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15986544715547602850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9507087529247926835.kers'
[2026-05-31 20:15:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15986544715547602850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9507087529247926835.kers]
Normalized transition count is 1032 out of 1033 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1032 rows 1034 cols 2174 entries
Finished phase 1 with 927 SingleSign rule and 97 generalized
[2026-05-31 20:15:13] [INFO ] Computed 10 invariants in 6 ms
Computed 10 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9507087529247926835.kers
Total runtime 8 ms.
[2026-05-31 20:15:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 96/630 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/630 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 630/1260 variables, 630/640 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1260 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 806/2066 variables, 404/1044 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2066 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/2067 variables, 1/1045 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2067 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/2067 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2067/2067 variables, and 1045 constraints, problems are : Problem set: 0 solved, 36 unsolved in 12491 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 1034/1034 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 96/630 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/630 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 630/1260 variables, 630/640 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1260 variables, 35/675 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1260 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 806/2066 variables, 404/1079 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2066 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 1/2067 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2067 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/2067 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2067/2067 variables, and 1080 constraints, problems are : Problem set: 0 solved, 36 unsolved in 13650 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 1034/1034 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26170ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 26170ms
[2026-05-31 20:15:39] [INFO ] Invariant cache hit.
[2026-05-31 20:15:42] [INFO ] Implicit Places using invariants in 2752 ms returned [520, 521, 522, 523, 524, 525, 526]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2758 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1027/3035 places, 1033/3503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1027 transition count 1026
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 1020 transition count 1019
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 21 place count 1020 transition count 1012
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 1013 transition count 1012
Applied a total of 35 rules in 65 ms. Remains 1013 /1027 variables (removed 14) and now considering 1012/1033 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13289398622007622516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8287756993922000636.kers'
[2026-05-31 20:15:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13289398622007622516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8287756993922000636.kers]
Normalized transition count is 1011 out of 1012 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1011 rows 1013 cols 2118 entries
Finished phase 1 with 919 SingleSign rule and 91 generalized
[2026-05-31 20:15:42] [INFO ] Computed 3 invariants in 7 ms
Computed 3 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8287756993922000636.kers
Total runtime 10 ms.
[2026-05-31 20:15:44] [INFO ] Implicit Places using invariants in 2615 ms returned []
[2026-05-31 20:15:44] [INFO ] Invariant cache hit.
[2026-05-31 20:15:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:15:49] [INFO ] Implicit Places using invariants and state equation in 4244 ms returned []
Implicit Place search using SMT with State Equation took 6865 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1013/3035 places, 1012/3503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36258 ms. Remains : 1013/3035 places, 1012/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U ((F(p2) U p3)&&p1)))'
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-04
Product exploration explored 100000 steps with 31205 reset in 6185 ms.
Product exploration explored 100000 steps with 30690 reset in 6235 ms.
Computed a total of 1013 stabilizing places and 1011 stable transitions
Computed a total of 1013 stabilizing places and 1011 stable transitions
Detected a total of 1013/1013 stabilizing places and 1011/1012 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 12 factoid took 3227 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter insensitive) to 5 states, 12 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (92 resets) in 1239 ms. (32 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 3/3 properties
[2026-05-31 20:16:12] [INFO ] Invariant cache hit.
[2026-05-31 20:16:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 184/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 191/381 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 826/1207 variables, 414/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 817/2024 variables, 409/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2024 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/2025 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2025 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2025 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1017 constraints, problems are : Problem set: 0 solved, 3 unsolved in 634 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1013/1013 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 184/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 191/381 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 826/1207 variables, 414/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1207 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 817/2024 variables, 409/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2024 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/2025 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2025 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2025 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1020 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2480 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1013/1013 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3129ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 270 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=16 )
Parikh walk visited 3 properties in 21 ms.
Knowledge based reduction with 12 factoid took 5144 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter insensitive) to 5 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
[2026-05-31 20:16:20] [INFO ] Invariant cache hit.
[2026-05-31 20:16:21] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 68 ms returned sat
[2026-05-31 20:16:35] [INFO ] [Real]Absence check using state equation in 13485 ms returned sat
[2026-05-31 20:16:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 20:16:36] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 80 ms returned sat
[2026-05-31 20:16:47] [INFO ] [Nat]Absence check using state equation in 11137 ms returned sat
[2026-05-31 20:16:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:16:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2026-05-31 20:16:47] [INFO ] Computed and/alt/rep : 14/21/14 causal constraints (skipped 1 transitions) in 57 ms.
[2026-05-31 20:16:47] [INFO ] Added : 5 causal constraints over 1 iterations in 256 ms. Result :sat
Could not prove EG (NOT p1)
[2026-05-31 20:16:47] [INFO ] Invariant cache hit.
[2026-05-31 20:16:48] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 80 ms returned sat
[2026-05-31 20:17:02] [INFO ] [Real]Absence check using state equation in 14076 ms returned unknown
Could not prove EG (NOT p3)
Knowledge-based reduction took 61077 ms.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Support contains 7 out of 1013 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1013/1013 places, 1012/1012 transitions.
Applied a total of 0 rules in 70 ms. Remains 1013 /1013 variables (removed 0) and now considering 1012/1012 (removed 0) transitions.
Running 15 sub problems to find dead transitions.
[2026-05-31 20:17:03] [INFO ] Invariant cache hit.
[2026-05-31 20:17:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 90/603 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 603/1206 variables, 603/606 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 818/2024 variables, 410/1016 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2024 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/2025 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2025 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/2025 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1017 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5707 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1013/1013 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 90/603 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 603/1206 variables, 603/606 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 14/620 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 818/2024 variables, 410/1030 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2024 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1/2025 variables, 1/1031 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2025 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/2025 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1031 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5459 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1013/1013 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11189ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 11189ms
[2026-05-31 20:17:14] [INFO ] Invariant cache hit.
[2026-05-31 20:17:16] [INFO ] Implicit Places using invariants in 2527 ms returned []
[2026-05-31 20:17:16] [INFO ] Invariant cache hit.
[2026-05-31 20:17:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:17:20] [INFO ] Implicit Places using invariants and state equation in 4072 ms returned []
Implicit Place search using SMT with State Equation took 6606 ms to find 0 implicit places.
[2026-05-31 20:17:21] [INFO ] Redundant transitions in 57 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17932 ms. Remains : 1013/1013 places, 1012/1012 transitions.
Computed a total of 1013 stabilizing places and 1011 stable transitions
Computed a total of 1013 stabilizing places and 1011 stable transitions
Detected a total of 1013/1013 stabilizing places and 1011/1012 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 12 factoid took 3251 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter insensitive) to 5 states, 12 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (92 resets) in 1258 ms. (31 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 3/3 properties
[2026-05-31 20:17:31] [INFO ] Invariant cache hit.
[2026-05-31 20:17:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 184/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 191/381 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 826/1207 variables, 414/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 817/2024 variables, 409/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2024 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/2025 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2025 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2025 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2025/2025 variables, and 1017 constraints, problems are : Problem set: 0 solved, 3 unsolved in 717 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1013/1013 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 184/190 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 191/381 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 826/1207 variables, 414/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1207 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 817/2024 variables, 409/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2024 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/2025 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2025 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2025 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2025/2025 variables, and 1020 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2485 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1013/1013 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3228ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 277 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=19 )
Parikh walk visited 3 properties in 14 ms.
Knowledge based reduction with 12 factoid took 5130 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter insensitive) to 5 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
[2026-05-31 20:17:40] [INFO ] Invariant cache hit.
[2026-05-31 20:17:41] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 78 ms returned sat
[2026-05-31 20:17:54] [INFO ] [Real]Absence check using state equation in 13493 ms returned sat
[2026-05-31 20:17:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 20:17:55] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 81 ms returned sat
[2026-05-31 20:18:06] [INFO ] [Nat]Absence check using state equation in 11318 ms returned sat
[2026-05-31 20:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:18:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2026-05-31 20:18:07] [INFO ] Computed and/alt/rep : 14/21/14 causal constraints (skipped 1 transitions) in 56 ms.
[2026-05-31 20:18:07] [INFO ] Added : 5 causal constraints over 1 iterations in 233 ms. Result :sat
Could not prove EG (NOT p1)
[2026-05-31 20:18:07] [INFO ] Invariant cache hit.
[2026-05-31 20:18:08] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 81 ms returned sat
[2026-05-31 20:18:22] [INFO ] [Real]Absence check using state equation in 14091 ms returned unknown
Could not prove EG (NOT p3)
Knowledge-based reduction took 61253 ms.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Product exploration explored 100000 steps with 30250 reset in 5990 ms.
Product exploration explored 100000 steps with 29837 reset in 6146 ms.
Built C files in :
/tmp/ltsmin17142112980398787671
[2026-05-31 20:18:34] [INFO ] Computing symmetric may disable matrix : 1012 transitions.
[2026-05-31 20:18:34] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:18:34] [INFO ] Computing symmetric may enable matrix : 1012 transitions.
[2026-05-31 20:18:34] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:18:35] [INFO ] Computing Do-Not-Accords matrix : 1012 transitions.
[2026-05-31 20:18:35] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:18:35] [INFO ] Built C files in 315ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17142112980398787671
Running compilation step : cd /tmp/ltsmin17142112980398787671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17142112980398787671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17142112980398787671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 1013 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1013/1013 places, 1012/1012 transitions.
Applied a total of 0 rules in 52 ms. Remains 1013 /1013 variables (removed 0) and now considering 1012/1012 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:18:39] [INFO ] Invariant cache hit.
[2026-05-31 20:18:41] [INFO ] Implicit Places using invariants in 2674 ms returned []
[2026-05-31 20:18:41] [INFO ] Invariant cache hit.
[2026-05-31 20:18:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:18:45] [INFO ] Implicit Places using invariants and state equation in 4065 ms returned []
Implicit Place search using SMT with State Equation took 6742 ms to find 0 implicit places.
[2026-05-31 20:18:46] [INFO ] Redundant transitions in 172 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6977 ms. Remains : 1013/1013 places, 1012/1012 transitions.
Built C files in :
/tmp/ltsmin4491214574341368937
[2026-05-31 20:18:46] [INFO ] Computing symmetric may disable matrix : 1012 transitions.
[2026-05-31 20:18:46] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:18:46] [INFO ] Computing symmetric may enable matrix : 1012 transitions.
[2026-05-31 20:18:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:18:46] [INFO ] Computing Do-Not-Accords matrix : 1012 transitions.
[2026-05-31 20:18:46] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:18:46] [INFO ] Built C files in 243ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4491214574341368937
Running compilation step : cd /tmp/ltsmin4491214574341368937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4491214574341368937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4491214574341368937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-31 20:18:52] [INFO ] Flatten gal took : 84 ms
[2026-05-31 20:18:52] [INFO ] Flatten gal took : 48 ms
[2026-05-31 20:18:52] [INFO ] Time to serialize gal into /tmp/LTL4591174139126183258.gal : 11 ms
[2026-05-31 20:18:52] [INFO ] Time to serialize properties into /tmp/LTL17829829332761558113.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4591174139126183258.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3252302623116514914.hoa' '-atoms' '/tmp/LTL17829829332761558113.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17829829332761558113.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3252302623116514914.hoa
Detected timeout of ITS tools.
[2026-05-31 20:19:07] [INFO ] Flatten gal took : 37 ms
[2026-05-31 20:19:07] [INFO ] Flatten gal took : 38 ms
[2026-05-31 20:19:07] [INFO ] Time to serialize gal into /tmp/LTL2928767626326089398.gal : 7 ms
[2026-05-31 20:19:07] [INFO ] Time to serialize properties into /tmp/LTL18380994012991317719.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2928767626326089398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18380994012991317719.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("(p4108<1)")))U(("((p2104>=1)&&(p2607>=1))")&&(("(p501>=1)")&&((F("(p4048>=1)"))U("(((p2400>=1)&&(p2903>=1))&&(p501>=1))")))))...156
Formula 0 simplified : XG!"(p4108<1)" R (!"((p2104>=1)&&(p2607>=1))" | !"(p501>=1)" | (G!"(p4048>=1)" R !"(((p2400>=1)&&(p2903>=1))&&(p501>=1))"))
Detected timeout of ITS tools.
[2026-05-31 20:19:22] [INFO ] Flatten gal took : 35 ms
[2026-05-31 20:19:22] [INFO ] Applying decomposition
[2026-05-31 20:19:22] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15165214311452555617.txt' '-o' '/tmp/graph15165214311452555617.bin' '-w' '/tmp/graph15165214311452555617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15165214311452555617.bin' '-l' '-1' '-v' '-w' '/tmp/graph15165214311452555617.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:19:22] [INFO ] Decomposing Gal with order
[2026-05-31 20:19:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:19:22] [INFO ] Removed a total of 590 redundant transitions.
[2026-05-31 20:19:23] [INFO ] Flatten gal took : 105 ms
[2026-05-31 20:19:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 148 ms.
[2026-05-31 20:19:23] [INFO ] Time to serialize gal into /tmp/LTL13864175322502040902.gal : 18 ms
[2026-05-31 20:19:23] [INFO ] Time to serialize properties into /tmp/LTL16876290513228330831.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13864175322502040902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16876290513228330831.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i45.u53.p4108<1)")))U(("((i45.u53.p2104>=1)&&(i45.u2.p2607>=1))")&&(("(i225.u259.p501>=1)")&&((F("(u256.p4048>=1)"))U("(((i0...216
Formula 0 simplified : XG!"(i45.u53.p4108<1)" R (!"((i45.u53.p2104>=1)&&(i45.u2.p2607>=1))" | !"(i225.u259.p501>=1)" | (G!"(u256.p4048>=1)" R !"(((i0.u0.p2...206
Reverse transition relation is NOT exact ! Due to transitions t2623, t2839, t2363_t2212_t843_t2549, t2372_t2217_t844_t2551, t2382_t2221_t846_t2556, t2390_t...13014
Computing Next relation with stutter on 1.47303e+152 deadlock states
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00500-LTLFireability-04 finished in 265451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&F(p2)))&&p0)))'
Support contains 4 out of 3035 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 3023 transition count 3503
Applied a total of 12 rules in 141 ms. Remains 3023 /3035 variables (removed 12) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9686854163823928517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12043879101750712796.kers'
[2026-05-31 20:19:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9686854163823928517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12043879101750712796.kers]
Normalized transition count is 3502 out of 3503 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 3502 rows 3023 cols 7166 entries
Finished phase 1 with 2898 SingleSign rule and 104 generalized
[2026-05-31 20:19:38] [INFO ] Computed 21 invariants in 13 ms
Computed 21 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-12043879101750712796.kers
Total runtime 17 ms.
[2026-05-31 20:19:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2523/6526 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20060 ms.
Refiners :[Generalized P Invariants (flows): 20/21 constraints, State Equation: 0/3023 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2523/6526 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20048 ms.
Refiners :[Generalized P Invariants (flows): 20/21 constraints, State Equation: 0/3023 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41433ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41440ms
[2026-05-31 20:20:19] [INFO ] Invariant cache hit.
[2026-05-31 20:20:22] [INFO ] Implicit Places using invariants in 3006 ms returned [503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 2016, 2017, 2018, 2019, 2020, 2021, 2022]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 3016 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3004/3035 places, 3503/3503 transitions.
Applied a total of 0 rules in 127 ms. Remains 3004 /3004 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44732 ms. Remains : 3004/3035 places, 3503/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&F(p2)))&&p0)))'
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-05 finished in 45003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))||G(p1)) U G(p2)))'
Support contains 5 out of 3035 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Graph (complete) has 4585 edges and 3035 vertex of which 3026 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Discarding 9 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 497 places and 494 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 493 place count 2529 transition count 2517
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 1 with 1467 rules applied. Total rules applied 1960 place count 2037 transition count 1542
Reduce places removed 483 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 484 rules applied. Total rules applied 2444 place count 1554 transition count 1541
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 2447 place count 1553 transition count 1539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2448 place count 1552 transition count 1539
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 499 Pre rules applied. Total rules applied 2448 place count 1552 transition count 1040
Deduced a syphon composed of 499 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 512 places and 0 transitions.
Iterating global reduction 5 with 1011 rules applied. Total rules applied 3459 place count 1040 transition count 1040
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 3459 place count 1040 transition count 1028
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 3483 place count 1028 transition count 1028
Applied a total of 3483 rules in 177 ms. Remains 1028 /3035 variables (removed 2007) and now considering 1028/3503 (removed 2475) transitions.
Running 31 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17087133480430120305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2241015266807477937.kers'
[2026-05-31 20:20:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17087133480430120305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2241015266807477937.kers]
Normalized transition count is 1027 out of 1028 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1027 rows 1028 cols 2159 entries
Finished phase 1 with 924 SingleSign rule and 96 generalized
[2026-05-31 20:20:23] [INFO ] Computed 8 invariants in 7 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2241015266807477937.kers
Total runtime 9 ms.
[2026-05-31 20:20:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 94/622 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 624/1246 variables, 622/630 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1246 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 809/2055 variables, 406/1036 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/2056 variables, 1/1037 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2056 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/2056 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2056/2056 variables, and 1037 constraints, problems are : Problem set: 0 solved, 31 unsolved in 16661 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 1028/1028 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 94/622 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 624/1246 variables, 622/630 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1246 variables, 30/660 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1246 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 809/2055 variables, 406/1066 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 1/2056 variables, 1/1067 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2056 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 0/2056 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2056/2056 variables, and 1067 constraints, problems are : Problem set: 0 solved, 31 unsolved in 13291 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 1028/1028 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29981ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 29981ms
[2026-05-31 20:20:53] [INFO ] Invariant cache hit.
[2026-05-31 20:20:56] [INFO ] Implicit Places using invariants in 2794 ms returned [513, 514, 517, 518, 519]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2799 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1023/3035 places, 1028/3503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1023 transition count 1023
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 1018 transition count 1018
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 1018 transition count 1013
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 1013 transition count 1013
Applied a total of 25 rules in 52 ms. Remains 1013 /1023 variables (removed 10) and now considering 1013/1028 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-653423773672575621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17206760065334327251.kers'
[2026-05-31 20:20:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-653423773672575621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17206760065334327251.kers]
Normalized transition count is 1012 out of 1013 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1012 rows 1013 cols 2119 entries
Finished phase 1 with 918 SingleSign rule and 92 generalized
[2026-05-31 20:20:56] [INFO ] Computed 3 invariants in 4 ms
Computed 3 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17206760065334327251.kers
Total runtime 6 ms.
[2026-05-31 20:20:59] [INFO ] Implicit Places using invariants in 2765 ms returned []
[2026-05-31 20:20:59] [INFO ] Invariant cache hit.
[2026-05-31 20:20:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:21:03] [INFO ] Implicit Places using invariants and state equation in 4521 ms returned []
Implicit Place search using SMT with State Equation took 7288 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1013/3035 places, 1013/3503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40298 ms. Remains : 1013/3035 places, 1013/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))||G(p1)) U G(p2)))'
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-06
Stuttering criterion allowed to conclude after 418 steps with 0 reset in 9 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-06 finished in 40513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&G(p1))))'
Support contains 3 out of 3035 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Graph (complete) has 4585 edges and 3035 vertex of which 3026 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 498 places and 495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 493 place count 2528 transition count 2516
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 1 with 1467 rules applied. Total rules applied 1960 place count 2036 transition count 1541
Reduce places removed 483 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 484 rules applied. Total rules applied 2444 place count 1553 transition count 1540
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 2447 place count 1552 transition count 1538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2448 place count 1551 transition count 1538
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 499 Pre rules applied. Total rules applied 2448 place count 1551 transition count 1039
Deduced a syphon composed of 499 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 512 places and 0 transitions.
Iterating global reduction 5 with 1011 rules applied. Total rules applied 3459 place count 1039 transition count 1039
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 3459 place count 1039 transition count 1027
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 3483 place count 1027 transition count 1027
Applied a total of 3483 rules in 163 ms. Remains 1027 /3035 variables (removed 2008) and now considering 1027/3503 (removed 2476) transitions.
Running 29 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11154236058464638806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16190439871643771093.kers'
[2026-05-31 20:21:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11154236058464638806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16190439871643771093.kers]
Normalized transition count is 1026 out of 1027 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1026 rows 1027 cols 2156 entries
Finished phase 1 with 923 SingleSign rule and 96 generalized
[2026-05-31 20:21:03] [INFO ] Computed 8 invariants in 4 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16190439871643771093.kers
Total runtime 5 ms.
[2026-05-31 20:21:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 95/622 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 623/1245 variables, 622/630 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 808/2053 variables, 405/1035 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2053 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/2054 variables, 1/1036 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2054 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/2054 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 1036 constraints, problems are : Problem set: 0 solved, 29 unsolved in 15818 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 1027/1027 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 95/622 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 623/1245 variables, 622/630 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 28/658 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1245 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 808/2053 variables, 405/1063 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2053 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/2054 variables, 1/1064 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2054 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/2054 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2054/2054 variables, and 1064 constraints, problems are : Problem set: 0 solved, 29 unsolved in 13276 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 1027/1027 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29121ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 29121ms
[2026-05-31 20:21:33] [INFO ] Invariant cache hit.
[2026-05-31 20:21:35] [INFO ] Implicit Places using invariants in 2807 ms returned [513, 514, 515, 516, 518, 519]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 2817 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1021/3035 places, 1027/3503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1021 transition count 1021
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 1015 transition count 1015
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 18 place count 1015 transition count 1009
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 1009 transition count 1009
Applied a total of 30 rules in 61 ms. Remains 1009 /1021 variables (removed 12) and now considering 1009/1027 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1363937889145244434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6943652060598890102.kers'
[2026-05-31 20:21:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1363937889145244434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6943652060598890102.kers]
Normalized transition count is 1008 out of 1009 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1008 rows 1009 cols 2108 entries
Finished phase 1 with 916 SingleSign rule and 91 generalized
[2026-05-31 20:21:35] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6943652060598890102.kers
Total runtime 11 ms.
[2026-05-31 20:21:38] [INFO ] Implicit Places using invariants in 2786 ms returned []
[2026-05-31 20:21:38] [INFO ] Invariant cache hit.
[2026-05-31 20:21:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:21:43] [INFO ] Implicit Places using invariants and state equation in 4294 ms returned []
Implicit Place search using SMT with State Equation took 7084 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1009/3035 places, 1009/3503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39248 ms. Remains : 1009/3035 places, 1009/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&G(p1))))'
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-07
Stuttering criterion allowed to conclude after 416 steps with 0 reset in 15 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-07 finished in 39412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||X(X(F(p2))))))'
Support contains 6 out of 3035 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 3024 transition count 3503
Applied a total of 11 rules in 133 ms. Remains 3024 /3035 variables (removed 11) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3358604632078699747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6965414896458173360.kers'
[2026-05-31 20:21:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3358604632078699747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6965414896458173360.kers]
Normalized transition count is 3502 out of 3503 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 3502 rows 3023 cols 7166 entries
Finished phase 1 with 2898 SingleSign rule and 104 generalized
[2026-05-31 20:21:43] [INFO ] Computed 22 invariants in 18 ms
Computed 22 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-6965414896458173360.kers
Total runtime 26 ms.
[2026-05-31 20:21:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2523/6527 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20049 ms.
Refiners :[Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/3024 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2523/6527 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20051 ms.
Refiners :[Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/3024 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41260ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41265ms
[2026-05-31 20:22:24] [INFO ] Invariant cache hit.
[2026-05-31 20:22:27] [INFO ] Implicit Places using invariants in 3142 ms returned [503, 504, 505, 506, 507, 509, 510, 511, 512, 513, 514, 2017, 2018, 2019, 2020, 2021, 2022, 2023]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 3147 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3006/3035 places, 3503/3503 transitions.
Applied a total of 0 rules in 142 ms. Remains 3006 /3006 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44695 ms. Remains : 3006/3035 places, 3503/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(F(p1)))||p2)))'
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 3113 ms.
Product exploration explored 100000 steps with 33333 reset in 3345 ms.
Computed a total of 3006 stabilizing places and 3502 stable transitions
Computed a total of 3006 stabilizing places and 3502 stable transitions
Detected a total of 3006/3006 stabilizing places and 3502/3503 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 11 ms. Proved property starting from automaton with 3 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 1890 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SupplyChain-PT-00500-LTLFireability-08 finished in 53220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 3035 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Graph (complete) has 4585 edges and 3035 vertex of which 3026 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 499 places and 497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 493 place count 2527 transition count 2514
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 1 with 1467 rules applied. Total rules applied 1960 place count 2035 transition count 1539
Reduce places removed 483 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 484 rules applied. Total rules applied 2444 place count 1552 transition count 1538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2445 place count 1551 transition count 1538
Performed 498 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 498 Pre rules applied. Total rules applied 2445 place count 1551 transition count 1040
Deduced a syphon composed of 498 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 4 with 1008 rules applied. Total rules applied 3453 place count 1041 transition count 1040
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 3453 place count 1041 transition count 1029
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 3475 place count 1030 transition count 1029
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3476 place count 1030 transition count 1028
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3476 place count 1030 transition count 1027
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3478 place count 1029 transition count 1027
Applied a total of 3478 rules in 172 ms. Remains 1029 /3035 variables (removed 2006) and now considering 1027/3503 (removed 2476) transitions.
Running 29 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5517418711525280394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11297922774705399338.kers'
[2026-05-31 20:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5517418711525280394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11297922774705399338.kers]
Normalized transition count is 1026 out of 1027 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1026 rows 1028 cols 2158 entries
Finished phase 1 with 922 SingleSign rule and 97 generalized
[2026-05-31 20:22:36] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11297922774705399338.kers
Total runtime 5 ms.
[2026-05-31 20:22:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 96/624 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 624/1248 variables, 624/633 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1248 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 807/2055 variables, 405/1038 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2055 variables, 1/1039 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/2056 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2056 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/2056 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2056/2056 variables, and 1040 constraints, problems are : Problem set: 0 solved, 29 unsolved in 16605 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 1029/1029 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 96/624 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 624/1248 variables, 624/633 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1248 variables, 28/661 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1248 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 807/2055 variables, 405/1066 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 1/1067 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/2056 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2056 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/2056 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2056/2056 variables, and 1068 constraints, problems are : Problem set: 0 solved, 29 unsolved in 11904 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 1029/1029 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28534ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 28534ms
[2026-05-31 20:23:05] [INFO ] Invariant cache hit.
[2026-05-31 20:23:08] [INFO ] Implicit Places using invariants in 2877 ms returned [517, 518, 519, 520, 521, 522, 523]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2880 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1022/3035 places, 1027/3503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1022 transition count 1020
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 1015 transition count 1013
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 21 place count 1015 transition count 1006
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 1008 transition count 1006
Applied a total of 35 rules in 53 ms. Remains 1008 /1022 variables (removed 14) and now considering 1006/1027 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15540108477714443878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5034933090348677086.kers'
[2026-05-31 20:23:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15540108477714443878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5034933090348677086.kers]
Normalized transition count is 1005 out of 1006 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1005 rows 1007 cols 2102 entries
Finished phase 1 with 914 SingleSign rule and 91 generalized
[2026-05-31 20:23:08] [INFO ] Computed 3 invariants in 6 ms
Computed 3 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5034933090348677086.kers
Total runtime 9 ms.
[2026-05-31 20:23:10] [INFO ] Implicit Places using invariants in 2788 ms returned []
[2026-05-31 20:23:10] [INFO ] Invariant cache hit.
[2026-05-31 20:23:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:23:15] [INFO ] Implicit Places using invariants and state equation in 4293 ms returned []
Implicit Place search using SMT with State Equation took 7087 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1008/3035 places, 1006/3503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38727 ms. Remains : 1008/3035 places, 1006/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-10
Stuttering criterion allowed to conclude after 415 steps with 0 reset in 13 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-10 finished in 38907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3035 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Graph (complete) has 4585 edges and 3035 vertex of which 3026 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Discarding 9 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 500 places and 497 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 493 place count 2526 transition count 2514
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 1 with 1468 rules applied. Total rules applied 1961 place count 2034 transition count 1538
Reduce places removed 484 places and 0 transitions.
Iterating post reduction 2 with 484 rules applied. Total rules applied 2445 place count 1550 transition count 1538
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 2445 place count 1550 transition count 1039
Deduced a syphon composed of 499 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 3 with 1010 rules applied. Total rules applied 3455 place count 1039 transition count 1039
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 3455 place count 1039 transition count 1028
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 3477 place count 1028 transition count 1028
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3478 place count 1028 transition count 1027
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3478 place count 1028 transition count 1026
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3480 place count 1027 transition count 1026
Applied a total of 3480 rules in 171 ms. Remains 1027 /3035 variables (removed 2008) and now considering 1026/3503 (removed 2477) transitions.
Running 27 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7800721846098570747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14634069076235737757.kers'
[2026-05-31 20:23:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7800721846098570747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14634069076235737757.kers]
Normalized transition count is 1025 out of 1026 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1025 rows 1027 cols 2156 entries
Finished phase 1 with 922 SingleSign rule and 96 generalized
[2026-05-31 20:23:15] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14634069076235737757.kers
Total runtime 6 ms.
[2026-05-31 20:23:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 96/623 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/623 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 621/1244 variables, 623/632 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1244 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 808/2052 variables, 404/1036 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2052 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/2053 variables, 1/1037 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2053 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/2053 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2053/2053 variables, and 1037 constraints, problems are : Problem set: 0 solved, 27 unsolved in 9989 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 1027/1027 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 96/623 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/623 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 621/1244 variables, 623/632 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1244 variables, 26/658 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 808/2052 variables, 404/1062 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2052 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/2053 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2053 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/2053 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2053/2053 variables, and 1063 constraints, problems are : Problem set: 0 solved, 27 unsolved in 11092 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 1027/1027 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21104ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 21104ms
[2026-05-31 20:23:36] [INFO ] Invariant cache hit.
[2026-05-31 20:23:39] [INFO ] Implicit Places using invariants in 2780 ms returned [515, 516, 517, 518, 519, 520, 521]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 2785 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1020/3035 places, 1026/3503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1020 transition count 1019
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 1013 transition count 1012
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 21 place count 1013 transition count 1005
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 1006 transition count 1005
Applied a total of 35 rules in 52 ms. Remains 1006 /1020 variables (removed 14) and now considering 1005/1026 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8097817003109518254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11846725994126122496.kers'
[2026-05-31 20:23:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8097817003109518254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11846725994126122496.kers]
Normalized transition count is 1004 out of 1005 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1004 rows 1006 cols 2100 entries
Finished phase 1 with 914 SingleSign rule and 90 generalized
[2026-05-31 20:23:39] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11846725994126122496.kers
Total runtime 6 ms.
[2026-05-31 20:23:42] [INFO ] Implicit Places using invariants in 2748 ms returned []
[2026-05-31 20:23:42] [INFO ] Invariant cache hit.
[2026-05-31 20:23:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:23:46] [INFO ] Implicit Places using invariants and state equation in 4215 ms returned []
Implicit Place search using SMT with State Equation took 6970 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1006/3035 places, 1005/3503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31084 ms. Remains : 1006/3035 places, 1005/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-11
Stuttering criterion allowed to conclude after 413 steps with 0 reset in 15 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-11 finished in 31228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 3035 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 3023 transition count 3503
Applied a total of 12 rules in 130 ms. Remains 3023 /3035 variables (removed 12) and now considering 3503/3503 (removed 0) transitions.
Running 3003 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4267034453932051207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16982283952990733514.kers'
[2026-05-31 20:23:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4267034453932051207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16982283952990733514.kers]
Normalized transition count is 3502 out of 3503 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 3502 rows 3023 cols 7166 entries
Finished phase 1 with 2898 SingleSign rule and 104 generalized
[2026-05-31 20:23:46] [INFO ] Computed 21 invariants in 17 ms
Computed 21 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-16982283952990733514.kers
Total runtime 24 ms.
[2026-05-31 20:23:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2523/6526 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20047 ms.
Refiners :[Generalized P Invariants (flows): 20/21 constraints, State Equation: 0/3023 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 3003/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3003 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3003 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2523/6526 variables, and 20 constraints, problems are : Problem set: 0 solved, 3003 unsolved in 20051 ms.
Refiners :[Generalized P Invariants (flows): 20/21 constraints, State Equation: 0/3023 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/3002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41272ms problems are : Problem set: 0 solved, 3003 unsolved
Search for dead transitions found 0 dead transitions in 41277ms
[2026-05-31 20:24:27] [INFO ] Invariant cache hit.
[2026-05-31 20:24:31] [INFO ] Implicit Places using invariants in 3066 ms returned [502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 2016, 2017, 2018, 2019, 2020, 2021, 2022]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 3071 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3003/3035 places, 3503/3503 transitions.
Applied a total of 0 rules in 122 ms. Remains 3003 /3003 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44606 ms. Remains : 3003/3035 places, 3503/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-12 finished in 44733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(p1))||G(p2)) U X(X(p0))))'
Support contains 5 out of 3035 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 3023 transition count 3503
Applied a total of 12 rules in 159 ms. Remains 3023 /3035 variables (removed 12) and now considering 3503/3503 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:24:31] [INFO ] Invariant cache hit.
[2026-05-31 20:24:34] [INFO ] Implicit Places using invariants in 3137 ms returned [502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 2016, 2018, 2019, 2020, 2021]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 3141 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3005/3035 places, 3503/3503 transitions.
Applied a total of 0 rules in 124 ms. Remains 3005 /3005 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3424 ms. Remains : 3005/3035 places, 3503/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(p1))||G(p2)) U X(X(p0))))'
Stuttering acceptance computed with spot in 835 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-14 finished in 4309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((G(((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))) U (G(p0)||(!p3&&(p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1))))))))))||(F(!p1)&&((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))) U (G(p0)||(!p3&&(p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))))))))))))'
Support contains 7 out of 3035 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3035/3035 places, 3503/3503 transitions.
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 3023 transition count 3503
Applied a total of 12 rules in 146 ms. Remains 3023 /3035 variables (removed 12) and now considering 3503/3503 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:24:35] [INFO ] Invariant cache hit.
[2026-05-31 20:24:38] [INFO ] Implicit Places using invariants in 3057 ms returned [502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 513, 514, 2017, 2018, 2019, 2020, 2021, 2022]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 3061 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3005/3035 places, 3503/3503 transitions.
Applied a total of 0 rules in 125 ms. Remains 3005 /3005 variables (removed 0) and now considering 3503/3503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3333 ms. Remains : 3005/3035 places, 3503/3503 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((G(((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))) U (G(p0)||(!p3&&(p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1))))))))))||(F(!p1)&&((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))) U (G(p0)||(!p3&&(p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))))))))))))'
Stuttering acceptance computed with spot in 720 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND (NOT p2) p1), p1, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : SupplyChain-PT-00500-LTLFireability-15
Entered a terminal (fully accepting) state of product in 485 steps with 161 reset in 17 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00500-LTLFireability-15 finished in 4179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U ((F(p2) U p3)&&p1)))'
Spot run failed in 87 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-31 20:24:39] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12955576108043503390
[2026-05-31 20:24:40] [INFO ] Too many transitions (3503) to apply POR reductions. Disabling POR matrices.
[2026-05-31 20:24:40] [INFO ] Applying decomposition
[2026-05-31 20:24:40] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12955576108043503390
Running compilation step : cd /tmp/ltsmin12955576108043503390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-31 20:24:40] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16039536352848818292.txt' '-o' '/tmp/graph16039536352848818292.bin' '-w' '/tmp/graph16039536352848818292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16039536352848818292.bin' '-l' '-1' '-v' '-w' '/tmp/graph16039536352848818292.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:24:40] [INFO ] Decomposing Gal with order
[2026-05-31 20:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:24:40] [INFO ] Removed a total of 619 redundant transitions.
[2026-05-31 20:24:40] [INFO ] Flatten gal took : 100 ms
[2026-05-31 20:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 107 ms.
[2026-05-31 20:24:40] [INFO ] Time to serialize gal into /tmp/LTLFireability7791170029162022681.gal : 19 ms
[2026-05-31 20:24:41] [INFO ] Time to serialize properties into /tmp/LTLFireability16157487510527549026.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7791170029162022681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16157487510527549026.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(F("(i50.u236.p4108<1)")))U(("((i50.u236.p2104>=1)&&(i50.u55.p2607>=1))")&&(("(u47.p501>=1)")&&((F("(u401.p4048>=1)"))U("(((i163....215
Formula 0 simplified : XG!"(i50.u236.p4108<1)" R (!"((i50.u236.p2104>=1)&&(i50.u55.p2607>=1))" | !"(u47.p501>=1)" | (G!"(u401.p4048>=1)" R !"(((i163.u498.p...205
Compilation finished in 9377 ms.
Running link step : cd /tmp/ltsmin12955576108043503390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin12955576108043503390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(X(<>((LTLAPp0==true))) U ((<>((LTLAPp2==true)) U (LTLAPp3==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t2549, t2551, t2556, t2557, t2558, t2559, t2560, t2561, t2562, t2563, t2567, t2569, t2572, t2...5609
Computing Next relation with stutter on 1.47303e+152 deadlock states
LTSmin run took 94301 ms.
FORMULA SupplyChain-PT-00500-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 825050 ms.

BK_STOP 1780259184008

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is SupplyChain-PT-00500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402900220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SupplyChain-PT-00500.tgz
mv SupplyChain-PT-00500 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;