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-178024402800212.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-00200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.3K May 27 10:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 27 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 27 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:59 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 820K 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-00200-LTLFireability-00
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-01
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-02
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-03
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-04
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-05
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-06
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-07
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-08
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-09
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-10
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-11
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-12
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-13
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-14
FORMULA_NAME SupplyChain-PT-00200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780257433478

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-00200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 19:57:14] [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 19:57:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 19:57:15] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2026-05-31 19:57:15] [INFO ] Transformed 2604 places.
[2026-05-31 19:57:15] [INFO ] Transformed 1603 transitions.
[2026-05-31 19:57:15] [INFO ] Parsed PT model containing 2604 places and 1603 transitions and 7206 arcs in 279 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 4 formulas.
FORMULA SupplyChain-PT-00200-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00200-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00200-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00200-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 2604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2604/2604 places, 1603/1603 transitions.
Ensure Unique test removed 686 places
Iterating post reduction 0 with 686 rules applied. Total rules applied 686 place count 1918 transition count 1603
Applied a total of 686 rules in 250 ms. Remains 1918 /2604 variables (removed 686) and now considering 1603/1603 (removed 0) transitions.
Running 1403 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-337563468453872554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7230601233359945052.kers'
[2026-05-31 19:57:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-337563468453872554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7230601233359945052.kers]
Normalized transition count is 1602 out of 1603 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 2 ms.
// Phase 1: matrix 1602 rows 1914 cols 5204 entries
Finished phase 1 with 1112 SingleSign rule and 200 generalized
[2026-05-31 19:57:15] [INFO ] Computed 606 invariants in 15 ms
Computed 606 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-7230601233359945052.kers
Total runtime 17 ms.
[2026-05-31 19:57:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1600 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1715 variables, 2/2 constraints. Problems are: Problem set: 110 solved, 1293 unsolved
SMT process timed out in 20975ms, After SMT, problems are : Problem set: 110 solved, 1293 unsolved
Search for dead transitions found 110 dead transitions in 21005ms
Found 110 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9584726762480303290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4854965903255526838.kers'
[2026-05-31 19:57:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9584726762480303290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4854965903255526838.kers]
Normalized transition count is 1492 out of 1493 initially.
Culling trivial invariants: removing 20 columns.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 24 columns in 1 ms.
// Phase 1: matrix 1492 rows 1894 cols 4854 entries
Finished phase 1 with 1092 SingleSign rule and 200 generalized
[2026-05-31 19:57:36] [INFO ] Computed 626 invariants in 9 ms
Computed 626 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-4854965903255526838.kers
Total runtime 13 ms.
[2026-05-31 19:57:38] [INFO ] Implicit Places using invariants in 2011 ms returned [0, 1, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 660, 661, 662, 663, 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, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 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, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 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, 915, 1701, 1702, 1703, 1705, 1706, 1707, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750, 1751, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772, 1773, 1775, 1776, 1777, 1778, 1779, 1780, 1781, 1782, 1783, 1784, 1786, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1795, 1797, 1798, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1806, 1809, 1810, 1811, 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1820, 1821, 1822, 1823, 1824, 1825, 1826, 1827, 1828, 1829, 1831, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1842, 1843, 1844, 1845, 1846, 1847, 1849, 1850, 1851, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1883, 1884, 1886, 1887, 1888, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1897, 1898, 1899, 1901, 1902, 1903, 1904, 1905, 1906, 1908, 1909, 1910, 1911, 1912, 1914, 1915, 1916, 1917]
Discarding 386 places :
Implicit Place search using SMT only with invariants took 2028 ms to find 386 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1532/2604 places, 1493/1603 transitions.
Reduce places removed 219 places and 90 transitions.
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 1313 transition count 1403
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 308 place count 1224 transition count 1403
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 308 rules in 52 ms. Remains 1224 /1532 variables (removed 308) and now considering 1403/1493 (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-10379004297037633000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13782041071887101204.kers'
[2026-05-31 19:57:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10379004297037633000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13782041071887101204.kers]
Normalized transition count is 1402 out of 1403 initially.
Culling trivial invariants: removing 1 columns.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 1402 rows 1219 cols 2947 entries
Finished phase 1 with 1106 SingleSign rule and 96 generalized
[2026-05-31 19:57:38] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13782041071887101204.kers
Total runtime 6 ms.
[2026-05-31 19:57:39] [INFO ] Implicit Places using invariants in 761 ms returned []
[2026-05-31 19:57:39] [INFO ] Invariant cache hit.
[2026-05-31 19:57:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:57:41] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1224/2604 places, 1403/1603 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25778 ms. Remains : 1224/2604 places, 1403/1603 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 1403/1403 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 29 ms. Remains 1224 /1224 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Running 1203 sub problems to find dead transitions.
[2026-05-31 19:57:41] [INFO ] Invariant cache hit.
[2026-05-31 19:57:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/2627 variables, and 14 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/1224 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2627 variables, and 14 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/1224 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40468ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40473ms
[2026-05-31 19:58:21] [INFO ] Invariant cache hit.
[2026-05-31 19:58:22] [INFO ] Implicit Places using invariants in 746 ms returned []
[2026-05-31 19:58:22] [INFO ] Invariant cache hit.
[2026-05-31 19:58:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:58:23] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 42781 ms. Remains : 1224/1224 places, 1403/1403 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 42 out of 1223 places after structural reductions.
[2026-05-31 19:58:24] [INFO ] Flatten gal took : 134 ms
[2026-05-31 19:58:24] [INFO ] Flatten gal took : 66 ms
[2026-05-31 19:58:24] [INFO ] Input system was already deterministic with 1403 transitions.
RANDOM walk for 35066 steps (42 resets) in 2836 ms. (12 steps per ms) remains 0/25 properties
Computed a total of 1223 stabilizing places and 1402 stable transitions
Graph (complete) has 1856 edges and 1223 vertex of which 1221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 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(G(p0))))'
Support contains 3 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1218 transition count 1403
Applied a total of 5 rules in 26 ms. Remains 1218 /1223 variables (removed 5) and now considering 1403/1403 (removed 0) transitions.
Running 1203 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-13923050815737556765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5394282070802234746.kers'
[2026-05-31 19:58:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13923050815737556765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5394282070802234746.kers]
Normalized transition count is 1402 out of 1403 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1402 rows 1218 cols 2946 entries
Finished phase 1 with 1105 SingleSign rule and 97 generalized
[2026-05-31 19:58:25] [INFO ] Computed 16 invariants in 4 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5394282070802234746.kers
Total runtime 6 ms.
[2026-05-31 19:58:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20028 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20022 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40314ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40317ms
[2026-05-31 19:59:06] [INFO ] Invariant cache hit.
[2026-05-31 19:59:06] [INFO ] Implicit Places using invariants in 723 ms returned [601, 602, 603, 604, 605, 606, 607, 1190, 1191, 1197, 1198, 1208, 1212, 1215]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 732 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1204/1223 places, 1403/1403 transitions.
Applied a total of 0 rules in 26 ms. Remains 1204 /1204 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41104 ms. Remains : 1204/1223 places, 1403/1403 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(G(p0))))'
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-00
Entered a terminal (fully accepting) state of product in 197 steps with 0 reset in 14 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00200-LTLFireability-00 finished in 41455 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)))'
Support contains 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Graph (complete) has 1856 edges and 1223 vertex of which 1221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 200 places and 197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 193 place count 1021 transition count 1014
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 1 with 571 rules applied. Total rules applied 764 place count 829 transition count 635
Reduce places removed 187 places and 0 transitions.
Iterating post reduction 2 with 187 rules applied. Total rules applied 951 place count 642 transition count 635
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 951 place count 642 transition count 436
Deduced a syphon composed of 199 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 1357 place count 435 transition count 436
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1357 place count 435 transition count 428
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1373 place count 427 transition count 428
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 1374 place count 427 transition count 427
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1374 place count 427 transition count 426
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1376 place count 426 transition count 426
Applied a total of 1376 rules in 232 ms. Remains 426 /1223 variables (removed 797) and now considering 426/1403 (removed 977) 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-8380950685819699404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13655158691670267328.kers'
[2026-05-31 19:59:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8380950685819699404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13655158691670267328.kers]
Normalized transition count is 425 out of 426 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 426 cols 953 entries
Finished phase 1 with 327 SingleSign rule and 91 generalized
[2026-05-31 19:59:07] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13655158691670267328.kers
Total runtime 2 ms.
[2026-05-31 19:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 91/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 317/634 variables, 317/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 217/851 variables, 109/434 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/852 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/852 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 435 constraints, problems are : Problem set: 0 solved, 27 unsolved in 7043 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 426/426 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/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 91/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 317/634 variables, 317/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 26/351 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 217/851 variables, 109/460 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/852 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/852 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/852 variables, and 461 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5111 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 426/426 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12170ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 12170ms
[2026-05-31 19:59:19] [INFO ] Invariant cache hit.
[2026-05-31 19:59:20] [INFO ] Implicit Places using invariants in 710 ms returned [207, 208, 209, 210, 211, 212, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 712 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/1223 places, 426/1403 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 419 transition count 419
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 412 transition count 412
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 412 transition count 405
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 405 transition count 405
Applied a total of 35 rules in 32 ms. Remains 405 /419 variables (removed 14) and now considering 405/426 (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-7970646955409818187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4622855947646671952.kers'
[2026-05-31 19:59:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7970646955409818187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4622855947646671952.kers]
Normalized transition count is 404 out of 405 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 405 cols 897 entries
Finished phase 1 with 314 SingleSign rule and 90 generalized
[2026-05-31 19:59:20] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4622855947646671952.kers
Total runtime 2 ms.
[2026-05-31 19:59:20] [INFO ] Implicit Places using invariants in 658 ms returned []
[2026-05-31 19:59:20] [INFO ] Invariant cache hit.
[2026-05-31 19:59:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 19:59:21] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/1223 places, 405/1403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14860 ms. Remains : 405/1223 places, 405/1403 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)))'
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-01
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 1 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00200-LTLFireability-01 finished in 14935 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 p1)||(X(!p2) U (X(!p1)&&p3))))'
Support contains 6 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1218 transition count 1403
Applied a total of 5 rules in 24 ms. Remains 1218 /1223 variables (removed 5) and now considering 1403/1403 (removed 0) transitions.
Running 1203 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-7665102830804467255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3601517950377254929.kers'
[2026-05-31 19:59:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7665102830804467255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3601517950377254929.kers]
Normalized transition count is 1402 out of 1403 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1402 rows 1218 cols 2946 entries
Finished phase 1 with 1105 SingleSign rule and 97 generalized
[2026-05-31 19:59:22] [INFO ] Computed 16 invariants in 4 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3601517950377254929.kers
Total runtime 5 ms.
[2026-05-31 19:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20026 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20028 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40304ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40307ms
[2026-05-31 20:00:02] [INFO ] Invariant cache hit.
[2026-05-31 20:00:03] [INFO ] Implicit Places using invariants in 743 ms returned [602, 604, 605, 606, 1190, 1191, 1197, 1198, 1208, 1212, 1215, 1217]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 745 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1206/1223 places, 1403/1403 transitions.
Applied a total of 0 rules in 23 ms. Remains 1206 /1206 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41104 ms. Remains : 1206/1223 places, 1403/1403 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 p1)||(X(!p2) U (X(!p1)&&p3))))'
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p3)), p1, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), true, (OR (NOT p3) p2 p1), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-02
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 2 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00200-LTLFireability-02 finished in 41371 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))'
Support contains 2 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Graph (complete) has 1856 edges and 1223 vertex of which 1221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 199 places and 196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 1022 transition count 1014
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 1 with 574 rules applied. Total rules applied 768 place count 829 transition count 633
Reduce places removed 188 places and 0 transitions.
Iterating post reduction 2 with 188 rules applied. Total rules applied 956 place count 641 transition count 633
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 956 place count 641 transition count 433
Deduced a syphon composed of 200 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 1364 place count 433 transition count 433
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1364 place count 433 transition count 425
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1380 place count 425 transition count 425
Applied a total of 1380 rules in 81 ms. Remains 425 /1223 variables (removed 798) and now considering 425/1403 (removed 978) transitions.
Running 26 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-10411910373742666863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5302237086079985804.kers'
[2026-05-31 20:00:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10411910373742666863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5302237086079985804.kers]
Normalized transition count is 424 out of 425 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 424 rows 425 cols 952 entries
Finished phase 1 with 326 SingleSign rule and 91 generalized
[2026-05-31 20:00:03] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5302237086079985804.kers
Total runtime 7 ms.
[2026-05-31 20:00:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 91/316 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 315/631 variables, 316/324 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/631 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 218/849 variables, 109/433 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/849 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/850 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/850 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/850 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 850/850 variables, and 434 constraints, problems are : Problem set: 0 solved, 26 unsolved in 6620 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 425/425 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 91/316 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 315/631 variables, 316/324 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/631 variables, 25/349 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 218/849 variables, 109/458 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1/850 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/850 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/850 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 850/850 variables, and 459 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5683 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 425/425 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12335ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 12336ms
[2026-05-31 20:00:15] [INFO ] Invariant cache hit.
[2026-05-31 20:00:16] [INFO ] Implicit Places using invariants in 631 ms returned [205, 206, 207, 208, 209, 211]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 633 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/1223 places, 425/1403 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 419 transition count 419
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 413 transition count 413
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 413 transition count 407
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 407 transition count 407
Applied a total of 30 rules in 26 ms. Remains 407 /419 variables (removed 12) and now considering 407/425 (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-16051526841275721687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4689283977549907510.kers'
[2026-05-31 20:00:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16051526841275721687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4689283977549907510.kers]
Normalized transition count is 406 out of 407 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 407 cols 904 entries
Finished phase 1 with 315 SingleSign rule and 90 generalized
[2026-05-31 20:00:16] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4689283977549907510.kers
Total runtime 3 ms.
[2026-05-31 20:00:17] [INFO ] Implicit Places using invariants in 667 ms returned []
[2026-05-31 20:00:17] [INFO ] Invariant cache hit.
[2026-05-31 20:00:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:00:18] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 407/1223 places, 407/1403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14821 ms. Remains : 407/1223 places, 407/1403 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(p0))'
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-03
Product exploration explored 100000 steps with 1695 reset in 1198 ms.
Product exploration explored 100000 steps with 1671 reset in 1195 ms.
Computed a total of 407 stabilizing places and 406 stable transitions
Computed a total of 407 stabilizing places and 406 stable transitions
Detected a total of 407/407 stabilizing places and 406/407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 220 steps (0 resets) in 9 ms. (22 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2026-05-31 20:00:21] [INFO ] Invariant cache hit.
[2026-05-31 20:00:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 218 ms returned sat
[2026-05-31 20:00:24] [INFO ] [Real]Absence check using state equation in 2869 ms returned sat
[2026-05-31 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 20:00:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 112 ms returned sat
[2026-05-31 20:00:27] [INFO ] [Nat]Absence check using state equation in 2445 ms returned sat
[2026-05-31 20:00:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:00:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-31 20:00:27] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 1 transitions) in 23 ms.
[2026-05-31 20:00:27] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 6973 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 407/407 transitions.
Applied a total of 0 rules in 18 ms. Remains 407 /407 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Running 8 sub problems to find dead transitions.
[2026-05-31 20:00:27] [INFO ] Invariant cache hit.
[2026-05-31 20:00:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 90/297 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 296/593 variables, 297/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 220/813 variables, 110/409 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/814 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/814 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/814 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 410 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3806 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 407/407 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 90/297 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 296/593 variables, 297/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 220/813 variables, 110/416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/813 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/814 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/814 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/814 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 417 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2903 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 407/407 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6735ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 6736ms
[2026-05-31 20:00:34] [INFO ] Invariant cache hit.
[2026-05-31 20:00:35] [INFO ] Implicit Places using invariants in 648 ms returned []
[2026-05-31 20:00:35] [INFO ] Invariant cache hit.
[2026-05-31 20:00:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:00:36] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
[2026-05-31 20:00:36] [INFO ] Redundant transitions in 30 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8497 ms. Remains : 407/407 places, 407/407 transitions.
Computed a total of 407 stabilizing places and 406 stable transitions
Computed a total of 407 stabilizing places and 406 stable transitions
Detected a total of 407/407 stabilizing places and 406/407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 317 steps (0 resets) in 10 ms. (28 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2026-05-31 20:00:36] [INFO ] Invariant cache hit.
[2026-05-31 20:00:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 222 ms returned sat
[2026-05-31 20:00:40] [INFO ] [Real]Absence check using state equation in 2931 ms returned sat
[2026-05-31 20:00:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 20:00:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 112 ms returned sat
[2026-05-31 20:00:43] [INFO ] [Nat]Absence check using state equation in 2448 ms returned sat
[2026-05-31 20:00:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:00:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-31 20:00:43] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 1 transitions) in 24 ms.
[2026-05-31 20:00:43] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 6946 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1693 reset in 1116 ms.
Product exploration explored 100000 steps with 1701 reset in 1194 ms.
Built C files in :
/tmp/ltsmin12747242502412926943
[2026-05-31 20:00:45] [INFO ] Computing symmetric may disable matrix : 407 transitions.
[2026-05-31 20:00:45] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:00:45] [INFO ] Computing symmetric may enable matrix : 407 transitions.
[2026-05-31 20:00:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:00:45] [INFO ] Computing Do-Not-Accords matrix : 407 transitions.
[2026-05-31 20:00:45] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:00:45] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12747242502412926943
Running compilation step : cd /tmp/ltsmin12747242502412926943;'/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'
Compilation finished in 1146 ms.
Running link step : cd /tmp/ltsmin12747242502412926943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 939 ms.
Running LTSmin : cd /tmp/ltsmin12747242502412926943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9267581711707888303.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 407/407 transitions.
Applied a total of 0 rules in 11 ms. Remains 407 /407 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:01:00] [INFO ] Invariant cache hit.
[2026-05-31 20:01:01] [INFO ] Implicit Places using invariants in 696 ms returned []
[2026-05-31 20:01:01] [INFO ] Invariant cache hit.
[2026-05-31 20:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:01:02] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2026-05-31 20:01:02] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1705 ms. Remains : 407/407 places, 407/407 transitions.
Built C files in :
/tmp/ltsmin991061418903395395
[2026-05-31 20:01:02] [INFO ] Computing symmetric may disable matrix : 407 transitions.
[2026-05-31 20:01:02] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:01:02] [INFO ] Computing symmetric may enable matrix : 407 transitions.
[2026-05-31 20:01:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:01:02] [INFO ] Computing Do-Not-Accords matrix : 407 transitions.
[2026-05-31 20:01:02] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:01:02] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin991061418903395395
Running compilation step : cd /tmp/ltsmin991061418903395395;'/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'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin991061418903395395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin991061418903395395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5942537921792328891.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 20:01:17] [INFO ] Flatten gal took : 23 ms
[2026-05-31 20:01:17] [INFO ] Flatten gal took : 18 ms
[2026-05-31 20:01:17] [INFO ] Time to serialize gal into /tmp/LTL5822540017027140488.gal : 5 ms
[2026-05-31 20:01:17] [INFO ] Time to serialize properties into /tmp/LTL12032502235890269239.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/LTL5822540017027140488.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12252712469347322445.hoa' '-atoms' '/tmp/LTL12032502235890269239.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...319
Loading property file /tmp/LTL12032502235890269239.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12252712469347322445.hoa
Detected timeout of ITS tools.
[2026-05-31 20:01:32] [INFO ] Flatten gal took : 17 ms
[2026-05-31 20:01:32] [INFO ] Flatten gal took : 16 ms
[2026-05-31 20:01:32] [INFO ] Time to serialize gal into /tmp/LTL4520702313331402398.gal : 3 ms
[2026-05-31 20:01:32] [INFO ] Time to serialize properties into /tmp/LTL15206631369453733048.ltl : 2 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/LTL4520702313331402398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15206631369453733048.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 : !((F("((p1715>=1)&&(p1913>=1))")))
Formula 0 simplified : G!"((p1715>=1)&&(p1913>=1))"
Detected timeout of ITS tools.
[2026-05-31 20:01:47] [INFO ] Flatten gal took : 40 ms
[2026-05-31 20:01:47] [INFO ] Applying decomposition
[2026-05-31 20:01:47] [INFO ] Flatten gal took : 31 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/graph9514156539465731021.txt' '-o' '/tmp/graph9514156539465731021.bin' '-w' '/tmp/graph9514156539465731021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9514156539465731021.bin' '-l' '-1' '-v' '-w' '/tmp/graph9514156539465731021.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:01:47] [INFO ] Decomposing Gal with order
[2026-05-31 20:01:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:01:48] [INFO ] Removed a total of 288 redundant transitions.
[2026-05-31 20:01:48] [INFO ] Flatten gal took : 102 ms
[2026-05-31 20:01:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 28 ms.
[2026-05-31 20:01:48] [INFO ] Time to serialize gal into /tmp/LTL15581612244573540847.gal : 8 ms
[2026-05-31 20:01:48] [INFO ] Time to serialize properties into /tmp/LTL5712609774374130530.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/LTL15581612244573540847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5712609774374130530.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...255
Read 1 LTL properties
Checking formula 0 : !((F("((i1.u58.p1715>=1)&&(i1.u1.p1913>=1))")))
Formula 0 simplified : G!"((i1.u58.p1715>=1)&&(i1.u1.p1913>=1))"
Reverse transition relation is NOT exact ! Due to transitions t544, t1204_t950_t142, t1213_t952_t147, t1217_t953_t149, t1220_t955_t150, t1224_t956_t151, t1...4670
Computing Next relation with stutter on 7.23122e+61 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
335 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.40861,153764,1,0,410563,582,6007,309019,102,437,764101
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SupplyChain-PT-00200-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SupplyChain-PT-00200-LTLFireability-03 finished in 109050 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||X(p1)) U (G((p0||X(p1)))||(p2&&(p0||X(p1))))) U G(!p0)) U X(p3)))'
Support contains 8 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1219 transition count 1403
Applied a total of 4 rules in 28 ms. Remains 1219 /1223 variables (removed 4) and now considering 1403/1403 (removed 0) transitions.
Running 1203 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-441316789251277918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8744364908058228476.kers'
[2026-05-31 20:01:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-441316789251277918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8744364908058228476.kers]
Normalized transition count is 1402 out of 1403 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1402 rows 1218 cols 2946 entries
Finished phase 1 with 1105 SingleSign rule and 97 generalized
[2026-05-31 20:01:52] [INFO ] Computed 17 invariants in 5 ms
Computed 17 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8744364908058228476.kers
Total runtime 6 ms.
[2026-05-31 20:01:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/2622 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20030 ms.
Refiners :[Generalized P Invariants (flows): 15/17 constraints, State Equation: 0/1219 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2622 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20032 ms.
Refiners :[Generalized P Invariants (flows): 15/17 constraints, State Equation: 0/1219 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40323ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40327ms
[2026-05-31 20:02:32] [INFO ] Invariant cache hit.
[2026-05-31 20:02:33] [INFO ] Implicit Places using invariants in 715 ms returned [601, 602, 603, 605, 606, 607, 1191, 1192, 1199, 1209, 1213, 1216, 1218]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 717 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1206/1223 places, 1403/1403 transitions.
Applied a total of 0 rules in 21 ms. Remains 1206 /1206 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41097 ms. Remains : 1206/1223 places, 1403/1403 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)||p1) U (G((p1||X(p0)))||(p2&&(X(p0)||p1)))) U G(!p1)) U X(p3)))'
Stuttering acceptance computed with spot in 407 ms :[(NOT p3), (AND p1 (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), true, (AND p1 p0), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0)), (AND (NOT p1) (NOT p0)), p1]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-04
Entered a terminal (fully accepting) state of product in 47938 steps with 277 reset in 1006 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00200-LTLFireability-04 finished in 42585 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(p0)||G(p1)) U X(!p2)))'
Support contains 5 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1218 transition count 1403
Applied a total of 5 rules in 26 ms. Remains 1218 /1223 variables (removed 5) and now considering 1403/1403 (removed 0) transitions.
Running 1203 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-13353880449561749415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13445401966358390925.kers'
[2026-05-31 20:02:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13353880449561749415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13445401966358390925.kers]
Normalized transition count is 1402 out of 1403 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1402 rows 1218 cols 2946 entries
Finished phase 1 with 1105 SingleSign rule and 97 generalized
[2026-05-31 20:02:35] [INFO ] Computed 16 invariants in 9 ms
Computed 16 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13445401966358390925.kers
Total runtime 11 ms.
[2026-05-31 20:02:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20030 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20034 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40311ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40314ms
[2026-05-31 20:03:15] [INFO ] Invariant cache hit.
[2026-05-31 20:03:16] [INFO ] Implicit Places using invariants in 788 ms returned [601, 602, 603, 604, 605, 606, 607, 1191, 1197, 1198, 1212, 1215, 1217]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 793 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1205/1223 places, 1403/1403 transitions.
Applied a total of 0 rules in 22 ms. Remains 1205 /1205 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41159 ms. Remains : 1205/1223 places, 1403/1403 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(p0)||G(p1)) U X(!p2)))'
Stuttering acceptance computed with spot in 388 ms :[p2, p2, (AND (NOT p1) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 949 ms.
Product exploration explored 100000 steps with 50000 reset in 1071 ms.
Computed a total of 1205 stabilizing places and 1402 stable transitions
Computed a total of 1205 stabilizing places and 1402 stable transitions
Detected a total of 1205/1205 stabilizing places and 1402/1403 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 29 factoid took 13 ms. Proved property starting from automaton with 10 states, 28 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 197 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SupplyChain-PT-00200-LTLFireability-05 finished in 43820 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((p0 U X(p1)))||X(F(p2))))'
Support contains 6 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1218 transition count 1403
Applied a total of 5 rules in 26 ms. Remains 1218 /1223 variables (removed 5) and now considering 1403/1403 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:03:18] [INFO ] Invariant cache hit.
[2026-05-31 20:03:19] [INFO ] Implicit Places using invariants in 715 ms returned [601, 603, 604, 605, 606, 607, 1190, 1197, 1198, 1208, 1212, 1215, 1217]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 717 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1205/1223 places, 1403/1403 transitions.
Applied a total of 0 rules in 21 ms. Remains 1205 /1205 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 765 ms. Remains : 1205/1223 places, 1403/1403 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((p0 U X(p1)))||X(F(p2))))'
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-06
Product exploration explored 100000 steps with 38551 reset in 1244 ms.
Product exploration explored 100000 steps with 38351 reset in 1377 ms.
Computed a total of 1205 stabilizing places and 1402 stable transitions
Computed a total of 1205 stabilizing places and 1402 stable transitions
Detected a total of 1205/1205 stabilizing places and 1402/1403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 8 factoid took 701 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (48 resets) in 877 ms. (45 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12378106375562695160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13150138793229432491.kers'
[2026-05-31 20:03:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12378106375562695160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13150138793229432491.kers]
Normalized transition count is 1402 out of 1403 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1402 rows 1205 cols 2900 entries
Finished phase 1 with 1111 SingleSign rule and 91 generalized
[2026-05-31 20:03:23] [INFO ] Computed 3 invariants in 9 ms
Computed 3 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13150138793229432491.kers
Total runtime 10 ms.
[2026-05-31 20:03:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 6/2608 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 17 ms.
Refiners :[Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/1205 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 10 factoid took 790 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Knowledge-based reduction took 2270 ms.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 1403/1403 transitions.
Applied a total of 0 rules in 24 ms. Remains 1205 /1205 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Running 1203 sub problems to find dead transitions.
[2026-05-31 20:03:24] [INFO ] Invariant cache hit.
[2026-05-31 20:03:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1005 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1005/2608 variables, and 2 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20028 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1205 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1005 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/2608 variables, and 2 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20036 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/1205 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40312ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40316ms
[2026-05-31 20:04:05] [INFO ] Invariant cache hit.
[2026-05-31 20:04:05] [INFO ] Implicit Places using invariants in 713 ms returned []
[2026-05-31 20:04:05] [INFO ] Invariant cache hit.
[2026-05-31 20:04:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:04:07] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 42598 ms. Remains : 1205/1205 places, 1403/1403 transitions.
Computed a total of 1205 stabilizing places and 1402 stable transitions
Computed a total of 1205 stabilizing places and 1402 stable transitions
Detected a total of 1205/1205 stabilizing places and 1402/1403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 2469 steps (2 resets) in 70 ms. (34 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 307 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Knowledge-based reduction took 864 ms.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 39084 reset in 1184 ms.
Product exploration explored 100000 steps with 39907 reset in 1255 ms.
Spot run failed in 89 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/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10291868142856409549
[2026-05-31 20:04:11] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10291868142856409549
Running compilation step : cd /tmp/ltsmin10291868142856409549;'/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'
Compilation finished in 2477 ms.
Running link step : cd /tmp/ltsmin10291868142856409549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10291868142856409549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4038359718274391077.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1205/1205 places, 1403/1403 transitions.
Applied a total of 0 rules in 23 ms. Remains 1205 /1205 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:04:26] [INFO ] Invariant cache hit.
[2026-05-31 20:04:27] [INFO ] Implicit Places using invariants in 727 ms returned []
[2026-05-31 20:04:27] [INFO ] Invariant cache hit.
[2026-05-31 20:04:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:04:28] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2337 ms. Remains : 1205/1205 places, 1403/1403 transitions.
Built C files in :
/tmp/ltsmin11451053422180420127
[2026-05-31 20:04:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11451053422180420127
Running compilation step : cd /tmp/ltsmin11451053422180420127;'/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'
Compilation finished in 2397 ms.
Running link step : cd /tmp/ltsmin11451053422180420127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11451053422180420127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2050150522072222853.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 20:04:43] [INFO ] Flatten gal took : 33 ms
[2026-05-31 20:04:43] [INFO ] Flatten gal took : 41 ms
[2026-05-31 20:04:43] [INFO ] Time to serialize gal into /tmp/LTL5371939361548183589.gal : 6 ms
[2026-05-31 20:04:43] [INFO ] Time to serialize properties into /tmp/LTL16477363348787023119.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/LTL5371939361548183589.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4244783906170634398.hoa' '-atoms' '/tmp/LTL16477363348787023119.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/LTL16477363348787023119.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4244783906170634398.hoa
Detected timeout of ITS tools.
[2026-05-31 20:04:58] [INFO ] Flatten gal took : 21 ms
[2026-05-31 20:04:58] [INFO ] Flatten gal took : 21 ms
[2026-05-31 20:04:58] [INFO ] Time to serialize gal into /tmp/LTL8728772972838392482.gal : 6 ms
[2026-05-31 20:04:58] [INFO ] Time to serialize properties into /tmp/LTL3722923755188163558.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/LTL8728772972838392482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3722923755188163558.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...275
Read 1 LTL properties
Checking formula 0 : !(((G(("(p1725<1)")U(X("((p1659>=1)&&(p1857>=1))"))))||(X(F("((p1725<1)||(((p1009>=1)&&(p201>=1))&&(p806>=1)))")))))
Formula 0 simplified : F(!"(p1725<1)" R X!"((p1659>=1)&&(p1857>=1))") & XG!"((p1725<1)||(((p1009>=1)&&(p201>=1))&&(p806>=1)))"
Detected timeout of ITS tools.
[2026-05-31 20:05:13] [INFO ] Flatten gal took : 20 ms
[2026-05-31 20:05:13] [INFO ] Applying decomposition
[2026-05-31 20:05:13] [INFO ] Flatten gal took : 20 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/graph13292523122667510710.txt' '-o' '/tmp/graph13292523122667510710.bin' '-w' '/tmp/graph13292523122667510710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13292523122667510710.bin' '-l' '-1' '-v' '-w' '/tmp/graph13292523122667510710.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:05:14] [INFO ] Decomposing Gal with order
[2026-05-31 20:05:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:05:14] [INFO ] Removed a total of 289 redundant transitions.
[2026-05-31 20:05:14] [INFO ] Flatten gal took : 40 ms
[2026-05-31 20:05:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 18 ms.
[2026-05-31 20:05:14] [INFO ] Time to serialize gal into /tmp/LTL15451173850234967068.gal : 10 ms
[2026-05-31 20:05:14] [INFO ] Time to serialize properties into /tmp/LTL5946116633608901360.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/LTL15451173850234967068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5946116633608901360.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...255
Read 1 LTL properties
Checking formula 0 : !(((G(("(u195.p1725<1)")U(X("((i72.u74.p1659>=1)&&(i72.u13.p1857>=1))"))))||(X(F("((u195.p1725<1)||(((i120.u0.p1009>=1)&&(i72.u13.p201...189
Formula 0 simplified : F(!"(u195.p1725<1)" R X!"((i72.u74.p1659>=1)&&(i72.u13.p1857>=1))") & XG!"((u195.p1725<1)||(((i120.u0.p1009>=1)&&(i72.u13.p201>=1))&...178
Reverse transition relation is NOT exact ! Due to transitions t142, t144, t147, t149, t150, t151, t152, t153, t154, t155, t159, t161, t164, t165, t166, t16...1878
Computing Next relation with stutter on 7.23122e+61 deadlock states
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00200-LTLFireability-06 finished in 130405 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(G(p0))&&F(p1))))'
Support contains 3 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Graph (complete) has 1856 edges and 1223 vertex of which 1221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 199 places and 196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 193 place count 1022 transition count 1015
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 1 with 571 rules applied. Total rules applied 764 place count 830 transition count 636
Reduce places removed 187 places and 0 transitions.
Iterating post reduction 2 with 187 rules applied. Total rules applied 951 place count 643 transition count 636
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 951 place count 643 transition count 437
Deduced a syphon composed of 199 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 1357 place count 436 transition count 437
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1357 place count 436 transition count 429
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1373 place count 428 transition count 429
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 1374 place count 428 transition count 428
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1374 place count 428 transition count 427
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 1376 place count 427 transition count 427
Applied a total of 1376 rules in 66 ms. Remains 427 /1223 variables (removed 796) and now considering 427/1403 (removed 976) 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-13829722505982514431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9749618737904697971.kers'
[2026-05-31 20:05:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13829722505982514431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9749618737904697971.kers]
Normalized transition count is 426 out of 427 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 426 rows 427 cols 956 entries
Finished phase 1 with 328 SingleSign rule and 91 generalized
[2026-05-31 20:05:29] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9749618737904697971.kers
Total runtime 3 ms.
[2026-05-31 20:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 91/318 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 317/635 variables, 318/326 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 218/853 variables, 109/435 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/854 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/854 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/854 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 854/854 variables, and 436 constraints, problems are : Problem set: 0 solved, 29 unsolved in 4166 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 427/427 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/227 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 91/318 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 317/635 variables, 318/326 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 28/354 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 218/853 variables, 109/463 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/854 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/854 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/854 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 854/854 variables, and 464 constraints, problems are : Problem set: 0 solved, 29 unsolved in 4240 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 427/427 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8425ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 8425ms
[2026-05-31 20:05:37] [INFO ] Invariant cache hit.
[2026-05-31 20:05:38] [INFO ] Implicit Places using invariants in 699 ms returned [207, 208, 209, 210, 212, 213]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 702 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 421/1223 places, 427/1403 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 421 transition count 421
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 415 transition count 415
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 415 transition count 409
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 409 transition count 409
Applied a total of 30 rules in 23 ms. Remains 409 /421 variables (removed 12) and now considering 409/427 (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-15105032680533361226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17705980531334766653.kers'
[2026-05-31 20:05:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15105032680533361226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17705980531334766653.kers]
Normalized transition count is 408 out of 409 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 408 rows 409 cols 908 entries
Finished phase 1 with 317 SingleSign rule and 90 generalized
[2026-05-31 20:05:38] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17705980531334766653.kers
Total runtime 6 ms.
[2026-05-31 20:05:39] [INFO ] Implicit Places using invariants in 632 ms returned []
[2026-05-31 20:05:39] [INFO ] Invariant cache hit.
[2026-05-31 20:05:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:05:40] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 409/1223 places, 409/1403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10924 ms. Remains : 409/1223 places, 409/1403 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-08
Stuttering criterion allowed to conclude after 6074 steps with 91 reset in 68 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00200-LTLFireability-08 finished in 11165 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||X(X(X(X((p1 U p2)))))))))'
Support contains 6 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1220 transition count 1403
Applied a total of 3 rules in 27 ms. Remains 1220 /1223 variables (removed 3) and now considering 1403/1403 (removed 0) transitions.
Running 1203 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-5052154868188574778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10858186427306668686.kers'
[2026-05-31 20:05:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5052154868188574778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10858186427306668686.kers]
Normalized transition count is 1402 out of 1403 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 3 ms.
// Phase 1: matrix 1402 rows 1218 cols 2946 entries
Finished phase 1 with 1105 SingleSign rule and 97 generalized
[2026-05-31 20:05:40] [INFO ] Computed 18 invariants in 14 ms
Computed 18 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10858186427306668686.kers
Total runtime 18 ms.
[2026-05-31 20:05:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/2623 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20028 ms.
Refiners :[Generalized P Invariants (flows): 15/18 constraints, State Equation: 0/1220 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2623 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20033 ms.
Refiners :[Generalized P Invariants (flows): 15/18 constraints, State Equation: 0/1220 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40310ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40312ms
[2026-05-31 20:06:20] [INFO ] Invariant cache hit.
[2026-05-31 20:06:21] [INFO ] Implicit Places using invariants in 736 ms returned [601, 602, 603, 605, 606, 607, 1192, 1193, 1199, 1200, 1210, 1214, 1217, 1219]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 738 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1206/1223 places, 1403/1403 transitions.
Applied a total of 0 rules in 22 ms. Remains 1206 /1206 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41103 ms. Remains : 1206/1223 places, 1403/1403 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((X(X(X(X((p0 U p1)))))||p2))))'
Stuttering acceptance computed with spot in 748 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-09
Stuttering criterion allowed to conclude after 2058 steps with 2 reset in 44 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00200-LTLFireability-09 finished in 41956 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(p0) U G(p1)) U p0)))'
Support contains 3 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1218 transition count 1403
Applied a total of 5 rules in 26 ms. Remains 1218 /1223 variables (removed 5) and now considering 1403/1403 (removed 0) transitions.
Running 1203 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-17226971054661111271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6016642849483469022.kers'
[2026-05-31 20:06:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17226971054661111271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6016642849483469022.kers]
Normalized transition count is 1402 out of 1403 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 1402 rows 1218 cols 2946 entries
Finished phase 1 with 1105 SingleSign rule and 97 generalized
[2026-05-31 20:06:22] [INFO ] Computed 16 invariants in 12 ms
Computed 16 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6016642849483469022.kers
Total runtime 14 ms.
[2026-05-31 20:06:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20026 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20029 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40317ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40319ms
[2026-05-31 20:07:02] [INFO ] Invariant cache hit.
[2026-05-31 20:07:03] [INFO ] Implicit Places using invariants in 746 ms returned [601, 602, 603, 604, 605, 606, 607, 1190, 1191, 1197, 1198, 1208, 1212, 1217]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 748 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1204/1223 places, 1403/1403 transitions.
Applied a total of 0 rules in 23 ms. Remains 1204 /1204 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41119 ms. Remains : 1204/1223 places, 1403/1403 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(p0) U G(p1)) U p0)))'
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND p0 (NOT p1))]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-10
Entered a terminal (fully accepting) state of product in 36894 steps with 6682 reset in 435 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00200-LTLFireability-10 finished in 41861 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 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Graph (complete) has 1856 edges and 1223 vertex of which 1221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 199 places and 196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 193 place count 1022 transition count 1015
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 1 with 571 rules applied. Total rules applied 764 place count 830 transition count 636
Reduce places removed 187 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 188 rules applied. Total rules applied 952 place count 643 transition count 635
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 955 place count 642 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 956 place count 641 transition count 633
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 199 Pre rules applied. Total rules applied 956 place count 641 transition count 434
Deduced a syphon composed of 199 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 5 with 406 rules applied. Total rules applied 1362 place count 434 transition count 434
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1362 place count 434 transition count 426
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1378 place count 426 transition count 426
Applied a total of 1378 rules in 39 ms. Remains 426 /1223 variables (removed 797) and now considering 426/1403 (removed 977) 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-14338476687504479021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13734728559579498745.kers'
[2026-05-31 20:07:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14338476687504479021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13734728559579498745.kers]
Normalized transition count is 425 out of 426 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 425 rows 426 cols 953 entries
Finished phase 1 with 327 SingleSign rule and 91 generalized
[2026-05-31 20:07:04] [INFO ] Computed 8 invariants in 5 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13734728559579498745.kers
Total runtime 5 ms.
[2026-05-31 20:07:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 91/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 317/634 variables, 317/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 217/851 variables, 109/434 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/852 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/852 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 435 constraints, problems are : Problem set: 0 solved, 27 unsolved in 6706 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 426/426 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/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 91/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 317/634 variables, 317/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 26/351 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 217/851 variables, 109/460 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/852 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/852 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/852 variables, and 461 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5073 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 426/426 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11815ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 11816ms
[2026-05-31 20:07:16] [INFO ] Invariant cache hit.
[2026-05-31 20:07:16] [INFO ] Implicit Places using invariants in 638 ms returned [206, 207, 208, 209, 210, 211, 212]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 639 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/1223 places, 426/1403 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 419 transition count 419
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 412 transition count 412
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 412 transition count 405
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 405 transition count 405
Applied a total of 35 rules in 18 ms. Remains 405 /419 variables (removed 14) and now considering 405/426 (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-13440498976118298154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4241985350862942435.kers'
[2026-05-31 20:07:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13440498976118298154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4241985350862942435.kers]
Normalized transition count is 404 out of 405 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 405 cols 897 entries
Finished phase 1 with 314 SingleSign rule and 90 generalized
[2026-05-31 20:07:16] [INFO ] Computed 1 invariants in 3 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4241985350862942435.kers
Total runtime 4 ms.
[2026-05-31 20:07:17] [INFO ] Implicit Places using invariants in 685 ms returned []
[2026-05-31 20:07:17] [INFO ] Invariant cache hit.
[2026-05-31 20:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:07:18] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/1223 places, 405/1403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14292 ms. Remains : 405/1223 places, 405/1403 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 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-14
Product exploration explored 100000 steps with 1144 reset in 939 ms.
Product exploration explored 100000 steps with 1144 reset in 993 ms.
Computed a total of 405 stabilizing places and 404 stable transitions
Computed a total of 405 stabilizing places and 404 stable transitions
Detected a total of 405/405 stabilizing places and 404/405 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 322 steps (0 resets) in 11 ms. (26 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 711 ms.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 405/405 transitions.
Applied a total of 0 rules in 14 ms. Remains 405 /405 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2026-05-31 20:07:21] [INFO ] Invariant cache hit.
[2026-05-31 20:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 90/295 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 295/590 variables, 295/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 219/809 variables, 110/406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/810 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/810 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 407 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3525 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 405/405 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 90/295 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 295/590 variables, 295/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 5/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 219/809 variables, 110/411 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/810 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/810 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 412 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2525 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 405/405 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6057ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 6057ms
[2026-05-31 20:07:27] [INFO ] Invariant cache hit.
[2026-05-31 20:07:28] [INFO ] Implicit Places using invariants in 666 ms returned []
[2026-05-31 20:07:28] [INFO ] Invariant cache hit.
[2026-05-31 20:07:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:07:29] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
[2026-05-31 20:07:29] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7819 ms. Remains : 405/405 places, 405/405 transitions.
Computed a total of 405 stabilizing places and 404 stable transitions
Computed a total of 405 stabilizing places and 404 stable transitions
Detected a total of 405/405 stabilizing places and 404/405 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 178 steps (0 resets) in 12 ms. (13 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 730 ms.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1143 reset in 938 ms.
Product exploration explored 100000 steps with 1135 reset in 1007 ms.
Built C files in :
/tmp/ltsmin5054038512086497539
[2026-05-31 20:07:32] [INFO ] Computing symmetric may disable matrix : 405 transitions.
[2026-05-31 20:07:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:07:32] [INFO ] Computing symmetric may enable matrix : 405 transitions.
[2026-05-31 20:07:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:07:32] [INFO ] Computing Do-Not-Accords matrix : 405 transitions.
[2026-05-31 20:07:32] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:07:32] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5054038512086497539
Running compilation step : cd /tmp/ltsmin5054038512086497539;'/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'
Compilation finished in 985 ms.
Running link step : cd /tmp/ltsmin5054038512086497539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5054038512086497539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1912250953606460834.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 405/405 transitions.
Applied a total of 0 rules in 9 ms. Remains 405 /405 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 20:07:47] [INFO ] Invariant cache hit.
[2026-05-31 20:07:47] [INFO ] Implicit Places using invariants in 670 ms returned []
[2026-05-31 20:07:47] [INFO ] Invariant cache hit.
[2026-05-31 20:07:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:07:48] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2026-05-31 20:07:48] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1725 ms. Remains : 405/405 places, 405/405 transitions.
Built C files in :
/tmp/ltsmin18263539362104333303
[2026-05-31 20:07:48] [INFO ] Computing symmetric may disable matrix : 405 transitions.
[2026-05-31 20:07:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:07:48] [INFO ] Computing symmetric may enable matrix : 405 transitions.
[2026-05-31 20:07:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:07:48] [INFO ] Computing Do-Not-Accords matrix : 405 transitions.
[2026-05-31 20:07:48] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:07:48] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18263539362104333303
Running compilation step : cd /tmp/ltsmin18263539362104333303;'/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'
Compilation finished in 947 ms.
Running link step : cd /tmp/ltsmin18263539362104333303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin18263539362104333303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4925751289744759848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 20:08:03] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:08:03] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:08:03] [INFO ] Time to serialize gal into /tmp/LTL16299100784137108334.gal : 3 ms
[2026-05-31 20:08:03] [INFO ] Time to serialize properties into /tmp/LTL14758373932119263476.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/LTL16299100784137108334.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17463720244922872081.hoa' '-atoms' '/tmp/LTL14758373932119263476.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...320
Loading property file /tmp/LTL14758373932119263476.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17463720244922872081.hoa
Detected timeout of ITS tools.
[2026-05-31 20:08:18] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:08:18] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:08:18] [INFO ] Time to serialize gal into /tmp/LTL12422931082390792817.gal : 2 ms
[2026-05-31 20:08:18] [INFO ] Time to serialize properties into /tmp/LTL1183125250626427912.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/LTL12422931082390792817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1183125250626427912.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 : !((G(F("(p1609<1)"))))
Formula 0 simplified : FG!"(p1609<1)"
Detected timeout of ITS tools.
[2026-05-31 20:08:34] [INFO ] Flatten gal took : 17 ms
[2026-05-31 20:08:34] [INFO ] Applying decomposition
[2026-05-31 20:08:34] [INFO ] Flatten gal took : 12 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/graph16890462936237363976.txt' '-o' '/tmp/graph16890462936237363976.bin' '-w' '/tmp/graph16890462936237363976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16890462936237363976.bin' '-l' '-1' '-v' '-w' '/tmp/graph16890462936237363976.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:08:34] [INFO ] Decomposing Gal with order
[2026-05-31 20:08:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:08:34] [INFO ] Removed a total of 287 redundant transitions.
[2026-05-31 20:08:34] [INFO ] Flatten gal took : 38 ms
[2026-05-31 20:08:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2026-05-31 20:08:34] [INFO ] Time to serialize gal into /tmp/LTL13870929592789617110.gal : 3 ms
[2026-05-31 20:08:34] [INFO ] Time to serialize properties into /tmp/LTL3188220603339675551.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/LTL13870929592789617110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3188220603339675551.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(u163.p1609<1)"))))
Formula 0 simplified : FG!"(u163.p1609<1)"
Reverse transition relation is NOT exact ! Due to transitions t544, t1204_t950_t142, t1210_t951_t144, t1213_t952_t147, t1220_t955_t150, t1224_t956_t151, t1...4680
Computing Next relation with stutter on 7.23122e+61 deadlock states
Detected timeout of ITS tools.
Treatment of property SupplyChain-PT-00200-LTLFireability-14 finished in 105045 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(X(X(X(G(p0)))))))'
Support contains 2 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 1403/1403 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1218 transition count 1403
Applied a total of 5 rules in 26 ms. Remains 1218 /1223 variables (removed 5) and now considering 1403/1403 (removed 0) transitions.
Running 1203 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-18332893317460269714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1875598719868864977.kers'
[2026-05-31 20:08:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18332893317460269714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1875598719868864977.kers]
Normalized transition count is 1402 out of 1403 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1402 rows 1218 cols 2946 entries
Finished phase 1 with 1105 SingleSign rule and 97 generalized
[2026-05-31 20:08:49] [INFO ] Computed 16 invariants in 8 ms
Computed 16 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1875598719868864977.kers
Total runtime 10 ms.
[2026-05-31 20:08:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20036 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1203/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2621 variables, and 15 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 20026 ms.
Refiners :[Generalized P Invariants (flows): 15/16 constraints, State Equation: 0/1218 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40325ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 40327ms
[2026-05-31 20:09:29] [INFO ] Invariant cache hit.
[2026-05-31 20:09:30] [INFO ] Implicit Places using invariants in 738 ms returned [601, 602, 603, 604, 605, 606, 607, 1190, 1191, 1197, 1198, 1208, 1215, 1217]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 740 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1204/1223 places, 1403/1403 transitions.
Applied a total of 0 rules in 22 ms. Remains 1204 /1204 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41119 ms. Remains : 1204/1223 places, 1403/1403 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(X(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SupplyChain-PT-00200-LTLFireability-15
Entered a terminal (fully accepting) state of product in 667 steps with 0 reset in 13 ms.
FORMULA SupplyChain-PT-00200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SupplyChain-PT-00200-LTLFireability-15 finished in 41458 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((p0 U X(p1)))||X(F(p2))))'
Spot run failed in 48 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.
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)))'
Spot run failed in 38 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:09:30] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8974276781103588329
[2026-05-31 20:09:30] [INFO ] Applying decomposition
[2026-05-31 20:09:30] [INFO ] Computing symmetric may disable matrix : 1403 transitions.
[2026-05-31 20:09:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:09:30] [INFO ] Computing symmetric may enable matrix : 1403 transitions.
[2026-05-31 20:09:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:09:30] [INFO ] Flatten gal took : 17 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/graph5820871384943748628.txt' '-o' '/tmp/graph5820871384943748628.bin' '-w' '/tmp/graph5820871384943748628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5820871384943748628.bin' '-l' '-1' '-v' '-w' '/tmp/graph5820871384943748628.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:09:30] [INFO ] Decomposing Gal with order
[2026-05-31 20:09:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:09:31] [INFO ] Removed a total of 310 redundant transitions.
[2026-05-31 20:09:31] [INFO ] Flatten gal took : 33 ms
[2026-05-31 20:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 28 ms.
[2026-05-31 20:09:31] [INFO ] Time to serialize gal into /tmp/LTLFireability10006445687695699564.gal : 7 ms
[2026-05-31 20:09:31] [INFO ] Time to serialize properties into /tmp/LTLFireability1607819268870096181.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/LTLFireability10006445687695699564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1607819268870096181.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 2 LTL properties
[2026-05-31 20:09:31] [INFO ] Computing Do-Not-Accords matrix : 1403 transitions.
Checking formula 0 : !(((G(("(u167.p1725<1)")U(X("((i1.u190.p1659>=1)&&(i1.u1.p1857>=1))"))))||(X(F("((u167.p1725<1)||(((i0.u0.p1009>=1)&&(i58.u66.p201>=1)...182
[2026-05-31 20:09:31] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Formula 0 simplified : F(!"(u167.p1725<1)" R X!"((i1.u190.p1659>=1)&&(i1.u1.p1857>=1))") & XG!"((u167.p1725<1)||(((i0.u0.p1009>=1)&&(i58.u66.p201>=1))&&(i0...171
[2026-05-31 20:09:31] [INFO ] Built C files in 352ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8974276781103588329
Running compilation step : cd /tmp/ltsmin8974276781103588329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
Reverse transition relation is NOT exact ! Due to transitions t142, t144, t147, t149, t150, t151, t152, t153, t154, t155, t159, t161, t164, t165, t166, t16...1869
Computing Next relation with stutter on 7.23122e+61 deadlock states
Compilation finished in 5070 ms.
Running link step : cd /tmp/ltsmin8974276781103588329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin8974276781103588329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](((LTLAPp0==true) U X((LTLAPp1==true))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8974276781103588329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](((LTLAPp0==true) U X((LTLAPp1==true))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8974276781103588329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-31 20:33:36] [INFO ] Flatten gal took : 31 ms
[2026-05-31 20:33:36] [INFO ] Time to serialize gal into /tmp/LTLFireability2008388542973623857.gal : 5 ms
[2026-05-31 20:33:36] [INFO ] Time to serialize properties into /tmp/LTLFireability2099425432092824828.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/LTLFireability2008388542973623857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2099425432092824828.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...297
Read 2 LTL properties
Checking formula 0 : !(((G(("(p1725<1)")U(X("((p1659>=1)&&(p1857>=1))"))))||(X(F("((p1725<1)||(((p1009>=1)&&(p201>=1))&&(p806>=1)))")))))
Formula 0 simplified : F(!"(p1725<1)" R X!"((p1659>=1)&&(p1857>=1))") & XG!"((p1725<1)||(((p1009>=1)&&(p201>=1))&&(p806>=1)))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8974276781103588329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin8974276781103588329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](((LTLAPp0==true) U X((LTLAPp1==true))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
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-00200"
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-00200, 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-178024402800212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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